ACCEPTED PAPERS

Author(s)Paper Title
Shalu M. A. and Cyriac AntonyComplexity of Restricted Variant of Star Colouring
Angsuman DasDetermining Number of Generalized and Double Generalized Petersen Graph
Umair Arif, Robert Benkoczi, Daya Gaur and Ramesh KrishnamurtiOn the minimmum satisfiability problem
Ajish Kumar K S, Deepak Rajendraprasad and Sudeep K SOriented Diameter of Star Graphs
P. Roushini Leely Pushpam and SrilakshmiWeak Roman Bondage Number of a Graph
Frédéric Havet, Dorian Mazauric, Ha Nguyen and Rémi WatrigantOverlaying a hypergraph with a graph with bounded maximum degree
Pavol Hell, César Hernández-Cruz and Anurag SanyalPartitioning cographs into two forests and one independent set
Ullas Chandran S. V., Mitre C. Dourado and Maya G. S. ThankachyOn the geodetic and hull numbers of shadow graphs
Francis Raj S, Francis P and Gokulnath MIndicated coloring of complete expansion and lexicographic product of graphs
Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das and Krishnendu MukhopadhyayaGathering over Meeting Nodes of Infinite Grid
Laurent Beaudou, Florent Foucaud and Reza NaserasrSmallest C_{2l+1}-critical graphs of odd-girth 2k+1
Florent Foucaud, Ralf Klasing, Mirka Miller and Joe RyanMonitoring the edges of a graph using distances
Raphael Steiner and Sebastian WiederrechtParameterized Algorithms for Directed Modular Width
Marsden Jacques and Dennis WongGreedy universal cycle constructions for weak orders
Mathew Francis and Dalu JacobForbidden structure characterization of graphs having a threshold cover of size two: a simpler proof using the lexicographic method
Björn Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch and Stephan ZiegerWaiting for Trains: Complexity Results
Subhrangsu Mandal and Arobinda Gupta0-1 Timed Matching in Bipartite Temporal Graphs
Sangram K. Jena and Gautam K. DasVertex Edge Dominating Set in Unit Disk Graphs
Manu Basavaraju, Yash Jivani, Huzaifa Abbasi, Eeshwar Gurushankar and Deepak SrikanthRamsey Numbers for Line Graphs
Bijo S. Anand, Prasanth G. Narasimha-Shenoi and Sabeer Sain R.$\Delta$-Convexity number and $\Delta$-Number of Graphs and Graph Products
Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack and Barbara SchwarzwaldA New Model in Firefighting Theory
Aravind Nr and Udit ManiyarPlanar projections of graphs
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu and Buddhadeb SauArbitrary Pattern Formation by Opaque Fat Robots with Lights
Dimitri LajouOn Cartesian products of signed graphs
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore and Martin NöllenburgGeometric Planar Networks on Bichromatic Points
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh and Bodhayan RoyHardness and approximation for the geodetic set problem in some graph classes
Sajith Padinhatteeri, L. Sunil Chandran and Karthik Ravi ShankarList distinguishing number of $p^{\text{th}}$ power of hypercube and Cartesian powers of a graph
Sofiat Olaosebikan and David ManloveAn Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties
Chamanvir Kaur and Neeldhara MisraOn the Complexity of Spanning Trees with a Small Vertex Cover
Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid and Dolly YadavMinimum Conflict free Colouring Parameterized by Treewidth
Sergey Bereg and Mohammadreza HaghpanahNew Algorithms and Bounds for Halving Pseudolines
Sergey Bereg and Mohammadreza HaghpanahAlgorithms for Radon Partitions with Tolerance
Soura Sena Das, Soumen Nandi and Sagnik SenOn the relative oriented clique number of planar graphs
Priyanka Singh, Pratima Panigrahi and Aakash SinghSelf-centeredness of generalized Petersen graphs
Michel Habib, Lalla Mouatadid and Mengchuan ZouApproximating Modular Decomposition is Hard
B S Panda and Pooja GoyalAlgorithmic Aspects of Global Total k-Domination in Graphs
Arti Pandey, Gopika Sharma and Nivedit JainMaximum Weighted Edge Biclique Problem on Bipartite Graphs
Mark Korenblit and Vadim LevitOn Algebraic Expressions of Two-Terminal Directed Acyclic Graphs