Dinabandhu Pradhan
According to our database1,
Dinabandhu Pradhan
authored at least 41 papers
between 2008 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
3
4
3
6
4
4
1
1
1
2
3
4
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Comput. Appl. Math., February, 2025
2024
Discret. Appl. Math., January, 2024
Discret. Appl. Math., 2024
2023
Algorithmica, December, 2023
Discret. Math., June, 2023
Discuss. Math. Graph Theory, 2023
2022
Discret. Appl. Math., 2022
2021
An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph.
J. Appl. Math. Comput., June, 2021
J. Appl. Math. Comput., February, 2021
Theor. Comput. Sci., 2021
2020
Theor. Comput. Sci., 2020
Inf. Process. Lett., 2020
2019
Discret. Math. Algorithms Appl., 2019
Discret. Appl. Math., 2019
2018
2017
Comput. Geom., 2017
2016
J. Comb. Optim., 2016
2015
Hardness results, approximation and exact algorithms for liar's domination problem in graphs.
Theor. Comput. Sci., 2015
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs.
Discret. Math. Algorithms Appl., 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2013
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.
J. Comb. Optim., 2013
Inf. Process. Lett., 2013
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
Discret. Appl. Math., 2013
2012
Theor. Comput. Sci., 2012
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs.
Discret. Math. Algorithms Appl., 2012
Discret. Math. Algorithms Appl., 2012
2010
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
Inf. Process. Lett., 2010
2008
CoRR, 2008