Dinabandhu Pradhan

Dikutip oleh

	Semua	Sejak 2020
Kutipan	466	348
indeks-h	14	12
indeks-i10	19	15

100

201320142015201620172018201920202021202220232024202515 7 11 22 14 18 26 51 55 53 64 95 29

Akses publik

Lihat semua

7 artikel

8 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Bhawani Sankar Panda, B S PandaIIT DelhiEmail yang diverifikasi di maths.iitd.ac.in
Michael A. HenningProfessor of Mathematics, University of JohannesburgEmail yang diverifikasi di uj.ac.za
J Mark KeilProfessor of Computer Science, University of SaskatchewanEmail yang diverifikasi di cs.usask.ca
SAIKAT PALPh.D., Department of Mathematics & Computing, IIT(ISM) Dhanbad, Dhanbad, IndiaEmail yang diverifikasi di am.ism.ac.in
Uttam Kumar GuptaAssistant Professor of Mathematics, A.M. College Gaya, Magadh University Bodhgaya, BiharEmail yang diverifikasi di mc.iitism.ac.in
Martin VatshelleUniversity of BergenEmail yang diverifikasi di uib.no
Joseph S. B. MitchellDistinguished Professor, Applied Mathematics and Computer Science, Stony Brook UniversityEmail yang diverifikasi di stonybrook.edu
Naresh Kumar HAssistant Professor(Mathematics), SASHE, SASTRA Deemed University, ThanjavurEmail yang diverifikasi di src.sastra.edu
venkatakrishnan YanamandramEmail yang diverifikasi di maths.sastra.edu
Gerard Jennhwa ChangProfessor of Mathematics, National Taiwan University

Ikuti

Dinabandhu Pradhan

Associate Professor, Department of Mathematics and Computing, IIT (ISM), Dhanbad

Email yang diverifikasi di iitism.ac.in

Graph Theory Graph Algorithms


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
An algorithm for the maximum weight independent set problem on outerstring graphs. JM Keil, JSB Mitchell, D Pradhan, M Vatshelle Computational Geometry 60, 19--25, 2017	52	2017
Algorithmic aspects of k-tuple total domination in graphs D Pradhan Information Processing Letters 112 (21), 816-822, 2012	33	2012
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs BS Panda, D Pradhan Journal of Combinatorial Optimization 26 (4), 770-785, 2013	27	2013
Perfect Roman domination in graphs S Banerjee, JM Keil, D Pradhan Theoretical Computer Science 796, 1-21, 2019	26	2019
On computing a minimum secure dominating set in block graphs D Pradhan, A Jha Journal of Combinatorial Optimization 35 (2), 613-631, 2018	25	2018
On the coalition number of trees D Bakhshesh, MA Henning, D Pradhan Bulletin of the Malaysian Mathematical Sciences Society 46 (3), 95, 2023	24	2023
Algorithmic results on double Roman domination in graphs S Banerjee, MA Henning, D Pradhan Journal of Combinatorial Optimization 39 (1), 90-114, 2020	22	2020
Complexity of certain functional variants of total domination in chordal bipartite graphs D Pradhan Discrete Mathematics, Algorithms and Applications 4 (03), 1250045, 2012	21	2012
Borodin–Kostochka’s conjecture on -free graphs UK Gupta, D Pradhan Journal of Applied Mathematics and Computing 65 (1), 877-884, 2021	20	2021
Computing a minimum outer-connected dominating set for the class of chordal graphs JM Keil, D Pradhan Information Processing Letters 113 (14-16), 552-561, 2013	20	2013
Acyclic matchings in subclasses of bipartite graphs BS Panda, D Pradhan Discrete Mathematics, Algorithms and Applications 4 (04), 1250050, 2012	18	2012
Algorithm and hardness results on hop domination in graphs MA Henning, S Pal, D Pradhan Information Processing Letters 153, 105872, 2020	17	2020
The secure domination problem in cographs A Jha, D Pradhan, S Banerjee Information Processing Letters 145, 30-38, 2019	17	2019
Algorithmic aspects of upper paired-domination in graphs MA Henning, D Pradhan Theoretical Computer Science 804, 98-114, 2020	15	2020
Hardness results, approximation and exact algorithms for liar's domination problem in graphs BS Panda, S Paul, D Pradhan Theoretical Computer Science 573, 26-42, 2015	14	2015
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph BS Panda, D Pradhan Discrete Applied Mathematics 161 (12), 1776-1783, 2013	13	2013
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs BS Panda, D Pradhan Discrete Mathematics, Algorithms and Applications 7 (2), 1550020, 2015	11	2015
Perfect Italian domination in graphs: Complexity and algorithms D Pradhan, S Banerjee, JB Liu Discrete Applied Mathematics 319, 271-295, 2022	10	2022
Computing a minimum paired-dominating set in strongly orderable graphs D Pradhan, BS Panda Discrete Applied Mathematics 253, 37-50, 2019	10	2019
Perfect Italian domination in cographs S Banerjee, MA Henning, D Pradhan Applied Mathematics and Computation 391, 125703, 2021	9	2021

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama