Home

Institute video

Department

Officers & Staff

Innovation

International Relations

Placement

Research

Centers

CE&O

In Media

IInvenTiv2026

Faculty details

Prof.Dinabandhu Pradhan

Designation: 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

Curriculum
Vitae
Publications

Teaching

  • Engineering Mathematics-II (Winter Semester, 2024-25)
  • Theory of Computation (Winter Semester, 2024-25)
  • Graph Algorithms (Monsoon Semester, 2024-25)

Academics

  • Ph.D. (IIT Delhi), 2011
  • M. Sc. (Utkal University, Bhubaneswar), 2004
  • B. Sc. (Sambalpur University, Burla), 2002

Position

  • Professor, Department of Mathematics and Computing, IIT (ISM) Dhanbad (April, 2026- Till date)
  • Associate Professor, Department of Mathematics and Computing, IIT (ISM) Dhanbad (April, 2021- April, 2026)
  • Assistant Professor, Department of Mathematics and Computing, IIT (ISM) Dhanbad (December, 2014- April, 2021)
  • Assistant Professor, Department of Mathematics and Statistics, IIT Jodhpur (September, 2013- December, 2014)
  • Postdoctoral Fellow, Department of Computer Science, University of Saskatchewan, Canada (September, 2012-August, 2013)
  • Postdoctoral Fellow, Department of Computer Science and Automation, IISc Bangalore (September, 2011-August, 2012)

Awards and Honors

Publications

List Of Research Publications (only in Peer-reviewed Journals)

  1. D. Pradhan, V. Sharma, R. Skrekovski, A remark on a result on odd colorings of planar graphs, Discrete Mathematics, 349 (2026) 115014 PDF 
  2. Uttam K. Gupta, M. A. Henning, P. V. Maniya, D. Pradhan, Secure domination in $P_5$-free graphs, Discrete Mathematics, 349 (2026) 114905  PDF
  3. F. Foucad, P. V. Maniya, K. Paul, D. Pradhan, Locating-dominating partitions for some classes of graphs, Discrete Mathematics, 349 (2026) 114886  PDF
  4. M. A. Henning, P. Maniya, D. Pradhan, Disjunctive domination in maximal outerplanar graphs, Discrete Applied Mathematics, 385 (2026) 24-61 PDF
  5. M. A. Henning, P. V. Maniya, D. Pradhan, Domination number versus packing number in graphs, Discussiones Mathematicae Graph Theory, (2026) PDF
  6. L. Sunil Chandran, Uttam K. Gupta, D. Pradhan, List recoloring of planar graphs, Discrete Applied Mathematics, 363 (2025) 71-87 PDF
  7. M. A. Henning, P. Maniya, D. Pradhan, Paired versus double domination in forbidden graph classes, Computational and Applied Mathematics, 44 (2025) 71 PDF
  8. J. Chaudhary, D. Pradhan, Roman {3}-domination in graphs: Complexity and algorithms, Discrete Applied Mathematics, 354 (2024) 301-325 PDF
  9. Uttam K. Gupta, D. Pradhan, Strenthening Brooks' chromatic bounds on $P_6$-free graphs, Discrete Applied Mathematics, 342 (2024) 334-346 PDF
  10. D. Bakhshesh, M. A. Henning, D. Pradhan, Singleton coalition graph chains, Computational and Applied Mathematics, 43 (2024) 85 PDF
  11. 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
  12. S. Banerjee, J. Chaudhary, D. Pradhan, Unique response Roman domination: Complexity and algorithms, Algorithmica, 85 (2023) 3889-3927 PDF
  13. Uttam K. Gupta, Suchismita Mishra, D. Pradhan, Cops and robber on subclasses of $P_5$-free graphs, Discrete Mathematics, 346 (2023) 113353 PDF
  14. M. A. Henning, S. Pal, D. Pradhan, Hop domination in chordal bipartite graphs,  Discussiones Mathematicae Graph Theory,  43 (2023) 825-840  PDF
  15. S. Paul, D. Pradhan, S. Verma, Vertex-edge domination in interval and bipartite permutation graphs, Discussiones Mathematicae Graph Theory,  43 (2023) 947-963 PDF
  16. D. Bakhshesh, M. A. Henning, D. Pradhan, On the coalition number of trees, Bulletin of the Malaysian Mathematical Sciences Society, 46 (2023) 95 PDF
  17. D. Pradhan, S. Banerjee, J.-B. Liu, Perfect Italian domination in graphs: Complexity and algorithms, Discrete Applied Mathematics, 319 (2022) 271-295 PDF
  18. M. A. Henning, S. Pal, D. Pradhan, The semitotal domination problem in block graphs, Discussiones Mathematicae Graph Theory, 42 (2022) 231-248  PDF
  19. B. S. Panda, Pooja Goyal, D. Pradhan, Differentiating-total domination: approximation and hardness results, Theoretical Computer Science, 876 (2021) 45-58 PDF
  20. S. Banerjee, M. A. Henning, D. Pradhan, Perfect Italian domination in cographs,  Applied Mathematics and Computation, 391 (2021) 125703 PDF
  21. 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
  22. 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
  23. 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
  24. Anupriya Jha, D. Pradhan, S. Banerjee, Algorithm and hardness results on neighborhood total domination in graphs, Theoretical Computer Science, 840 (2020) 16-32 PDF
  25. M. A. Henning, D. Pradhan, Algorithmic aspects of upper paired-domination in graphs, Theoretical Computer Science, 804 (2020) 98-114 PDF
  26. 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
  27. M. A. Henning, S. Pal, D. Pradhan, Algorithm and hardness results on hop domination in graphs, Information Processing Letters, 153 (2020) 105872 PDF
  28. S. Banjerjee, J. Mark Keil, D. Pradhan, Perfect Roman domination in graphs, Theoretical Computer Science, 796 (2019) 1-21 PDF
  29. Anupriya Jha, D. Pradhan, S. Banerjee, The secure domination problem in cographs, Information Processing Letters, 145 (2019) 30-38 PDF
  30. D. Pradhan and B. S. Panda, Computing a minimum paired-dominating set in strongly orderable graphs, Discrete Applied Mathematics, 253 (2019) 37-50 PDF
  31.  S. Pal, D. Pradhan, The strong domination problem in block graphs and proper interval graphs, Discrete Mathematics, Algorithms and Applications, 11 (6) (2019)  PDF
  32. D. Pradhan and Anupriya Jha, On computing a minimum secure dominating set in block graphs, Journal of Combinatorial Optimization,  35 (2018) 613-631 PDF
  33. 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
  34. 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.
  35. B. S. Panda and D. Pradhan, A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs, Discrete Mathematics, Algorithms and Applications, PDF
  36. 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
  37. D. Pradhan, On the complexity of the minimum outer-connected dominating set problem in graphs, Journal of Combinatorial Optimization, 31 (2016) 1-12 PDF
  38. 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
  39. 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
  40. 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
  41. 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
  42. D. Pradhan, Algorithmic aspects of $k$-tuple total domination in graphs, Information Processing Letters,  112 ( 2012) 816-822 PDF
  43. D. Pradhan, Complexity of certain functional variants of total domination in chordal bipartite graphs, Discrete Mathematics, Algorithms and Applications, 4 (3) 2012 PDF
  44. B. S. Panda and D. Pradhan, Acyclic matchings in subclasses of bipartite graphs, Discrete Mathematics, Algorithms and Applications, 4 (4) 2012 PDF
  45. 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

Projects & Activities

Sponsored Research Projects (External Funded)

Ongoing Projects:

  • Core Research Grant (CRG), Anusandhan National Research Foundation (ANRF), New Delhi (2024-2027)
  • Research Proposal Grant, National Board For Higher Mathematics (NBHM), Mumbai (2023-2026)

Completed Projects:

  • MAThematical Research Impact Centric Support (MATRICS), Science and Engineering Research Board(SERB), New Delhi (2019-2022)
  • Young Scientist Grant, Science and Engineering Research Board(SERB), New Delhi (2015-2018)

Guidance

Ph.D. Students (Thesis Awarded)

  1. Anupriya Jha (2020)
  2. Saikat Pal (2020)
  3. Sumanta Banerjee (2023)
  4. Uttam Kumar Gupta (2024)
  5. Paras Maniya Vinubhai (2026)

Ph.D. Students (Ongoing)

  1. Vaishali Sharma (2022-)
  2. Sourabha Kumar Sahu (2023-)
  3. Rashmi Rekha Swain (2023-)
  4. Sourav Jha (2024-)
  5. Sagar Soni (2024-)
Copyright © 2026 All Rights Reserved || Designed & Developed by - WEBSTEP TECHNOLOGIES PRIVATE LIMITED