Kaustav Paul

According to our database, Kaustav Paul authored at least 11 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Locating-dominating partitions for some classes of graphs.

Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan

CoRR, June, 2025

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes.

Florent Foucaud, Arti Pandey, Kaustav Paul

CoRR, March, 2025

Exploring algorithmic solutions for the Independent Roman Domination problem in graphs.

Kaustav Paul, Ankit Sharma, Arti Pandey

Discret. Appl. Math., 2025

Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond.

Tanvir Kaur, Kaustav Paul, Kaushik Mondal

Proceedings of the Distributed Computing and Intelligent Technology, 2025

2024

Perfect Italian domination on some generalizations of cographs.

Kaustav Paul, Arti Pandey

Comput. Appl. Math., September, 2024

Algorithmic results for weak Roman domination problem in graphs.

Kaustav Paul, Ankit Sharma, Arti Pandey

Discret. Appl. Math., 2024

(Independent) Roman Domination Parameterized by Distance to Cluster.

Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul

Proceedings of the Combinatorial Optimization and Applications, 2024

Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms.

Kaustav Paul, Arti Pandey

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Complexity of Total Dominator Coloring in Graphs.

Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul

Graphs Comb., December, 2023

Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.

Kaustav Paul, Arti Pandey

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Complexity of Paired Domination in AT-free and Planar Graphs.

Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022