Abstract is missing.
- Complexity of Restricted Variant of Star ColouringM. A. Shalu, Cyriac Antony. 3-14 [doi]
- Partitioning Cographs into Two Forests and One Independent SetPavol Hell, César Hernández-Cruz, Anurag Sanyal. 15-27 [doi]
- Monitoring the Edges of a Graph Using DistancesFlorent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan 0001. 28-40 [doi]
- The Lexicographic Method for the Threshold Cover ProblemMathew C. Francis, Dalu Jacob. 41-52 [doi]
- Approximating Modular Decomposition Is HardMichel Habib, Lalla Mouatadid, Mengchuan Zou. 53-66 [doi]
- Vertex-Edge Domination in Unit Disk GraphsSangram K. Jena, Gautam K. Das. 67-78 [doi]
- Geometric Planar Networks on Bichromatic PointsSayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg. 79-91 [doi]
- Hardness Results of Global Total k-Domination Problem in GraphsB. S. Panda, Pooja Goyal. 92-101 [doi]
- Hardness and Approximation for the Geodetic Set Problem in Some Graph ClassesDibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy. 102-115 [doi]
- Maximum Weighted Edge Biclique Problem on Bipartite GraphsArti Pandey, Gopika Sharma, Nivedit Jain. 116-128 [doi]
- Determining Number of Generalized and Double Generalized Petersen GraphAngsuman Das. 131-140 [doi]
- Self-centeredness of Generalized Petersen GraphsPriyanka Singh, Pratima Panigrahi, Aakash Singh. 141-155 [doi]
- Weak Roman Bondage Number of a GraphP. Roushini Leely Pushpam, N. Srilakshmi. 156-166 [doi]
- On the Geodetic and Hull Numbers of Shadow GraphsS. V. Ullas Chandran, Mitre Costa Dourado, Maya G. S. Thankachy. 167-177 [doi]
- Indicated Coloring of Complete Expansion and Lexicographic Product of GraphsP. Francis, S. Francis Raj, M. Gokulnath. 178-183 [doi]
- 2l+1-Critical Graphs of Odd-Girth 2k+1Laurent Beaudou, Florent Foucaud, Reza Naserasr. 184-196 [doi]
- Ramsey Numbers for Line GraphsHuzaifa Abbasi, Manu Basavaraju, Eeshwar Gurushankar, Yash Jivani, Deepak Srikanth. 197-208 [doi]
- $\varDelta $-Convexity Number and $\varDelta $-Number of Graphs and Graph ProductsBijo S. Anand, Prasanth G. Narasimha-Shenoi, Sabeer Sain Ramla. 209-218 [doi]
- On Cartesian Products of Signed GraphsDimitri Lajou. 219-234 [doi]
- th Power of Hypercube and Cartesian Powers of a GraphL. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar. 235-247 [doi]
- On Algebraic Expressions of Two-Terminal Directed Acyclic GraphsMark Korenblit, Vadim E. Levit. 248-259 [doi]
- The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10Soura Sena Das, Soumen Nandi, Sagnik Sen 0001. 260-266 [doi]
- On the Minimum Satisfiability ProblemUmair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti. 269-281 [doi]
- Waiting for Trains: Complexity ResultsBjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger. 282-303 [doi]
- Oriented Diameter of Star GraphsK. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep. 307-317 [doi]
- Gathering over Meeting Nodes in Infinite GridSubhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya. 318-330 [doi]
- 0-1 Timed Matching in Bipartite Temporal GraphsSubhrangsu Mandal, Arobinda Gupta. 331-346 [doi]
- Arbitrary Pattern Formation by Opaque Fat Robots with LightsKaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau. 347-359 [doi]
- Greedy Universal Cycle Constructions for Weak OrdersMarsden Jacques, Dennis Wong. 363-370 [doi]
- A New Model in Firefighting TheoryRolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald. 371-383 [doi]
- An Algorithm for Strong Stability in the Student-Project Allocation Problem with TiesSofiat Olaosebikan, David Manlove. 384-399 [doi]
- Overlaying a Hypergraph with a Graph with Bounded Maximum DegreeFrédéric Havet, Dorian Mazauric, Viet Ha Nguyen, Rémi Watrigant. 403-414 [doi]
- Parameterized Algorithms for Directed Modular WidthRaphael Steiner, Sebastian Wiederrecht. 415-426 [doi]
- On the Parameterized Complexity of Spanning Trees with Small Vertex CoversChamanvir Kaur, Neeldhara Misra. 427-438 [doi]
- Minimum Conflict Free Colouring Parameterized by TreewidthPradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav. 439-450 [doi]
- Planar Projections of GraphsN. R. Aravind, Udit Maniyar. 453-462 [doi]
- New Algorithms and Bounds for Halving PseudolinesSergey Bereg, Mohammadreza Haghpanah. 463-475 [doi]
- Algorithms for Radon Partitions with ToleranceSergey Bereg, Mohammadreza Haghpanah. 476-487 [doi]