Algorithms and complexity of strongly stable non-crossing matchings.

Bhawani Sankar Panda B. S. Panda 0001 Indian Institute of Technology Delhi, Department of Mathematics, India https://orcid.org/0000-0002-0721-5325 B. S. Panda B. S. Panda 0002 MITS Engineering College, Rayagada, India

Sachin B. S. Panda 0001 Algorithms and complexity of strongly stable non-crossing matchings. 802-813 2026 379 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.10.025 db/journals/dam/dam379.html#SachinP26 streams/journals/dam

Aseem Dalal Bhawani Sankar Panda A sufficient condition for complete multipartite graphs to be of Type 1. 114896 2026 349 Discret. Math. 4 https://doi.org/10.1016/j.disc.2025.114896 db/journals/dm/dm349.html#DalalP26 streams/journals/dm

Bhawani Sankar Panda Soumyashree Rana Sounaka Mishra Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463]. 106592 2026 191 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2025.106592 db/journals/ipl/ipl191.html#PandaRM26 streams/journals/ipl

Bhawani Sankar Panda Subhasmita Joshi Dalu Jacob Bipartite domination in graphs: complexity and algorithms. 2026 116076 1081 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2026.116076 db/journals/tcs/tcs1081.html#PandaJJ26 streams/journals/tcs

Subhasmita Joshi Bhawani Sankar Panda Complexity and Approximation Algorithm of 3-Component Domination in Graphs. CALDAM 2026 221-235 conf/caldam/2026 https://doi.org/10.1007/978-3-032-17156-6_17 db/conf/caldam/caldam2026.html#JoshiP26 streams/conf/caldam

Bhawani Sankar Panda Sachin Hardness and approximation results for some variants of Stable Marriage problem. 170-182 2025 377 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.06.066 db/journals/dam/dam377.html#PandaS25 streams/journals/dam

Aseem Dalal B. S. Panda 0001 On total chromatic number of complete multipartite graphs. 445-458 2025 377 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.08.027 db/journals/dam/dam377.html#Dalal025

Soumyashree Rana Sounaka Mishra Bhawani Sankar Panda Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results. 100902 2025 57 Discret. Optim. https://doi.org/10.1016/j.disopt.2025.100902 db/journals/disopt/disopt57.html#RanaMP25 streams/journals/disopt

Bhawani Sankar Panda Rumki Ghosh Injective coloring of subclasses of chordal graphs. 114894 2025 1023 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2024.114894 db/journals/tcs/tcs1023.html#PandaG25 streams/journals/tcs

Bhawani Sankar Panda Subhasmita Joshi Dalu Jacob Bipartite Domination in Graphs: Complexity and Algorithms. 234-246 2025 CALDAM https://doi.org/10.1007/978-3-031-83438-7_20 conf/caldam/2025 db/conf/caldam/caldam2025.html#PandaJJ25 streams/conf/caldam

Aseem Dalal Bhawani Sankar Panda C. A. Rodger Total colorings of complete multipartite graphs using amalgamations. 186-195 2024 359 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2024.07.050 db/journals/dam/dam359.html#DalalPR24 streams/journals/dam

B. S. Panda 0001 Injective edge coloring of some standard graph products. 2350041:1-2350041:13 2024 May 16 Discret. Math. Algorithms Appl. 4 https://doi.org/10.1142/S1793830923500416 db/journals/dmaa/dmaa16.html#Panda24

Shaily Verma Bhawani Sankar Panda Adjacent vertex distinguishing total coloring of the corona product of graphs. 317 2024 44 Discuss. Math. Graph Theory 1 https://doi.org/10.7151/dmgt.2445 db/journals/dmgt/dmgt44.html#VermaP24

Pooja Goyal Bhawani Sankar Panda Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. 669-703 2024 September 35 Int. J. Found. Comput. Sci. 6 https://doi.org/10.1142/S0129054123410071 db/journals/ijfcs/ijfcs35.html#GoyalP24 streams/journals/ijfcs

B. S. Panda 0001 Soumyashree Rana Sounaka Mishra On the complexity of co-secure dominating set problem. 106463 2024 March 185 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2023.106463 db/journals/ipl/ipl185.html#PandaRM24

Juhi Chaudhary Sounaka Mishra B. S. Panda 0001 On the complexity of minimum maximal acyclic matchings. 10 2024 August 48 J. Comb. Optim. 1 https://doi.org/10.1007/s10878-024-01200-3 db/journals/jco/jco48.html#ChaudharyMP24 streams/journals/jco

Aseem Dalal B. S. Panda 0001 On Total Chromatic Number of Complete Multipartite Graphs. 270-285 2024 CALDAM https://doi.org/10.1007/978-3-031-52213-0_19 conf/caldam/2024 db/conf/caldam/caldam2024.html#DalalP24

B. S. Panda 0001 Pooja Goyal Hardness results of global roman domination in graphs. 337-348 2023 December 341 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2023.08.020 db/journals/dam/dam341.html#PandaG23

Sanjay Kumar 0001 Abhishek Mallik B. S. Panda 0001 Influence maximization in social networks using transfer learning via graph-based LSTM. 118770 2023 212 Expert Syst. Appl. https://doi.org/10.1016/j.eswa.2022.118770 db/journals/eswa/eswa212.html#KumarMP23

B. S. Panda 0001 Juhi Chaudhary Acyclic matching in some subclasses of graphs. 36-49 2023 943 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.12.008 db/journals/tcs/tcs943.html#PandaC23

Priyamvada B. S. Panda 0001 Complexity and algorithms for injective edge coloring of graphs. 114010 2023 August 968 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2023.114010 db/journals/tcs/tcs968.html#PriyamvadaP23

Sanjay Kumar 0001 Akshi Kumar 0001 B. S. Panda 0001 Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking. 703-711 2023 19 IEEE Trans. Ind. Informatics 1 https://doi.org/10.1109/TII.2022.3203059 db/journals/tii/tii19.html#KumarKP23

B. S. Panda 0001 Sachin Algorithms and Complexity of Strongly Stable Non-crossing Matchings. 363-376 2023 CALDAM https://doi.org/10.1007/978-3-031-25211-2_28 conf/caldam/2023 db/conf/caldam/caldam2023.html#PandaS23 Juhi Chaudhary Sounaka Mishra B. S. Panda 0001 Minimum Maximal Acyclic Matching in Proper Interval Graphs. 377-388 2023 CALDAM https://doi.org/10.1007/978-3-031-25211-2_29 conf/caldam/2023 db/conf/caldam/caldam2023.html#ChaudharyMP23

Bhawani Sankar Panda Soumyashree Rana Sounaka Mishra On the Complexity of Co-secure Dominating Set Problem. 2023 abs/2306.10378 CoRR https://doi.org/10.48550/arXiv.2306.10378 db/journals/corr/corr2306.html#abs-2306-10378

Soumyashree Rana Sounaka Mishra Bhawani Sankar Panda Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results. 2023 abs/2312.01149 CoRR https://doi.org/10.48550/arXiv.2312.01149 db/journals/corr/corr2312.html#abs-2312-01149

Priyamvada B. S. Panda 0001 Exact square coloring of graphs resulting from some graph operations and products. 211-220 2022 September 19 AKCE Int. J. Graphs Comb. 3 https://doi.org/10.1080/09728600.2022.2094736 db/journals/akcej/akcej19.html#PriyamvadaP22

Sanjay Kumar 0001 Dipti Lohia Darsh Pratap Ashutosh Krishna B. S. Panda 0001 MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks. 359-382 2022 104 Computing 2 https://doi.org/10.1007/s00607-021-00960-8 db/journals/computing/computing104.html#KumarLPKP22

B. S. Panda 0001 Pooja Goyal Hardness results of global total k-domination problem in graphs. 223-238 2022 319 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2021.02.018 https://www.wikidata.org/entity/Q113877250 db/journals/dam/dam319.html#PandaG22

Shaily Verma Hung-Lin Fu B. S. Panda 0001 Adjacent vertex distinguishing total coloring in split graphs. 113061 2022 345 Discret. Math. 11 https://doi.org/10.1016/j.disc.2022.113061 db/journals/dm/dm345.html#VermaFP22

Sanjay Kumar 0001 Abhishek Mallik Anavi Khetarpal Bhawani Sankar Panda Influence maximization in social networks using graph embedding and graph neural network. 1617-1636 2022 607 Inf. Sci. https://doi.org/10.1016/j.ins.2022.06.075 db/journals/isci/isci607.html#KumarMKP22

B. S. Panda 0001 Priyamvada Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. 32-51 2022 906 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.01.003 db/journals/tcs/tcs906.html#PandaP22

Priyamvada B. S. Panda 0001 Exact square coloring of certain classes of graphs: Complexity and algorithms. 84-101 2022 932 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2022.08.008 db/journals/tcs/tcs932.html#PriyamvadaP22

Sanjay Kumar 0001 Abhishek Mallik B. S. Panda 0001 Link prediction in complex networks using node centrality and light gradient boosting machine. 2487-2513 2022 25 World Wide Web 6 https://doi.org/10.1007/s11280-021-01000-3 db/journals/www/www25.html#KumarMP22

B. S. Panda 0001 Sachin Hardness and Approximation Results for Some Variants of Stable Marriage Problem. 252-264 2022 CALDAM https://doi.org/10.1007/978-3-030-95018-7_20 conf/caldam/2022 db/conf/caldam/caldam2022.html#PandaS22 Juhi Chaudhary Sounaka Mishra B. S. Panda 0001 On the Complexity of Minimum Maximal Acyclic Matchings. 106-117 2022 COCOON https://doi.org/10.1007/978-3-031-22105-7_10 conf/cocoon/2022 db/conf/cocoon/cocoon2022.html#ChaudharyMP22 Juhi Chaudhary B. S. Panda 0001 On Two Variants of Induced Matchings. 37-48 2022 ICS https://doi.org/10.1007/978-981-19-9582-8_4 conf/intcompsymp/2022 db/conf/intcompsymp/ics2022.html#Chaudhary022

Sanjay Kumar 0001 Lakshay Singhla Kshitij Jindal Khyati Grover B. S. Panda 0001 IM-ELPR: Influence maximization in social networks using label propagation based community structure. 7647-7665 2021 51 Appl. Intell. 11 https://doi.org/10.1007/s10489-021-02266-w db/journals/apin/apin51.html#KumarSJGP21

B. S. Panda 0001 Priyamvada Injective coloring of some subclasses of bipartite graphs and chordal graphs. 68-87 2021 291 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.12.006 db/journals/dam/dam291.html#PandaP21

Bhawani Sankar Panda Subir Kumar Ghosh Preface: CALDAM 2018. 260 2021 305 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2021.10.001 db/journals/dam/dam305.html#PandaG21

Sanjay Kumar 0001 Muskan Saini Muskan Goel B. S. Panda 0001 Modeling information diffusion in online social networks using a modified forest-fire model. 355-377 2021 56 J. Intell. Inf. Syst. 2 https://doi.org/10.1007/s10844-020-00623-8 https://www.wikidata.org/entity/Q100725721 db/journals/jiis/jiis56.html#KumarSGP21

Sanjay Kumar 0001 B. S. Panda 0001 Deepanshu Aggarwal Community detection in complex networks using network embedding and gravitational search algorithm. 51-72 2021 57 J. Intell. Inf. Syst. 1 https://doi.org/10.1007/s10844-020-00625-6 db/journals/jiis/jiis57.html#KumarPA21

B. S. Panda 0001 Pooja Goyal Global total k-domination: Approximation and hardness results. 1-19 2021 850 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2020.10.027 db/journals/tcs/tcs850.html#PandaG21

B. S. Panda 0001 Pooja Goyal Dinabandhu Pradhan Differentiating-total domination: Approximation and hardness results. 45-58 2021 876 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.05.021 db/journals/tcs/tcs876.html#PandaGP21

Juhi Chaudhary Bhawani Sankar Panda On the complexity of minimum maximal uniquely restricted matching. 15-28 2021 882 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.05.036 db/journals/tcs/tcs882.html#ChaudharyP21

B. S. Panda 0001 Juhi Chaudhary Dominating induced matching in some subclasses of bipartite graphs. 104-115 2021 885 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2021.06.031 db/journals/tcs/tcs885.html#PandaC21

B. S. Panda 0001 Pooja Goyal Hardness Results of Global Roman Domination in Graphs. 500-511 2021 CALDAM https://doi.org/10.1007/978-3-030-67899-9_39 conf/caldam/2021 db/conf/caldam/caldam2021.html#PandaG21 Pooja Goyal B. S. Panda 0001 Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. 653-667 2021 COCOA https://doi.org/10.1007/978-3-030-92681-6_51 conf/cocoa/2021 db/conf/cocoa/cocoa2021.html#GoyalP21 Pooja Goyal B. S. Panda 0001 Hardness and Approximation Results of Roman {3}-Domination in Graphs. 101-111 2021 COCOON https://doi.org/10.1007/978-3-030-89543-3_9 conf/cocoon/2021 db/conf/cocoon/cocoon2021.html#GoyalP21

B. S. Panda 0001 Shaily Verma Yash Keerti On the total and AVD-total coloring of graphs. 820-825 2020 17 AKCE Int. J. Graphs Comb. 3 https://doi.org/10.1016/j.akcej.2019.10.004 db/journals/akcej/akcej17.html#PandaVK20

Shaily Verma B. S. Panda 0001 Grundy coloring in some subclasses of bipartite graphs and their complements. 105999 2020 163 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2020.105999 db/journals/ipl/ipl163.html#VermaP20

B. S. Panda 0001 Arti Pandey Juhi Chaudhary Piyush Dane Manav Kashyap Maximum weight induced matching in some subclasses of bipartite graphs. 713-732 2020 40 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-020-00611-2 db/journals/jco/jco40.html#PandaPCDK20

B. S. Panda 0001 Pooja Goyal Hardness Results of Global Total k-Domination Problem in Graphs. 92-101 2020 CALDAM https://doi.org/10.1007/978-3-030-39219-2_8 conf/caldam/2020 db/conf/caldam/caldam2020.html#PandaG20 Juhi Chaudhary B. S. Panda 0001 On the Complexity of Minimum Maximal Uniquely Restricted Matching. 364-376 2020 COCOA https://doi.org/10.1007/978-3-030-64843-5_25 conf/cocoa/2020 db/conf/cocoa/cocoa2020.html#ChaudharyP20 Sanjay Kumar 0001 Nipun Aggarwal B. S. Panda 0001 Identifying Influential Spreaders On a Weighted Network Using HookeRank Method. 609-622 2020 ICCS (1) https://doi.org/10.1007/978-3-030-50371-0_45 conf/iccS/2020-1 db/conf/iccS/iccS2020-1.html#KumarAP20 B. S. Panda 0001 Juhi Chaudhary Acyclic Matching in Some Subclasses of Graphs. 409-421 2020 IWOCA https://doi.org/10.1007/978-3-030-48966-3_31 conf/iwoca/2020 db/conf/iwoca/iwoca2020.html#PandaC20

Arti Pandey B. S. Panda 0001 Domination in some subclasses of bipartite graphs. 51-66 2019 252 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.03.029 db/journals/dam/dam252.html#PandeyP19

Dinabandhu Pradhan B. S. Panda 0001 Computing a minimum paired-dominating set in strongly orderable graphs. 37-50 2019 253 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.08.022 https://www.wikidata.org/entity/Q129097715 db/journals/dam/dam253.html#PradhanP19

B. S. Panda 0001 Shaily Verma On partial Grundy coloring of bipartite graphs and chordal graphs. 171-183 2019 271 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.08.005 db/journals/dam/dam271.html#PandaV19

B. S. Panda 0001 Juhi Chaudhary Dominating Induced Matching in Some Subclasses of Bipartite Graphs. 138-149 2019 CALDAM https://doi.org/10.1007/978-3-030-11509-8_12 conf/caldam/2019 db/conf/caldam/caldam2019.html#PandaC19

B. S. Panda 0001 Arti Pandey Subhabrata Paul Algorithmic aspects of b-disjunctive domination in graphs. 572-590 2018 36 J. Comb. Optim. 2 https://doi.org/10.1007/s10878-017-0112-6 db/journals/jco/jco36.html#PandaPP18

B. S. Panda 0001 Anita Das 0001 Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. 369-381 2018 WG https://doi.org/10.1007/978-3-030-00256-5_30 conf/wg/2018 db/conf/wg/wg2018.html#Panda018 B. S. Panda 0001 Partha P. Goswami Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings CALDAM Springer 2018 Lecture Notes in Computer Science 10743 978-3-319-74179-6 978-3-319-74180-2 https://doi.org/10.1007/978-3-319-74180-2 db/conf/caldam/caldam2018.html

B. S. Panda 0001 Arti Pandey Algorithmic aspects of open neighborhood location-domination in graphs. 290-306 2017 216 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.03.002 db/journals/dam/dam216.html#PandaP17

Arti Pandey B. S. Panda 0001 Restrained Domination in Some Subclasses of Chordal Graphs. 203-210 2017 63 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2017.11.015 db/journals/endm/endm63.html#PandeyP17

B. S. Panda 0001 Bijaya K. Bhatta Deepak Mishra 0001 Swades De New heuristics for strong minimum energy topology with reduced time complexity. 1-6 2017 ANTS https://doi.org/10.1109/ANTS.2017.8384173 conf/IEEEants/2017 db/conf/IEEEants/IEEEants2017.html#PandaBMD17 Arti Pandey B. S. Panda 0001 Piyush Dane Manav Kashyap Induced Matching in Some Subclasses of Bipartite Graphs. 308-319 2017 CALDAM https://doi.org/10.1007/978-3-319-53007-9_27 conf/caldam/2017 db/conf/caldam/caldam2017.html#PandeyPDK17 Bhawani Sankar Panda Bijaya K. Bhatta Sambit Kumar Mishra Improved Energy-Efficient Target Coverage in Wireless Sensor Networks. 350-362 2017 ICCSA (6) https://doi.org/10.1007/978-3-319-62407-5_25 conf/iccsa/2017-6 db/conf/iccsa/iccsa2017-6.html#PandaBM17 S. Arumugam 0001 Jay S. Bagga Lowell W. Beineke B. S. Panda 0001 Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers ICTCSDM Springer 2017 Lecture Notes in Computer Science 10398 978-3-319-64418-9 978-3-319-64419-6 https://doi.org/10.1007/978-3-319-64419-6 db/conf/ictcsdm/ictcsdm2016.html

B. S. Panda 0001 Arti Pandey Complexity of total outer-connected domination problem in graphs. 110-122 2016 199 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.05.009 db/journals/dam/dam199.html#PandaP16

Aseem Dalal B. S. Panda 0001 C. A. Rodger Total-colorings of complete multipartite graphs using amalgamations. 1587-1592 2016 339 Discret. Math. 5 https://doi.org/10.1016/j.disc.2015.12.032 db/journals/dm/dm339.html#DalalPR16

B. S. Panda 0001 D. Pushparaj Shetty Strong minimum energy hierarchical topology in wireless sensor networks. 174-187 2016 32 J. Comb. Optim. 1 https://doi.org/10.1007/s10878-015-9869-7 db/journals/jco/jco32.html#PandaS16

Arti Pandey B. S. Panda 0001 b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. 277-288 2016 CALDAM https://doi.org/10.1007/978-3-319-29221-2_24 conf/caldam/2016 db/conf/caldam/caldam2016.html#PandeyP16 B. S. Panda 0001 Arti Pandey On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. 218-227 2016 ICTCSDM https://doi.org/10.1007/978-3-319-64419-6_29 conf/ictcsdm/2016 db/conf/ictcsdm/ictcsdm2016.html#PandaP16 B. S. Panda 0001 Shaily Verma Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. 228-237 2016 ICTCSDM https://doi.org/10.1007/978-3-319-64419-6_30 conf/ictcsdm/2016 db/conf/ictcsdm/ictcsdm2016.html#PandaV16

Arti Pandey Bhawani Sankar Panda Some Algorithmic Results on Restrained Domination in Graphs. 2016 abs/1606.02340 CoRR http://arxiv.org/abs/1606.02340 db/journals/corr/corr1606.html#PandeyP16

Bhawani Sankar Panda Preeti Goel L(2, 1)-labeling of Block Graphs. 71-95 2015 119 Ars Comb. db/journals/arscom/arscom119.html#PandaG15

Bhawani Sankar Panda Dinabandhu Pradhan A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. 2015 7 Discret. Math. Algorithms Appl. 2 https://doi.org/10.1142/S1793830915500202 db/journals/dmaa/dmaa7.html#PandaP15 1550020:1-1550020:21

B. S. Panda 0001 Arti Pandey On the dominator coloring in proper interval graphs and block graphs. 2015 7 Discret. Math. Algorithms Appl. 4 https://doi.org/10.1142/S1793830915500433 db/journals/dmaa/dmaa7.html#PandaP15a 1550043:1-1550043:17

B. S. Panda 0001 D. Pushparaj Shetty Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. 1077-1094 2015 30 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-013-9683-z db/journals/jco/jco30.html#PandaS15

Bhawani Sankar Panda Subhabrata Paul Dinabandhu Pradhan Hardness results, approximation and exact algorithms for liar's domination problem in graphs. 26-42 2015 573 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.01.041 db/journals/tcs/tcs573.html#PandaPP15

Bhawani Sankar Panda Separator Theorems for Interval Graphs and Proper Interval Graphs. 101-110 2015 CALDAM https://doi.org/10.1007/978-3-319-14974-5_10 conf/caldam/2015 db/conf/caldam/caldam2015.html#Panda15 Arti Pandey Bhawani Sankar Panda Domination in Some Subclasses of Bipartite Graphs. 169-180 2015 CALDAM https://doi.org/10.1007/978-3-319-14974-5_17 conf/caldam/2015 db/conf/caldam/caldam2015.html#PandeyP15 B. S. Panda 0001 Arti Pandey Subhabrata Paul Algorithmic Aspects of Disjunctive Domination in Graphs. 325-336 2015 COCOON https://doi.org/10.1007/978-3-319-21398-9_26 conf/cocoon/2015 db/conf/cocoon/cocoon2015.html#PandaPP15 Bhawani Sankar Panda D. Pushparaj Shetty Arti Pandey k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. 187-192 2015 ICDCIT https://doi.org/10.1007/978-3-319-14977-6_13 conf/icdcit/2015 db/conf/icdcit/icdcit2015.html#PandaSP15 B. S. Panda 0001 Bijaya K. Bhatta Deepak Mishra 0001 Swades De Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. 25:1-25:8 2015 ICDCN https://doi.org/10.1145/2684464.2684490 conf/icdcn/2015 db/conf/icdcn/icdcn2015.html#PandaBMD15

Bhawani Sankar Panda Arti Pandey Algorithmic aspects of disjunctive domination in graphs. 2015 abs/1502.07718 CoRR http://arxiv.org/abs/1502.07718 db/journals/corr/corr1502.html#PandaP15

B. S. Panda 0001 Subhabrata Paul Hardness results and approximation algorithm for total liar's domination in graphs. 643-662 2014 27 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-012-9542-3 db/journals/jco/jco27.html#PandaP14

Bhawani Sankar Panda Arti Pandey Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. 493-513 2014 18 J. Graph Algorithms Appl. 4 https://doi.org/10.7155/jgaa.00334 db/journals/jgaa/jgaa18.html#PandaP14

Bhawani Sankar Panda D. Pushparaj Shetty Minimum Range Assignment Problem for Two Connectivity in Wireless Sensor Networks. 122-133 2014 ICDCIT https://doi.org/10.1007/978-3-319-04483-5_14 conf/icdcit/2014 db/conf/icdcit/icdcit2014.html#PandaS14 B. S. Panda 0001 Arti Pandey Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. 151-162 2014 WALCOM https://doi.org/10.1007/978-3-319-04657-0_16 conf/walcom/2014 db/conf/walcom/walcom2014.html#PandaP14

B. S. Panda 0001 Subhabrata Paul Liar's domination in graphs: Complexity and algorithm. 1085-1092 2013 161 Discret. Appl. Math. 7-8 https://doi.org/10.1016/j.dam.2012.12.011 db/journals/dam/dam161.html#PandaP13

B. S. Panda 0001 Dinabandhu Pradhan A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. 1776-1783 2013 161 Discret. Appl. Math. 12 https://doi.org/10.1016/j.dam.2012.04.014 db/journals/dam/dam161.html#PandaP13a

B. S. Panda 0001 Subhabrata Paul Connected Liar's domination in graphs: Complexity and Algorithms. 2013 5 Discret. Math. Algorithms Appl. 4 https://doi.org/10.1142/S1793830913500249 db/journals/dmaa/dmaa5.html#PandaP13

B. S. Panda 0001 D. Pushparaj Shetty Minimum interference strong bidirectional topology for wireless sensor networks. 243-253 2013 13 Int. J. Ad Hoc Ubiquitous Comput. 3/4 https://doi.org/10.1504/IJAHUC.2013.055469 db/journals/ijahuc/ijahuc13.html#PandaS13

B. S. Panda 0001 Subhabrata Paul A linear time algorithm for liar's domination problem in proper interval graphs. 815-822 2013 113 Inf. Process. Lett. 19-21 https://doi.org/10.1016/j.ipl.2013.07.012 db/journals/ipl/ipl113.html#PandaP13

B. S. Panda 0001 Dinabandhu Pradhan Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. 770-785 2013 26 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-012-9483-x db/journals/jco/jco26.html#PandaP13

Bhawani Sankar Panda D. Pushparaj Shetty A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks. 398-409 2013 ICDCIT https://doi.org/10.1007/978-3-642-36071-8_31 conf/icdcit/2013 db/conf/icdcit/icdcit2013.html#PandaS13

B. S. Panda 0001 Dinabandhu Pradhan Acyclic Matchings in Subclasses of bipartite Graphs. 2012 4 Discret. Math. Algorithms Appl. 4 https://doi.org/10.1142/S1793830912500504 db/journals/dmaa/dmaa4.html#PandaP12

Bighnaraj Panigrahi Swades De Bhawani Sankar Panda Jean-Daniel Lan Sun Luk Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks. 2138-2148 2012 6 IET Commun. 14 https://doi.org/10.1049/iet-com.2011.0784 db/journals/iet-com/iet-com6.html#PanigrahiDPL12

B. S. Panda 0001 Preeti Goel L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. 552-556 2012 112 Inf. Process. Lett. 13 https://doi.org/10.1016/j.ipl.2012.04.003 db/journals/ipl/ipl112.html#PandaG12

Gerard J. Chang B. S. Panda 0001 Dinabandhu Pradhan Complexity of distance paired-domination problem in graphs. 89-99 2012 459 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.08.024 db/journals/tcs/tcs459.html#ChangPP12

Bhawani Sankar Panda D. Pushparaj Shetty Bijaya Kishor Bhatta Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks. 177-187 2012 ICDCIT https://doi.org/10.1007/978-3-642-28073-3_16 conf/icdcit/2012 db/conf/icdcit/icdcit2012.html#PandaSB12

B. S. Panda 0001 Preeti Goel L(2, 1)-labeling of perfect elimination bipartite graphs. 1878-1888 2011 159 Discret. Appl. Math. 16 https://doi.org/10.1016/j.dam.2010.07.008 db/journals/dam/dam159.html#PandaG11

B. S. Panda 0001 D. Pushparaj Shetty Strong Minimum Interference Topology for Wireless Sensor Networks. 366-374 2011 ADCONS https://doi.org/10.1007/978-3-642-29280-4_43 conf/adcons/2011 db/conf/adcons/adcons2011.html#PandaS11 B. S. Panda 0001 D. Pushparaj Shetty An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. 187-196 2011 ICDCIT https://doi.org/10.1007/978-3-642-19056-8_13 conf/icdcit/2011 db/conf/icdcit/icdcit2011.html#PandaS11

B. S. Panda 0001 Anita Das 0001 Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. 1913-1935 2010 158 Discret. Appl. Math. 17 https://doi.org/10.1016/j.dam.2010.08.015 db/journals/dam/dam158.html#PandaD10

B. S. Panda 0001 Dinabandhu Pradhan Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. 1067-1073 2010 110 Inf. Process. Lett. 23 https://doi.org/10.1016/j.ipl.2010.09.008 db/journals/ipl/ipl110.html#PandaP10

B. S. Panda 0001 Preeti Goel Heuristic Algorithms for the L(2, 1)-Labeling Problem. 214-221 2010 SEMCCO https://doi.org/10.1007/978-3-642-17563-3_26 conf/semcco/2010 db/conf/semcco/semcco2010.html#PandaG10 Bighnaraj Panigrahi Swades De Bhawani Sankar Panda Jean-Daniel Lan Sun Luk Energy-Efficient Greedy Forwarding Protocol for Wireless Sensor Networks. 1-5 2010 VTC Spring https://doi.org/10.1109/VETECS.2010.5494228 conf/vtc/2010s db/conf/vtc/vtc2010s.html#PanigrahiDPL10

B. S. Panda 0001 Anita Das 0001 Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. 2153-2169 2009 157 Discret. Appl. Math. 9 https://doi.org/10.1016/j.dam.2008.06.026 db/journals/dam/dam157.html#PandaD09

B. S. Panda 0001 Sajal K. Das 0001 A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. 1041-1046 2009 109 Inf. Process. Lett. 18 https://doi.org/10.1016/j.ipl.2009.06.011 db/journals/ipl/ipl109.html#PandaD09

B. S. Panda 0001 Dinabandhu Pradhan NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs http://arxiv.org/abs/0809.2443 2008 CoRR abs/0809.2443 db/journals/corr/corr0809.html#abs-0809-2443

B. S. Panda 0001 Anita Das 0001 On tree 3-spanners in directed path graphs. 203-210 2007 50 Networks 3 https://doi.org/10.1002/net.20198 db/journals/networks/networks50.html#PandaD07

Bhawani Sankar Panda Anita Das 0001 Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. 79-80 2006 27 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2006.08.065 db/journals/endm/endm27.html#PandaD06

Anita Das 0001 B. S. Panda 0001 Rajendra P. Lal A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. 301-304 2006 conf/cit/2006 ICIT https://doi.org/10.1109/ICIT.2006.12 https://doi.ieeecomputersociety.org/10.1109/ICIT.2006.12 db/conf/cit/cit2006.html#DasPL06

B. S. Panda 0001 Sajal K. Das 0001 Parallel recognition algorithms for chordal_planar graphs and planar k-trees. 922-926 2005 65 J. Parallel Distributed Comput. 8 https://doi.org/10.1016/j.jpdc.2005.04.002 db/journals/jpdc/jpdc65.html#PandaD05

B. S. Panda 0001 Anita Das 0001 A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. 21-30 https://doi.org/10.1007/978-3-540-30561-3_3 2004 conf/cit/2004 CIT db/conf/cit/cit2004.html#PandaD04 B. S. Panda 0001 Mahesh Kumar Sajal K. Das 0001 Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids. 424-434 https://doi.org/10.1007/978-3-540-30536-1_47 2004 conf/iwdc/2004 IWDC db/conf/iwdc/iwdc2004.html#PandaKD04

B. S. Panda 0001 Sajal K. Das 0001 A linear time recognition algorithm for proper interval graphs. 153-161 2003 87 Inf. Process. Lett. 3 https://doi.org/10.1016/S0020-0190(03)00298-9 db/journals/ipl/ipl87.html#PandaD03

B. S. Panda 0001 Vijay Natarajan Sajal K. Das 0001 Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. 51-64 2002 12 Parallel Process. Lett. 1 https://doi.org/10.1142/S0129626402000823 db/journals/ppl/ppl12.html#PandaND02

B. S. Panda 0001 Sajal K. Das 0001 An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. 334-346 2002 conf/hipc/2002 HiPC https://doi.org/10.1007/3-540-36265-7_32 db/conf/hipc/hipc2002.html#PandaD02 B. S. Panda 0001 Sajal K. Das 0001 A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. 292-309 2002 conf/ifipTCS/2002 IFIP TCS db/conf/ifipTCS/ifipTCS2002.html#PandaD02 https://doi.org/10.1007/978-0-387-35608-2_25 B. S. Panda 0001 Sajal K. Das 0001 Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. 88-97 2002 conf/iwdc/2002 IWDC https://doi.org/10.1007/3-540-36385-8_9 db/conf/iwdc/iwdc2002.html#PandaD02

B. S. Panda 0001 The Separator Theorem for Rooted Directed Vertex Graphs. 156-162 2001 81 J. Comb. Theory B 1 https://doi.org/10.1006/jctb.2000.2001 db/journals/jct/jctb81.html#Panda01

B. S. Panda 0001 Sajal K. Das 0001 An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. 47-57 2001 conf/hipc/2001 HiPC https://doi.org/10.1007/3-540-45307-5_5 db/conf/hipc/hipc2001.html#PandaD01 B. S. Panda 0001 Vijay Natarajan Sajal K. Das 0001 Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. 35 2001 conf/ipps/2001 IPDPS db/conf/ipps/ipdps2001.html#PandaND01 https://doi.org/10.1109/IPDPS.2001.924971 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2001.924971

B. S. Panda 0001 The forbidden subgraph characterization of directed vertex graphs. 239-256 1999 196 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(98)00127-7 https://www.wikidata.org/entity/Q127976741 db/journals/dm/dm196.html#Panda99

B. S. Panda 0001 New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. 111-115 1996 58 Inf. Process. Lett. 3 db/journals/ipl/ipl58.html#Panda96 https://doi.org/10.1016/0020-0190(96)00013-0

B. S. Panda 0001 Shreedhara Prasada Mohanty Intersection graphs of vertex disjoint paths in a tree. 179-209 1995 146 Discret. Math. 1-3 https://doi.org/10.1016/0012-365X(94)00163-9 db/journals/dm/dm146.html#PandaM95

B. S. Panda 0001 Shreedhara Prasada Mohanty Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. 139-143 1994 49 Inf. Process. Lett. 3 db/journals/ipl/ipl49.html#PandaM94 https://doi.org/10.1016/0020-0190(94)90091-4

Deepanshu Aggarwal Nipun Aggarwal Subramanian Arumugam 0001S. Arumugam 0001 Jay S. Bagga Lowell W. Beineke Bijaya K. Bhatta Bijaya Kishor Bhatta Gerard J. Chang Juhi Chaudhary Aseem Dalal Piyush Dane Anita Das 0001 Sajal K. Das 0001 Swades De Hung-Lin Fu Rumki Ghosh Subir Kumar Ghosh Muskan Goel Preeti Goel Partha P. Goswami Pooja Goyal Khyati Grover Dalu Jacob Kshitij Jindal Subhasmita Joshi Manav Kashyap Yash Keerti Anavi Khetarpal Ashutosh Krishna Akshi Kumar 0001 Mahesh Kumar Sanjay Kumar 0001 Rajendra P. Lal Dipti Lohia Jean-Daniel Lan Sun Luk Abhishek Mallik Deepak Mishra 0001 Sambit Kumar Mishra Sounaka Mishra Shreedhara Prasada Mohanty Vijay Natarajan Arti Pandey Bighnaraj Panigrahi Subhabrata Paul Dinabandhu Pradhan Darsh Pratap Priyamvada Soumyashree Rana Christopher A. RodgerC. A. Rodger Sachin Muskan Saini D. Pushparaj Shetty Lakshay Singhla Shaily Verma