## ACCEPTED PAPERS

Author(s) | Paper Title |
---|---|

Shalu M. A. and Cyriac Antony | Complexity of Restricted Variant of Star Colouring |

Angsuman Das | Determining Number of Generalized and Double Generalized Petersen Graph |

Umair Arif, Robert Benkoczi, Daya Gaur and Ramesh Krishnamurti | On the minimmum satisfiability problem |

Ajish Kumar K S, Deepak Rajendraprasad and Sudeep K S | Oriented Diameter of Star Graphs |

P. Roushini Leely Pushpam and Srilakshmi | Weak Roman Bondage Number of a Graph |

Frédéric Havet, Dorian Mazauric, Ha Nguyen and Rémi Watrigant | Overlaying a hypergraph with a graph with bounded maximum degree |

Pavol Hell, César Hernández-Cruz and Anurag Sanyal | Partitioning cographs into two forests and one independent set |

Ullas Chandran S. V., Mitre C. Dourado and Maya G. S. Thankachy | On the geodetic and hull numbers of shadow graphs |

Francis Raj S, Francis P and Gokulnath M | Indicated coloring of complete expansion and lexicographic product of graphs |

Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das and Krishnendu Mukhopadhyaya | Gathering over Meeting Nodes of Infinite Grid |

Laurent Beaudou, Florent Foucaud and Reza Naserasr | Smallest C_{2l+1}-critical graphs of odd-girth 2k+1 |

Florent Foucaud, Ralf Klasing, Mirka Miller and Joe Ryan | Monitoring the edges of a graph using distances |

Raphael Steiner and Sebastian Wiederrecht | Parameterized Algorithms for Directed Modular Width |

Marsden Jacques and Dennis Wong | Greedy universal cycle constructions for weak orders |

Mathew Francis and Dalu Jacob | Forbidden 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 Zieger | Waiting for Trains: Complexity Results |

Subhrangsu Mandal and Arobinda Gupta | 0-1 Timed Matching in Bipartite Temporal Graphs |

Sangram K. Jena and Gautam K. Das | Vertex Edge Dominating Set in Unit Disk Graphs |

Manu Basavaraju, Yash Jivani, Huzaifa Abbasi, Eeshwar Gurushankar and Deepak Srikanth | Ramsey 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 Schwarzwald | A New Model in Firefighting Theory |

Aravind Nr and Udit Maniyar | Planar projections of graphs |

Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu and Buddhadeb Sau | Arbitrary Pattern Formation by Opaque Fat Robots with Lights |

Dimitri Lajou | On Cartesian products of signed graphs |

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore and Martin Nöllenburg | Geometric Planar Networks on Bichromatic Points |

Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh and Bodhayan Roy | Hardness and approximation for the geodetic set problem in some graph classes |

Sajith Padinhatteeri, L. Sunil Chandran and Karthik Ravi Shankar | List distinguishing number of $p^{\text{th}}$ power of hypercube and Cartesian powers of a graph |

Sofiat Olaosebikan and David Manlove | An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties |

Chamanvir Kaur and Neeldhara Misra | On the Complexity of Spanning Trees with a Small Vertex Cover |

Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid and Dolly Yadav | Minimum Conflict free Colouring Parameterized by Treewidth |

Sergey Bereg and Mohammadreza Haghpanah | New Algorithms and Bounds for Halving Pseudolines |

Sergey Bereg and Mohammadreza Haghpanah | Algorithms for Radon Partitions with Tolerance |

Soura Sena Das, Soumen Nandi and Sagnik Sen | On the relative oriented clique number of planar graphs |

Priyanka Singh, Pratima Panigrahi and Aakash Singh | Self-centeredness of generalized Petersen graphs |

Michel Habib, Lalla Mouatadid and Mengchuan Zou | Approximating Modular Decomposition is Hard |

B S Panda and Pooja Goyal | Algorithmic Aspects of Global Total k-Domination in Graphs |

Arti Pandey, Gopika Sharma and Nivedit Jain | Maximum Weighted Edge Biclique Problem on Bipartite Graphs |

Mark Korenblit and Vadim Levit | On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs |