Abstract is missing.
- A Proof of the Multiplicative 1-2-3 ConjectureJulien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena. 3-14 [doi]
- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free graphsAthmakoori Prashant, P. Francis, S. Francis Raj. 15-21 [doi]
- List Homomorphisms to Separable Signed GraphsJan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková. 22-35 [doi]
- Some Position Problems for GraphsJames Tuite, Elias John Thomas, S. V. Ullas Chandran. 36-47 [doi]
- Comparability Graphs Among Cover-Incomparability GraphsArun Anil, Manoj Changat. 48-61 [doi]
- Complexity of Paired Domination in AT-free and Planar GraphsVikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang. 65-77 [doi]
- The Complexity of Star Colouring in Bounded Degree Graphs and Regular GraphsM. A. Shalu, Cyriac Antony. 78-90 [doi]
- On Conflict-Free Spanning Tree: Algorithms and ComplexityBruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza. 91-102 [doi]
- 0-VPG Representation of AT-free Outerplanar GraphsSparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad. 103-114 [doi]
- P Versus NPC: Minimum Steiner Trees in Convex Split GraphsA. Mohanapriya, P. Renjith, N. Sadagopan. 115-126 [doi]
- 4-free Chordal GraphsM. A. Shalu, V. K. Kirubakaran. 127-139 [doi]
- An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic GraphsAndrzej Lingas, Mia Persson, Dzmitry Sledneu. 140-151 [doi]
- Covering a Graph with Densest SubgraphsRiccardo Dondi, Alexandru Popa 0001. 152-163 [doi]
- Coresets for (k, ℓ )-Median Clustering Under the Fréchet DistanceMaike Buchin, Dennis Rohde. 167-180 [doi]
- Bounds and Algorithms for Geodetic HullsSabine Storandt. 181-194 [doi]
- Voronoi Games Using GeodesicsArun Kumar Das, Sandip Das 0001, Anil Maheshwari, Swami Sarvattomananda. 195-207 [doi]
- Approximation and Parameterized Algorithms for Balanced Connected Partition ProblemsPhablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi. 211-223 [doi]
- Algorithms for Online Car-Sharing ProblemXiangyu Guo, Kelin Luo. 224-236 [doi]
- Algebraic Algorithms for Variants of Subset SumPranjal Dutta, Mahesh Sreekumar Rajasree. 237-251 [doi]
- Hardness and Approximation Results for Some Variants of Stable Marriage ProblemB. S. Panda 0001, Sachin. 252-264 [doi]
- On Fair Division with Binary Valuations Respecting Social NetworksNeeldhara Misra, Debanuj Nayak. 265-278 [doi]
- Parameterized Intractability of Defensive Alliance ProblemAjinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi. 279-291 [doi]
- On the Approximability of Path and Cycle Problems in Arc-Dependent NetworksPiotr J. Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson. 292-304 [doi]
- Approximation Algorithms in Graphs with Known Broadcast Time of the Base GraphPuspal Bhabak, Hovhannes A. Harutyunyan. 305-316 [doi]