Published articles (in Journals)
Paul, K. & Pandey, A. Eternal connected vertex cover problem in graphs: Complexity and algorithms. Theor. Comput. Sci. 1055, 115509. https://doi.org/10.1016/j.tcs.2025.115509 (2025)
Kaur, T., Paul, K. & Mondal, K. Mobile agents on chordal graphs: Maximum independent set and beyond. Theor. Comput. Sci. 1055, 115490. https://doi.org/10.1016/j.tcs.2025.115490 (2025).
Paul, K., Sharma, A. & Pandey, A. Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs. Discret. Appl. Math. 364, 143–152. https://doi.org/10.1016/j.dam.2024.12.017. (2024)
Paul, K., Sharma, A. & Pandey, A. Algorithmic results for weak Roman domination problem in graphs. Discret. Appl. Math. 359, 278–289. https://doi.org/10.1016/j.dam.2024.08.007 (2024)
Paul, K. & Pandey, A. Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. J. Graph Algorithms Appl. (Preliminary version of this paper was accepted in WALCOM 2023) 28, 69–85. https://doi.org/10.7155/jgaa.v28i3.2972 (2024)
Paul, K. & Pandey, A. Perfect Italian domination on some generalizations of cographs. Comput. Appl. Math. 43, 390. https://doi.org/10.1007/s40314-024-02901-5 (2024)
Henning, M. A., Kusum, Pandey, A. & Paul, K. Complexity of Total Dominator Coloring in Graphs. Graphs Comb. 39, 128. https://doi.org/10.1007/s00373-023-02726-9 (2023)
Tripathi, V., Kloks, T., Pandey, A., Paul, K. & Wang, H. Complexity of paired domination in AT-free and planar graphs. Theor. Comput. Sci. 930, 53–62. https://doi.org/10.1016/j.tcs.2022.07.010 (2022)
Under review
Foucaud, F., Pandey, A. & Paul, K. Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. (Under Review)[Arxiv]
Kloks, T. & Paul, K. Odd Domination in Some Classes of Graphs. (Under Review)
Foucaud, F., Maniya, P.V., Paul, K. & Pradhan, D. Locating-dominating partitions for some classes of graphs. (Under Review)[Arxiv]
Santra, K., Pandey, A. and Paul, K. Vertex Edge Domination on some subclasses of bipartite graphs. (Under Review).
In preparation
Gutiérrez, J. and Paul, K. (Total) Domination vs (Open) Packing in graphs. (In preparation)
Dey, S., Foucaud, F., Gahlawat, H. and Paul, K. Algorithmic results on the Minimum Consistent Subset Problem. (In preparation)
Sharma, A., Paul, K. and Pandey, A. Conflict-free Coloring for some restricted graph classes. (In preparation).
Ashok, P., Das, G.K., Pandey, A., Paul, K., Paul, S. & Sharma, A. Variants of Roman Domination parameterized by distance to cluster. (In preparation)
Conference Papers
2025 Co-authored a paper titled " Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond" at ICDCIT 2025, KIIT, Bhubaneswar, India (This paper got the best paper award)
2024 Presented my paper titled "(Independent) Roman Domination parameterized by Distance to Cluster" at COCOA 2024, Beijing University of Posts and Telecommunication, China
2024 Presented my paper titled "Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms" at CALDAM 2024, Indian Institute of Technology Bhilai, India
2023 Presented my paper titled "Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs" at WALCOM 2023 (Virtual mode), Hsinchu, Taiwan