default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBhawani Sankar Panda
B. S. Panda 0001
Person information
- affiliation: Indian Institute of Technology Delhi, Department of Mathematics, India
Other persons with the same name
- B. S. Panda 0002 — MITS Engineering College, Rayagada, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j73]Bhawani Sankar Panda
, Rumki Ghosh:
Injective coloring of subclasses of chordal graphs. Theor. Comput. Sci. 1023: 114894 (2025)- 2024
- [j72]Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger:
Total colorings of complete multipartite graphs using amalgamations. Discret. Appl. Math. 359: 186-195 (2024) - [j71]B. S. Panda:
Injective edge coloring of some standard graph products. Discret. Math. Algorithms Appl. 16(4): 2350041:1-2350041:13 (2024) - [j70]Shaily Verma, Bhawani Sankar Panda:
Adjacent vertex distinguishing total coloring of the corona product of graphs. Discuss. Math. Graph Theory 44(1): 317 (2024) - [j69]Pooja Goyal, Bhawani Sankar Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. Int. J. Found. Comput. Sci. 35(6): 669-703 (2024) - [j68]B. S. Panda, Soumyashree Rana, Sounaka Mishra:
On the complexity of co-secure dominating set problem. Inf. Process. Lett. 185: 106463 (2024) - [j67]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the complexity of minimum maximal acyclic matchings. J. Comb. Optim. 48(1): 10 (2024) - [c42]Aseem Dalal, B. S. Panda:
On Total Chromatic Number of Complete Multipartite Graphs. CALDAM 2024: 270-285 - 2023
- [j66]B. S. Panda, Pooja Goyal:
Hardness results of global roman domination in graphs. Discret. Appl. Math. 341: 337-348 (2023) - [j65]Sanjay Kumar, Abhishek Mallik, B. S. Panda:
Influence maximization in social networks using transfer learning via graph-based LSTM. Expert Syst. Appl. 212: 118770 (2023) - [j64]B. S. Panda, Juhi Chaudhary:
Acyclic matching in some subclasses of graphs. Theor. Comput. Sci. 943: 36-49 (2023) - [j63]Priyamvada, B. S. Panda:
Complexity and algorithms for injective edge coloring of graphs. Theor. Comput. Sci. 968: 114010 (2023) - [j62]Sanjay Kumar, Akshi Kumar, B. S. Panda:
Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking. IEEE Trans. Ind. Informatics 19(1): 703-711 (2023) - [c41]B. S. Panda, Sachin:
Algorithms and Complexity of Strongly Stable Non-crossing Matchings. CALDAM 2023: 363-376 - [c40]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
Minimum Maximal Acyclic Matching in Proper Interval Graphs. CALDAM 2023: 377-388 - [i5]Bhawani Sankar Panda, Soumyashree Rana, Sounaka Mishra:
On the Complexity of Co-secure Dominating Set Problem. CoRR abs/2306.10378 (2023) - [i4]Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda:
Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results. CoRR abs/2312.01149 (2023) - 2022
- [j61]Priyamvada, B. S. Panda:
Exact square coloring of graphs resulting from some graph operations and products. AKCE Int. J. Graphs Comb. 19(3): 211-220 (2022) - [j60]Sanjay Kumar, Dipti Lohia, Darsh Pratap, Ashutosh Krishna, B. S. Panda:
MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks. Computing 104(2): 359-382 (2022) - [j59]B. S. Panda, Pooja Goyal:
Hardness results of global total k-domination problem in graphs. Discret. Appl. Math. 319: 223-238 (2022) - [j58]Shaily Verma, Hung-Lin Fu, B. S. Panda:
Adjacent vertex distinguishing total coloring in split graphs. Discret. Math. 345(11): 113061 (2022) - [j57]Sanjay Kumar, Abhishek Mallik, Anavi Khetarpal, Bhawani Sankar Panda:
Influence maximization in social networks using graph embedding and graph neural network. Inf. Sci. 607: 1617-1636 (2022) - [j56]B. S. Panda, Priyamvada:
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. Theor. Comput. Sci. 906: 32-51 (2022) - [j55]Priyamvada, B. S. Panda:
Exact square coloring of certain classes of graphs: Complexity and algorithms. Theor. Comput. Sci. 932: 84-101 (2022) - [j54]Sanjay Kumar, Abhishek Mallik, B. S. Panda:
Link prediction in complex networks using node centrality and light gradient boosting machine. World Wide Web 25(6): 2487-2513 (2022) - [c39]B. S. Panda, Sachin:
Hardness and Approximation Results for Some Variants of Stable Marriage Problem. CALDAM 2022: 252-264 - [c38]Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the Complexity of Minimum Maximal Acyclic Matchings. COCOON 2022: 106-117 - [c37]Juhi Chaudhary, B. S. Panda:
On Two Variants of Induced Matchings. ICS 2022: 37-48 - 2021
- [j53]Sanjay Kumar, Lakshay Singhla, Kshitij Jindal, Khyati Grover, B. S. Panda:
IM-ELPR: Influence maximization in social networks using label propagation based community structure. Appl. Intell. 51(11): 7647-7665 (2021) - [j52]B. S. Panda, Priyamvada:
Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discret. Appl. Math. 291: 68-87 (2021) - [j51]Bhawani Sankar Panda, Subir Kumar Ghosh:
Preface: CALDAM 2018. Discret. Appl. Math. 305: 260 (2021) - [j50]Sanjay Kumar, Muskan Saini, Muskan Goel, B. S. Panda:
Modeling information diffusion in online social networks using a modified forest-fire model. J. Intell. Inf. Syst. 56(2): 355-377 (2021) - [j49]Sanjay Kumar, B. S. Panda, Deepanshu Aggarwal:
Community detection in complex networks using network embedding and gravitational search algorithm. J. Intell. Inf. Syst. 57(1): 51-72 (2021) - [j48]B. S. Panda, Pooja Goyal:
Global total k-domination: Approximation and hardness results. Theor. Comput. Sci. 850: 1-19 (2021) - [j47]B. S. Panda, Pooja Goyal, Dinabandhu Pradhan:
Differentiating-total domination: Approximation and hardness results. Theor. Comput. Sci. 876: 45-58 (2021) - [j46]Juhi Chaudhary, Bhawani Sankar Panda:
On the complexity of minimum maximal uniquely restricted matching. Theor. Comput. Sci. 882: 15-28 (2021) - [j45]B. S. Panda, Juhi Chaudhary:
Dominating induced matching in some subclasses of bipartite graphs. Theor. Comput. Sci. 885: 104-115 (2021) - [c36]B. S. Panda, Pooja Goyal:
Hardness Results of Global Roman Domination in Graphs. CALDAM 2021: 500-511 - [c35]Pooja Goyal, B. S. Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. COCOA 2021: 653-667 - [c34]Pooja Goyal, B. S. Panda:
Hardness and Approximation Results of Roman {3}-Domination in Graphs. COCOON 2021: 101-111 - 2020
- [j44]B. S. Panda, Shaily Verma, Yash Keerti:
On the total and AVD-total coloring of graphs. AKCE Int. J. Graphs Comb. 17(3): 820-825 (2020) - [j43]Shaily Verma, B. S. Panda:
Grundy coloring in some subclasses of bipartite graphs and their complements. Inf. Process. Lett. 163: 105999 (2020) - [j42]B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap:
Maximum weight induced matching in some subclasses of bipartite graphs. J. Comb. Optim. 40(3): 713-732 (2020) - [c33]B. S. Panda, Pooja Goyal:
Hardness Results of Global Total k-Domination Problem in Graphs. CALDAM 2020: 92-101 - [c32]Juhi Chaudhary, B. S. Panda:
On the Complexity of Minimum Maximal Uniquely Restricted Matching. COCOA 2020: 364-376 - [c31]Sanjay Kumar, Nipun Aggarwal, B. S. Panda:
Identifying Influential Spreaders On a Weighted Network Using HookeRank Method. ICCS (1) 2020: 609-622 - [c30]B. S. Panda, Juhi Chaudhary:
Acyclic Matching in Some Subclasses of Graphs. IWOCA 2020: 409-421
2010 – 2019
- 2019
- [j41]Arti Pandey, B. S. Panda:
Domination in some subclasses of bipartite graphs. Discret. Appl. Math. 252: 51-66 (2019) - [j40]Dinabandhu Pradhan, B. S. Panda:
Computing a minimum paired-dominating set in strongly orderable graphs. Discret. Appl. Math. 253: 37-50 (2019) - [j39]B. S. Panda, Shaily Verma:
On partial Grundy coloring of bipartite graphs and chordal graphs. Discret. Appl. Math. 271: 171-183 (2019) - [c29]B. S. Panda, Juhi Chaudhary:
Dominating Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2019: 138-149 - 2018
- [j38]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic aspects of b-disjunctive domination in graphs. J. Comb. Optim. 36(2): 572-590 (2018) - [c28]B. S. Panda, Anita Das:
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. WG 2018: 369-381 - [e2]B. S. Panda, Partha P. Goswami:
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. Lecture Notes in Computer Science 10743, Springer 2018, ISBN 978-3-319-74179-6 [contents] - 2017
- [j37]B. S. Panda, Arti Pandey:
Algorithmic aspects of open neighborhood location-domination in graphs. Discret. Appl. Math. 216: 290-306 (2017) - [j36]Arti Pandey, B. S. Panda:
Restrained Domination in Some Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 63: 203-210 (2017) - [c27]B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De:
New heuristics for strong minimum energy topology with reduced time complexity. ANTS 2017: 1-6 - [c26]Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap:
Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2017: 308-319 - [c25]Bhawani Sankar Panda, Bijaya K. Bhatta, Sambit Kumar Mishra:
Improved Energy-Efficient Target Coverage in Wireless Sensor Networks. ICCSA (6) 2017: 350-362 - [e1]S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda:
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10398, Springer 2017, ISBN 978-3-319-64418-9 [contents] - 2016
- [j35]B. S. Panda, Arti Pandey:
Complexity of total outer-connected domination problem in graphs. Discret. Appl. Math. 199: 110-122 (2016) - [j34]Aseem Dalal, B. S. Panda, C. A. Rodger:
Total-colorings of complete multipartite graphs using amalgamations. Discret. Math. 339(5): 1587-1592 (2016) - [j33]B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy hierarchical topology in wireless sensor networks. J. Comb. Optim. 32(1): 174-187 (2016) - [c24]Arti Pandey, B. S. Panda:
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. CALDAM 2016: 277-288 - [c23]B. S. Panda, Arti Pandey:
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. ICTCSDM 2016: 218-227 - [c22]B. S. Panda, Shaily Verma:
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. ICTCSDM 2016: 228-237 - [i3]Arti Pandey, Bhawani Sankar Panda:
Some Algorithmic Results on Restrained Domination in Graphs. CoRR abs/1606.02340 (2016) - 2015
- [j32]Bhawani Sankar Panda, Preeti Goel:
L(2, 1)-labeling of Block Graphs. Ars Comb. 119: 71-95 (2015) - [j31]Bhawani Sankar Panda, Dinabandhu Pradhan:
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. Discret. Math. Algorithms Appl. 7(2): 1550020:1-1550020:21 (2015) - [j30]B. S. Panda, Arti Pandey:
On the dominator coloring in proper interval graphs and block graphs. Discret. Math. Algorithms Appl. 7(4): 1550043:1-1550043:17 (2015) - [j29]B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. J. Comb. Optim. 30(4): 1077-1094 (2015) - [j28]Bhawani Sankar Panda, Subhabrata Paul, Dinabandhu Pradhan:
Hardness results, approximation and exact algorithms for liar's domination problem in graphs. Theor. Comput. Sci. 573: 26-42 (2015) - [c21]Bhawani Sankar Panda:
Separator Theorems for Interval Graphs and Proper Interval Graphs. CALDAM 2015: 101-110 - [c20]Arti Pandey, Bhawani Sankar Panda:
Domination in Some Subclasses of Bipartite Graphs. CALDAM 2015: 169-180 - [c19]B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic Aspects of Disjunctive Domination in Graphs. COCOON 2015: 325-336 - [c18]Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey:
k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2015: 187-192 - [c17]B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De:
Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCN 2015: 25:1-25:8 - [i2]Bhawani Sankar Panda, Arti Pandey:
Algorithmic aspects of disjunctive domination in graphs. CoRR abs/1502.07718 (2015) - 2014
- [j27]B. S. Panda, Subhabrata Paul:
Hardness results and approximation algorithm for total liar's domination in graphs. J. Comb. Optim. 27(4): 643-662 (2014) - [j26]Bhawani Sankar Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. J. Graph Algorithms Appl. 18(4): 493-513 (2014) - [c16]Bhawani Sankar Panda, D. Pushparaj Shetty:
Minimum Range Assignment Problem for Two Connectivity in Wireless Sensor Networks. ICDCIT 2014: 122-133 - [c15]B. S. Panda, Arti Pandey:
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. WALCOM 2014: 151-162 - 2013
- [j25]B. S. Panda, Subhabrata Paul:
Liar's domination in graphs: Complexity and algorithm. Discret. Appl. Math. 161(7-8): 1085-1092 (2013) - [j24]B. S. Panda, Dinabandhu Pradhan:
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discret. Appl. Math. 161(12): 1776-1783 (2013) - [j23]B. S. Panda, Subhabrata Paul:
Connected Liar's domination in graphs: Complexity and Algorithms. Discret. Math. Algorithms Appl. 5(4) (2013) - [j22]B. S. Panda, D. Pushparaj Shetty:
Minimum interference strong bidirectional topology for wireless sensor networks. Int. J. Ad Hoc Ubiquitous Comput. 13(3/4): 243-253 (2013) - [j21]B. S. Panda, Subhabrata Paul:
A linear time algorithm for liar's domination problem in proper interval graphs. Inf. Process. Lett. 113(19-21): 815-822 (2013) - [j20]B. S. Panda, Dinabandhu Pradhan:
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26(4): 770-785 (2013) - [c14]Bhawani Sankar Panda, D. Pushparaj Shetty:
A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2013: 398-409 - 2012
- [j19]B. S. Panda, Dinabandhu Pradhan:
Acyclic Matchings in Subclasses of bipartite Graphs. Discret. Math. Algorithms Appl. 4(4) (2012) - [j18]Bighnaraj Panigrahi, Swades De, Bhawani Sankar Panda, Jean-Daniel Lan Sun Luk:
Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks. IET Commun. 6(14): 2138-2148 (2012) - [j17]B. S. Panda, Preeti Goel:
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. Inf. Process. Lett. 112(13): 552-556 (2012) - [j16]Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan:
Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459: 89-99 (2012) - [c13]Bhawani Sankar Panda, D. Pushparaj Shetty, Bijaya Kishor Bhatta:
Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks. ICDCIT 2012: 177-187 - 2011
- [j15]B. S. Panda, Preeti Goel:
L(2, 1)-labeling of perfect elimination bipartite graphs. Discret. Appl. Math. 159(16): 1878-1888 (2011) - [c12]B. S. Panda, D. Pushparaj Shetty:
Strong Minimum Interference Topology for Wireless Sensor Networks. ADCONS 2011: 366-374 - [c11]B. S. Panda, D. Pushparaj Shetty:
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCIT 2011: 187-196 - 2010
- [j14]B. S. Panda, Anita Das:
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. Discret. Appl. Math. 158(17): 1913-1935 (2010) - [j13]B. S. Panda, Dinabandhu Pradhan:
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. Inf. Process. Lett. 110(23): 1067-1073 (2010) - [c10]B. S. Panda, Preeti Goel:
Heuristic Algorithms for the L(2, 1)-Labeling Problem. SEMCCO 2010: 214-221 - [c9]Bighnaraj Panigrahi, Swades De, Bhawani Sankar Panda, Jean-Daniel Lan Sun Luk:
Energy-Efficient Greedy Forwarding Protocol for Wireless Sensor Networks. VTC Spring 2010: 1-5
2000 – 2009
- 2009
- [j12]B. S. Panda, Anita Das:
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. Discret. Appl. Math. 157(9): 2153-2169 (2009) - [j11]B. S. Panda, Sajal K. Das:
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. Inf. Process. Lett. 109(18): 1041-1046 (2009) - 2008
- [i1]B. S. Panda, Dinabandhu Pradhan:
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs. CoRR abs/0809.2443 (2008) - 2007
- [j10]B. S. Panda, Anita Das:
On tree 3-spanners in directed path graphs. Networks 50(3): 203-210 (2007) - 2006
- [j9]Bhawani Sankar Panda, Anita Das:
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. Electron. Notes Discret. Math. 27: 79-80 (2006) - [c8]Anita Das, B. S. Panda, Rajendra P. Lal:
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. ICIT 2006: 301-304 - 2005
- [j8]B. S. Panda, Sajal K. Das:
Parallel recognition algorithms for chordal_planar graphs and planar k-trees. J. Parallel Distributed Comput. 65(8): 922-926 (2005) - 2004
- [c7]B. S. Panda, Anita Das:
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. CIT 2004: 21-30 - [c6]B. S. Panda, Mahesh Kumar, Sajal K. Das:
Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids. IWDC 2004: 424-434 - 2003
- [j7]B. S. Panda, Sajal K. Das:
A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett. 87(3): 153-161 (2003) - 2002
- [j6]B. S. Panda, Vijay Natarajan, Sajal K. Das:
Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. Parallel Process. Lett. 12(1): 51-64 (2002) - [c5]B. S. Panda, Sajal K. Das:
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. HiPC 2002: 334-346 - [c4]B. S. Panda, Sajal K. Das:
A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. IFIP TCS 2002: 292-309 - [c3]B. S. Panda, Sajal K. Das:
Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. IWDC 2002: 88-97 - 2001
- [j5]B. S. Panda:
The Separator Theorem for Rooted Directed Vertex Graphs. J. Comb. Theory B 81(1): 156-162 (2001) - [c2]B. S. Panda, Sajal K. Das:
An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. HiPC 2001: 47-57 - [c1]B. S. Panda, Vijay Natarajan, Sajal K. Das:
Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. IPDPS 2001: 35
1990 – 1999
- 1999
- [j4]B. S. Panda:
The forbidden subgraph characterization of directed vertex graphs. Discret. Math. 196(1-3): 239-256 (1999) - 1996
- [j3]B. S. Panda:
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. Inf. Process. Lett. 58(3): 111-115 (1996) - 1995
- [j2]B. S. Panda, Shreedhara Prasada Mohanty:
Intersection graphs of vertex disjoint paths in a tree. Discret. Math. 146(1-3): 179-209 (1995) - 1994
- [j1]B. S. Panda, Shreedhara Prasada Mohanty:
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. Inf. Process. Lett. 49(3): 139-143 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
