Regular Papers

1. Sangam Balchandar Reddy. Hardness and Algorithmic Results for Roman \{3\}-Domination

2. Sasmita Rout and Gautam K Das. Hardness and Approximation Results on the Total Dominating Set Problem

3. Huu An Phan, Duc A. Hoang and Nhat Quan Lam. A Note on Reconfiguration Graphs of Cliques

4. Clemens Brand and Wilfried Imrich. The hierarchical product of finite and infinite graphs

5. Rajat Adak and L. Sunil Chandran. Localization: A Framework to Generalize Extremal Graph Problems

6. Mark Korenblit. Algebraic Expressions of Grid Graphs with Diagonal Edges

7. Yash Khanna. Exact recovery of planted cliques in semi-random graphs

8. Benny George Kenkireth, Gopalan Sajith and Sreyas Sasidharan. On Word-Representability of Minimal Non-comparability Graphs

9. Andrew Bloch-Hansen, Cody Rossiter and Roberto Solis-Oba. A Resonance Neural Network for the K-Median Problem

10. Joydeep Mukherjee and Tamojit Saha. Subset Feedback Vertex Set and Subset Vertex Cover on AT-free Graphs

11. Joydeep Mukherjee and Tamojit Saha. Outer-planar vertex deletion on AT-free graphs

12. A. A. Pereira and C. N. Campos. Matching extendability in cartesian product of hypercubes and paths

13. Joydeep Patar and I. Vinod Reddy. On Odd Coloring of Graphs

14. Khyodeno Mozhui and Tithi Dwary. Boxicity of a Class of Split Graphs using Words

15. Debasis Dwibedy and Rakesh Mohanty. Semi-online Scheduling with Lookahead

16. Bubai Manna. Minimum Selective Subset on Unit Disk Graphs and Circle Graphs

17. Lakshya Joshi, Arya Deshmukh, Atharv Chhabra and Chetan Gupta. Matrix Multiplication in the MPC model

18. Sergey Bereg and Jack N Truong. Constructing Permutation Codes under the Generalized Kendall-$\tau$ Metric

19. Manoj Changat, Lekshmi Kamal K. Sheela, Athulyakrishna Kuruppankandy and Ramakrishnan T.V. Cycle transit function, Interval function and betweenness

20. Lekshmi Kamal K. Sheela, Manoj Changat, Chithra M R and Peter F. Stadler. Directed weakly modular graphs and their directed interval functions

21. Srimanta Bhattacharya, Pawan Kumar, Deepak Rajendraprasad and Jishnu Sen. On Optimal Achromatic Coloring of $3$-Uniform Tight Cycles

22. Anil Kumar S and Narayanaswamy N.S.. Parameterized Hardness Results for the Restricted Santa Claus Problem

23. Rahul Das, Soumen Nandi and Ushnish Sarkar. A lower bound of location number

24. Kumud Singh Porte, Rb Sandeep and Kamal Santra. Improved upper bounds on color reversal by local inversions

25. Deepak Bakal and Yashwant Borse. Complexity Results on Paired Domination in Graphs

26. A. A. Pereira and C. N. Campos. Extending unlocked matchings in graphs

27. Rajashree Bar, Daibik Barik, Adri Bhattacharya and Partha Sarathi Mandal. Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents

28. Ravi Suthar, Raveena Raveena and Krishnendra Shekhawat. Area-Universality in Outerplanar Graphs

29. Sergey Bereg, Md Sanaullah Miah and Md Saiful Islam. New Lower Bounds for Permutation Codes in the Ulam Metric

30. Krishna Narayanan and Tamon Stephen. The Hardness of Monotone Eccentricity on Polytopes

31. Ramesh Hariharasubramanian and Suchanda Roy. On the Word-Representability of 5-Regular Circulant Graphs

32. Tapas Das, Pavan P D, Sagnik Sen and S Taruni. An update on pushable homomorphisms

33. Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad-Noori, Rasa Parvini Oskuei and Prafullkumar Tale. Algorithms and Hardness for Geodetic Set on Tree-like Digraphs

34. Prasad Chaugule. A new characterization of VNP via Colored Determinant

35. Subhasmita Joshi and Bhawani Sankar Panda. Complexity and Approximation Algorithm of $3$-component Domination in Graphs

Poster Papers

1. Vysakh Chakooth, Prasanth G. Narasimha-Shenoi and Prakash G. Narasimha-Shenoi. Eccentric Connectivity Index of Strongly Connected Digraphs

2. Sobyasachi Chatterjee. On the Hardness of Hop Domination and Total Hop Domination

3. Sandip Das, Sk Samim Islam, Ritam M Mitra and Sanchita Paul. Towards the Burning Number Conjecture

4. K. Mohamed Harith, Sounaka Mishra and B. V. Raghavendra Rao. On the Complexity of Maximum Component minus Vertex Cut

5. Abhishek Krishnamoorthy, Robinson Thamburaj and Durairaj Gnanaraj Thomas. On the Partitions Associated with Christoffel Words

6. Ranajit Senko and Gopalan Sajith. Efficient Approximate Priority Queues: Soft Heaps in the PEM Model

7. Sipra Singh. Dominating Set Knapsack: Profit Optimization on Dominating Sets