Kaustav Paul

22 papers B 1Misc 1Journal 17Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes.
Discret. Appl. Math.
Florent Foucaud, Arti Pandey, Kaustav Paul
2026 J jnl
Locating-dominating partitions for some classes of graphs.
Discret. Math.
Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2025 J jnl
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes.
CoRR
Florent Foucaud, Arti Pandey, Kaustav Paul
2025 J jnl
Exploring algorithmic solutions for the Independent Roman Domination problem in graphs.
Discret. Appl. Math.
Kaustav Paul, Ankit Sharma, Arti Pandey
2025 J jnl
Locating-dominating partitions for some classes of graphs.
CoRR
Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2025 Misc conf
Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond.
ICDCIT
Tanvir Kaur, Kaustav Paul, Kaushik Mondal
2025 J jnl
Mobile agents on chordal graphs: Maximum independent set and beyond.
Theor. Comput. Sci.
Tanvir Kaur, Kaustav Paul, Kaushik Mondal
2025 J jnl
Vertex-edge domination on subclasses of bipartite graphs.
CoRR
Arti Pandey, Kaustav Paul, Kamal Santra
2024 — conf
(Independent) Roman Domination Parameterized by Distance to Cluster.
COCOA (2)
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 J jnl
(Independent) Roman Domination Parameterized by Distance to Cluster.
CoRR
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul
2024 J jnl
Algorithmic Results for Weak Roman Domination Problem in Graphs.
CoRR
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 J jnl
Algorithmic results for weak Roman domination problem in graphs.
Discret. Appl. Math.
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 — conf
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms.
CALDAM
Kaustav Paul, Arti Pandey
2024 J jnl
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs.
CoRR
Kaustav Paul, Ankit Sharma, Arti Pandey
2024 J jnl
Perfect Italian domination on some generalizations of cographs.
Comput. Appl. Math.
Kaustav Paul, Arti Pandey
2024 J jnl
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.
J. Graph Algorithms Appl.
Kaustav Paul, Arti Pandey
2023 J jnl
Complexity of Total Dominator Coloring in Graphs.
Graphs Comb.
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
2023 J jnl
Complexity of total dominator coloring in graphs.
CoRR
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
2023 B conf
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.
WALCOM
Kaustav Paul, Arti Pandey
2022 — conf
Complexity of Paired Domination in AT-free and Planar Graphs.
CALDAM
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2022 J jnl
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci.
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
Complexity of Paired Domination in AT-free and Planar Graphs.
CoRR
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang