VLDB 2026 Research / reviewers in the wild / expert
Dinabandhu Pradhan
dblp:82/2341
· DBLP profile ↗
20ranked-venue papers
3as first author
7since 2021 · last 2026
0009-0002-1904-7995ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 19 · 3 first-author · 7 since 2021Databases, data management, data science and information retrieval · 5 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Disjunctive domination in maximal outerplanar graphs
Michael A. Henning, Paras Maniya, Dinabandhu Pradhan |
Discret. Appl. Math. | 3 |
| 2025 | List recoloring of planar graphs
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan |
Discret. Appl. Math. | 3 |
| 2024 | Roman {3}-domination in graphs: Complexity and algorithms
Juhi Chaudhary, Dinabandhu Pradhan |
Discret. Appl. Math. | 2 |
| 2024 | Strengthening Brooks' chromatic bound on P6-free graphs
Uttam K. Gupta, Dinabandhu Pradhan |
Discret. Appl. Math. | 2 |
| 2023 | Unique Response Roman Domination: Complexity and Algorithms
Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan |
Algorithmica | 3 |
| 2022 | Perfect Italian domination in graphs: Complexity and algorithms
Dinabandhu Pradhan, Sumanta Banerjee, Jia-Bao Liu |
Discret. Appl. Math. | 1 |
| 2021 | Differentiating-total domination: Approximation and hardness results
Bhawani Sankar Panda, Pooja Goyal, Dinabandhu Pradhan |
Theor. Comput. Sci. | 3 |
| 2020 | Algorithm and hardness results on hop domination in graphs
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan |
Inf. Process. Lett. | 3 |
| 2020 | Algorithmic aspects of upper paired-domination in graphs
Michael A. Henning, Dinabandhu Pradhan |
Theor. Comput. Sci. | 2 |
| 2020 | Algorithm and hardness results on neighborhood total domination in graphs
Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee |
Theor. Comput. Sci. | 2 |
| 2019 | Computing a minimum paired-dominating set in strongly orderable graphs
Dinabandhu Pradhan, Bhawani Sankar Panda |
Discret. Appl. Math. | 1 |
| 2019 | The secure domination problem in cographs
Anupriya Jha, Dinabandhu Pradhan, Sumanta Banerjee |
Inf. Process. Lett. | 2 |
| 2019 | Perfect Roman domination in graphs
Sumanta Banerjee, J. Mark Keil, Dinabandhu Pradhan |
Theor. Comput. Sci. | 3 |
| 2017 | An algorithm for the maximum weight independent set problem on outerstring graphs
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle |
Comput. Geom. | 3 |
| 2015 | Hardness results, approximation and exact algorithms for liar's domination problem in graphs
Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan |
Theor. Comput. Sci. | 3 |
| 2013 | A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
Bhawani Sankar Panda, Dinabandhu Pradhan |
Discret. Appl. Math. | 2 |
| 2013 | Computing a minimum outer-connected dominating set for the class of chordal graphs
J. Mark Keil, Dinabandhu Pradhan |
Inf. Process. Lett. | 2 |
| 2012 | Algorithmic aspects of k-tuple total domination in graphs
Dinabandhu Pradhan |
Inf. Process. Lett. | 1 |
| 2012 | Complexity of distance paired-domination problem in graphs
Gerard J. Chang, Bhawani Sankar Panda, Dinabandhu Pradhan |
Theor. Comput. Sci. | 3 |
| 2010 | Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
Bhawani Sankar Panda, Dinabandhu Pradhan |
Inf. Process. Lett. | 2 |