Teaching
- Engineering Mathematics-II (Winter Semester, 2024-25)
- Theory of Computation (Winter Semester, 2024-25)
- Graph Algorithms (Monsoon Semester, 2024-25)
Designation: Associate Professor
Department: Mathematics & Computing
Email: dina[at]iitism[dot]ac[dot]in
Contact Number:
Office Number: +91-326-223-5191
Personal Page: Click Here
About Me: Dinabandhu Pradhan did his PhD from Department of Mathematics, IIT Delhi in 2011 in Graph Theory and Graph Algorithms. He was a postdoctoral fellow in the Department of Computer Science and Automation in the year 2011-2012 funded by NBHM and UGC-Kothari postdoctoral fellowships. He then was a NSERC postdoctoral fellow in the Department of Computer Science, University of Saskatchewan, Canada in the year 2012-2013. He then joined the Department of Mathematics and Statistics, IIT Jodhpur as an Assistant Professor in 2013; later he moved to IIT(ISM) Dhanbad. Currently he is an Associate Professor in the Department of Mathematics and Computing, IIT (ISM) Dhanbad.
Research Interest: Graph Theory And Graph Algorithms
M. A. Henning, P. Maniya, D. Pradhan, Paired versus double domination in forbidden graph classes, Computational and Applied Mathematics, 44 (2025) 71 PDF
J. Chaudhary, D. Pradhan, Roman {3}-domination in graphs: Complexity and algorithms, Discrete Applied Mathematics, 354 (2024) 301-325 PDF
Uttam K. Gupta, D. Pradhan, Strenthening Brooks' chromatic bounds on $P_6$-free graphs, Discrete Applied Mathematics, 342 (2024) 334-346 PDF
D. Bakhshesh, M. A. Henning, D. Pradhan, Singleton coalition graph chains, Computational and Applied Mathematics, 43 (2024) 85 PDF
P. Maniya, D. Pradhan, Towards the conjecture on domination versus edge domination in graphs, Bulletin of the Malaysian Mathematical Sciences Society, 47 (2024) 21 PDF
S. Banerjee, J. Chaudhary, D. Pradhan, Unique response Roman domination: Complexity and algorithms, Algorithmica, 85 (2023) 3889-3927 PDF
Uttam K. Gupta, Suchismita Mishra, D. Pradhan, Cops and robber on subclasses of $P_5$-free graphs, Discrete Mathematics, 346 (2023) 113353 PDF
M. A. Henning, S. Pal, D. Pradhan, Hop domination in chordal bipartite graphs, Discussiones Mathematicae Graph Theory, 43 (2023) 825-840 PDF
S. Paul, D. Pradhan, S. Verma, Vertex-edge domination in interval and bipartite permutation graphs, Discussiones Mathematicae Graph Theory, 43 (2023) 947-963 PDF
D. Bakhshesh, M. A. Henning, D. Pradhan, On the coalition number of trees, Bulletin of the Malaysian Mathematical Sciences Society, 46 (2023) 95 PDF
D. Pradhan, S. Banerjee, J.-B. Liu, Perfect Italian domination in graphs: Complexity and algorithms, Discrete Applied Mathematics, 319 (2022) 271-295 PDF
M. A. Henning, S. Pal, D. Pradhan, The semitotal domination problem in block graphs, Discussiones Mathematicae Graph Theory, 42 (2022) 231-248 PDF
B. S. Panda, Pooja Goyal, D. Pradhan, Differentiating-total domination: approximation and hardness results, Theoretical Computer Science, 876 (2021) 45-58 PDF
S. Banerjee, M. A. Henning, D. Pradhan, Perfect Italian domination in cographs, Applied Mathematics and Computation, 391 (2021) 125703 PDF
D. Pradhan, S. Pal, An $O(n+m)$-time algorithm for computing a minimum semitotal dominating set in an interval graph, Journal of Applied Mathematics and Computing, 66 (2021) 733-747 PDF
H. N. Kumar, D. Pradhan, Y. B. Venkatakrishnan, Double vertex-edge domination in graphs: complexity and algorithms, Journal of Applied Mathematics and Computing, 66 (2021) 245-262 PDF
Uttam K. Gupta, D. Pradhan, Borodin–Kostochka’s conjecture on $(P_5,C_4)$-free graphs, Journal of Applied Mathematics and Computing, 65 (2021) 877-884 PDF
Anupriya Jha, D. Pradhan, S. Banerjee, Algorithm and hardness results on neighborhood total domination in graphs, Theoretical Computer Science, 840 (2020) 16-32 PDF
M. A. Henning, D. Pradhan, Algorithmic aspects of upper paired-domination in graphs, Theoretical Computer Science, 804 (2020) 98-114 PDF
S. Banerjee, M. A. Henning, D. Pradhan, Algorithmic results on double Roman domination in graphs , Journal of Combinatorial Optimization, 39 (1) (2020) 90-114 PDF
M. A. Henning, S. Pal, D. Pradhan, Algorithm and hardness results on hop domination in graphs , Information Processing Letters, 153 (2020) 105872 PDF
S. Banjerjee, J. Mark Keil, D. Pradhan, Perfect Roman domination in graphs, Theoretical Computer Science, 796 (2019) 1-21 PDF
Anupriya Jha, D. Pradhan, S. Banerjee, The secure domination problem in cographs, Information Processing Letters, 145 (2019) 30-38 PDF
D. Pradhan and B. S. Panda, Computing a minimum paired-dominating set in strongly orderable graphs, Discrete Applied Mathematics, 253 (2019) 37-50 PDF
S. Pal, D. Pradhan, The strong domination problem in block graphs and proper interval graphs, Discrete Mathematics, Algorithms and Applications, 11 (6) (2019) PDF
D. Pradhan and Anupriya Jha, On computing a minimum secure dominating set in block graphs, Journal of Combinatorial Optimization, 35 (2018) 613-631 PDF
J. Mark Keil, Joseph Mitchell, D. Pradhan and Martin Vatshelle, An Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs, Computational Geometry: Theory and Applications (CGTA) 60 (2017) 19-25 PDF
J. Mark Keil, Joseph Mitchell, D. Pradhan and Martin Vatshelle, An Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs, Accepted in Canadian Conference on Computational Geometry (CCCG) 2015.
B. S. Panda and D. Pradhan, A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs, to appear in Discrete Mathematics, Algorithms and Applications, PDF
B. S. Panda, S. Paul, and D. Pradhan, Hardness results, approximation and exact algorithms for liar's domination problem in graphs, Theoretical Computer Science, 573 (2015) 26-42 PDF
D. Pradhan, On the complexity of the minimum outer-connected dominating set problem in graphs, Journal of Combinatorial Optimization, 31 (2016) 1-12 PDF
B. S. Panda and D. Pradhan, Minimum paired-dominating sets in chordal bipartite graphs and perfect elimination bipartite graphs, Journal of Combinatorial Optimization, 26 (4) (2013) 770-785 PDF
B. S. Panda and D. Pradhan, A linear time algorithm for computing a minimum paired-dominating set in convex bipartite graphs, Discrete Applied Mathematics, 161 ( 2013) 1776-1783 PDF
J. Mark Keil and D. Pradhan, Computing a minimum outer-connected dominating set for the class of chordal graphs, Information Processing Letters, 113 ( 2013) 552-561 PDF
Gerard J. Chang, B. S. Panda, and D. Pradhan, Complexity of distance paired-domination problem in graphs, Theoretical Computer Science 459 (2012) 89-99 PDF
D. Pradhan, Algorithmic aspects of $k$-tuple total domination in graphs, Information Processing Letters, 112 ( 2012) 816-822 PDF
D. Pradhan, Complexity of certain functional variants of total domination in chordal bipartite graphs, Discrete Mathematics, Algorithms and Applications, 4 (3) 2012 PDF
B. S. Panda and D. Pradhan, Acyclic matchings in subclasses of bipartite graphs, Discrete Mathematics, Algorithms and Applications, 4 (4) 2012 PDF
B. S. Panda and D. Pradhan, Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs, Information Processing Letters, 110 ( 2010) 1067-1073 PDF
Ongoing Projects:
Completed Projects:
Ph.D. Students (Thesis Awarded)
Ph.D. Students (Ongoing)