Here is my complete list of publications.
Chi-binding functions for squares of convex bipartite graphs and partite testability for bipartite squares, with L. Sunil Chandran, Dibyayan Chakrabarti, and Raji R. Pillai, Journal of Graph Theory (2026), available online. [Journal version].
Spanning caterpillar in biconvex bipartite graphs, with Dhanyamol Antony, Anita Das, Shirish Gosavi, and Shashanka Kulamarva, Discrete Applied Mathematics, 356, 32-36 (2024).[Journal version].
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring, with L. Sunil Chandran, Talha Hashim, Rogers Mathew, Deepak Rajendraprasad, and Nitin Singh, Discrete Mathematics, 347(4):113894 (2024). [Journal version]
The Lexicographic Method for the Threshold Cover Problem, with Mathew Francis, Discrete Mathematics, 346(6):113364 (2023). [ Journal version].
On the Kernel and Related Problems in Interval Digraphs, with Mathew Francis and Pavol Hell, Algorithmica, 85(6): 1522-1559 (2023). [Journal version].
Extending some results on the second neighborhood conjecture, with Suresh Dara, Mathew Francis, and N Narayanan, Discrete Applied Mathematics, 311:1--17 (2022) [Journal version].
Uniquely Restricted Matchings in interval graphs, with Mathew Francis and Satyabrata Jana, SIAM Journal on Discrete Mathematics. 32(1): 148–172 (2018). [Journal version] [arxiv].
Parameterized algorithms for graph inversion, with Dhanyamol Antony, L. Sunil Chandran, and R. B. Sandeep (IWOCA 2026).
Bipartite domination in graphs: Complexity and algorithms, with Bhawani Shankar Panda and Subhasmita Joshi, Proceedings of the Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025), 234-246 .
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness, with Dhanya Antony, L. Sunil Chandran, Ankit Gayen, and Shirish Gosavi, Proceedings of Latin American Symposium (LATIN 2024), 97-113.
On the Kernel and Related Problems in Interval Digraphs, with Mathew Francis and Pavol Hell, Proceedings of the International Symposium on Algorithms and Computation (ISAAC 2021), 17:1–17.
The Lexicographic Method for the Threshold Cover Problem with Mathew Francis, Proceedings of the Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), 41–52.
Graph Burning: Bounds and Hardness, with Dhanyamol Antony, Anita Das, Shirish Gosavi, and Shashanka Kulamarva [arxiv].
The full journal version of Bipartite domination in graphs: Complexity and algorithms, with Bipartite domination in graphs: Complexity and algorithms.
The full journal version of Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness, with Dhanya Antony, L. Sunil Chandran, Ankit Gayen, and Shirish Gosavi [arxiv].
Title: Study of some graph theoretic problems via vertex orderings [PDF]
PhD Supervisor: Dr. Mathew C. Francis