default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLadislav Stacho
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i12]Peter Bradshaw, Alexander Clow, Ladislav Stacho:
Cornering Robots to Synchronize a DFA. CoRR abs/2405.00826 (2024)- 2023
- [j60]Peter Bradshaw
, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho:
On the cop number of graphs of high girth. J. Graph Theory 102(1): 15-34 (2023) - 2022
- [j59]Peter Bradshaw, Kevin Halasz, Ladislav Stacho:
From One to Many Rainbow Hamiltonian Cycles. Graphs Comb. 38(6): 188 (2022) - [j58]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible list colorings in graphs with special degeneracy conditions. J. Graph Theory 101(4): 717-745 (2022) - [j57]Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho:
Robust Connectivity of Graphs on Surfaces. SIAM J. Discret. Math. 36(2): 1416-1435 (2022) - 2021
- [i11]Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho:
Robust Connectivity of Graphs on Surfaces. CoRR abs/2104.12030 (2021) - 2020
- [j56]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. Algorithmica 82(4): 721-746 (2020) - [j55]Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho:
Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. 282: 271-281 (2020) - [j54]Masood Masjoody, Ladislav Stacho:
Cops and robbers on graphs with a set of forbidden induced subgraphs. Theor. Comput. Sci. 839: 186-194 (2020) - [c35]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC 2020: 31:1-31:15 - [i10]Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho:
On the cop number of graphs of high girth. CoRR abs/2005.10849 (2020) - [i9]Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. CoRR abs/2006.15837 (2020)
2010 – 2019
- 2019
- [j53]Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho:
Traversal with Enumeration of Geometric Graphs in Bounded Space. J. Interconnect. Networks 19(4): 1950008:1-1950008:13 (2019) - 2018
- [i8]Masood Masjoody, Ladislav Stacho:
Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs. CoRR abs/1812.06230 (2018) - 2017
- [j52]Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models. Algorithmica 79(3): 835-856 (2017) - [c34]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CIAC 2017: 196-208 - [c33]Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho:
Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) 2017: 261-275 - [i7]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CoRR abs/1701.07294 (2017) - 2016
- [j51]Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Connectivity with directional antennas in the symmetric communication model. Comput. Geom. 55: 1-25 (2016) - [j50]David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. 7(2): 3-18 (2016) - 2015
- [j49]Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Monitoring the Plane with Rotating Radars. Graphs Comb. 31(2): 393-405 (2015) - [c32]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG 2015: 360-373 - [c31]Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CPM 2015: 231-246 - [i6]Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CoRR abs/1502.03201 (2015) - 2014
- [i5]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR abs/1411.6672 (2014) - 2013
- [j48]Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho:
Strongly connected orientations of plane graphs. Discret. Appl. Math. 161(1-2): 176-183 (2013) - [c30]Javad Safaei, Ján Manuch, Ladislav Stacho:
Learning Polytrees with Constant Number of Roots from Data. Australasian Conference on Artificial Intelligence 2013: 447-452 - [i4]Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho:
The robber strikes back. CoRR abs/1308.2843 (2013) - 2012
- [j47]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. Discret. Math. Algorithms Appl. 4(3) (2012) - [j46]Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. Discret. Math. Algorithms Appl. 4(3) (2012) - [j45]Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho:
Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33(3): 294-301 (2012) - [j44]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. 19(4): 439-454 (2012) - [j43]Ján Manuch, Ladislav Stacho, Christine Stoll:
Step-wise tile assembly with a constant number of tile types. Nat. Comput. 11(3): 535-550 (2012) - [j42]Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho:
Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discret. Math. 26(3): 884-895 (2012) - [c29]Bahar Behsaz, Ján Manuch, Ladislav Stacho:
Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA 2012: 1-11 - [c28]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. LATIN 2012: 255-266 - 2011
- [j41]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10(1): 391-405 (2011) - [j40]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) - [c27]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227 - [i3]Ahmad Mahmoody-Ghaidary, Cédric Chauve, Ladislav Stacho:
Tractability results for the Double-Cut-and-Join circular median problem. CoRR abs/1111.5872 (2011) - [i2]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. CoRR abs/1112.3523 (2011) - 2010
- [j39]Ján Manuch, Ladislav Stacho, Christine Stoll:
Two Lower Bounds for Self-Assemblies at Temperature 1. J. Comput. Biol. 17(6): 841-852 (2010) - [j38]Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. 17(10): 1435-1449 (2010) - [j37]Daniel Král', Ladislav Stacho:
Coloring plane graphs with independent crossings. J. Graph Theory 64(3): 184-205 (2010) - [c26]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani:
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42 - [c25]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264 - [c24]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) 2010: 72-86 - [c23]Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. COCOA (1) 2010: 385-397 - [c22]Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon:
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119 - [c21]Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Ladislav Stacho:
Maximum Interference of Random Sensors on a Line. SIROCCO 2010: 197-210 - [c20]Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho:
Strong Orientations of Planar Graphs with Bounded Stretch Factor. SIROCCO 2010: 224-236 - [i1]Evangelos Kranakis, Danny Krizanc, Pat Morin, Lata Narayanan, Ladislav Stacho:
A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model. CoRR abs/1007.2120 (2010)
2000 – 2009
- 2009
- [j36]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. 157(10): 2310-2324 (2009) - [j35]Arthur L. Liestman, Dana S. Richards, Ladislav Stacho:
Broadcasting from multiple originators. Discret. Appl. Math. 157(13): 2886-2891 (2009) - [j34]Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho:
The Odd-Distance Plane Graph. Discret. Comput. Geom. 42(2): 132-141 (2009) - [j33]Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in tori. Discret. Math. 309(8): 2239-2249 (2009) - [j32]Peter Horák, Ladislav Stacho:
Preface. Discret. Math. 309(18): 5509 (2009) - [j31]Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho:
Spanning cubic graph designs. Discret. Math. 309(18): 5781-5788 (2009) - [c19]Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani:
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212 - [c18]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115 - [c17]Ján Manuch, Ladislav Stacho, Christine Stoll:
Step-Assembly with a Constant Number of Tile Types. ISAAC 2009: 954-963 - [c16]Ján Manuch, Ladislav Stacho, Christine Stoll:
Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809 - 2008
- [j30]Evangelos Kranakis, Tim Mott, Ladislav Stacho:
Constant memory routing in quasi-planar and quasi-polyhedral graphs. Discret. Appl. Math. 156(18): 3430-3442 (2008) - [j29]Daniel Král, Ladislav Stacho:
Hamiltonian threshold for strong products of graphs. J. Graph Theory 58(4): 314-328 (2008) - [j28]Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
On the Complexity of Ordered Colorings. SIAM J. Discret. Math. 22(2): 832-847 (2008) - [c15]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298 - [c14]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 - 2007
- [j27]Peter Clote, Evangelos Kranakis, Danny Krizanc, Ladislav Stacho:
Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model. Discret. Appl. Math. 155(6-7): 759-787 (2007) - [j26]Daniel Král, Ladislav Stacho:
Closure for the property of having a hamiltonian prism. J. Graph Theory 54(3): 209-220 (2007) - [j25]Tomás Kaiser, Daniel Král, Ladislav Stacho:
Tough spiders. J. Graph Theory 56(1): 23-40 (2007) - [c13]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132 - 2006
- [j24]Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho:
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4(6): 1309-1328 (2006) - [j23]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006) - [c12]Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta:
Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306 - [c11]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN 2006: 286-297 - [c10]Evangelos Kranakis, Tim Mott, Ladislav Stacho:
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs. PerCom Workshops 2006: 426-430 - 2005
- [j22]Ladislav Stacho, Dávid Szeszlér:
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences. Discret. Math. 292(1-3): 159-165 (2005) - [j21]Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. 296(2-3): 167-186 (2005) - [j20]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Ordered 3-colorings. Electron. Notes Discret. Math. 22: 299-300 (2005) - [j19]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12(10): 1328-1345 (2005) - [j18]Luis A. Goddyn, Ladislav Stacho:
Edge disjoint cycles through specified vertices. J. Graph Theory 50(3): 246-260 (2005) - [j17]Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho:
(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks 6(2): 63-84 (2005) - [c9]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia:
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245 - [r1]Evangelos Kranakis, Ladislav Stacho:
Routing and Traversal via Location Awareness in Ad Hoc Networks. Handbook of Algorithms for Wireless Networking and Mobile Computing 2005 - 2004
- [j16]Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro:
Spanning spiders and light-splitting switches. Discret. Math. 285(1-3): 83-95 (2004) - [j15]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks 5(4): 395-407 (2004) - [j14]Ladislav Stacho, Jozef Sirán, Sanming Zhou:
Routing balanced communications on hamilton decomposable networks. Parallel Process. Lett. 14(3-4): 377-385 (2004) - [c8]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156 - [c7]Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu:
Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243 - [c6]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318 - [c5]Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia:
Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004 - [c4]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208 - 2003
- [j13]Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Factor d-domatic colorings of graphs. Discret. Math. 262(1-3): 17-25 (2003) - [j12]Ján Manuch, Ladislav Stacho:
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. RAIRO Theor. Informatics Appl. 37(3): 255-270 (2003) - 2002
- [c3]Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro:
Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365 - 2001
- [j11]Ladislav Stacho:
New upper bounds for the chromatic number of a graph. J. Graph Theory 36(2): 117-120 (2001) - 2000
- [j10]Ladislav Stacho:
Cycles through specified vertices in 1-tough graphs. Ars Comb. 56 (2000) - [j9]Peter Horák, Ladislav Stacho:
A lower bound on the number of hamiltonian cycles. Discret. Math. 222(1-3): 275-280 (2000) - [j8]Ladislav Stacho, Imrich Vrto:
Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29(5): 1621-1629 (2000)
1990 – 1999
- 1999
- [j7]Ladislav Stacho:
Locally Pancyclic Graphs. J. Comb. Theory B 76(1): 22-40 (1999) - 1998
- [j6]Ladislav Stacho:
Non-Isomorphic Smallest Maximally Non-Hamiltonian Graphs. Ars Comb. 48 (1998) - [j5]Ladislav Stacho, Imrich Vrto:
Bisection Width of Transposition Graphs. Discret. Appl. Math. 84(1-3): 221-235 (1998) - 1997
- [j4]Ladislav Stacho:
A sufficient condition guaranteeing large cycles in graphs. Discret. Math. 169(1-3): 273-277 (1997) - [j3]Ladislav Stacho:
A New Chvátal Type Condition for Pancyclicity. Graphs Comb. 13(3): 275-280 (1997) - 1996
- [j2]Ladislav Stacho:
Maximally non-hamiltonian graphs of girth 7. Graphs Comb. 12(1): 361-371 (1996) - [c2]Ladislav Stacho, Imrich Vrto:
Virtual Path Layout for Some Bounded Degree Networks. SIROCCO 1996: 269-178 - 1995
- [j1]Ladislav Stacho:
On minimal outerplanar graphs of given diameter. Australas. J Comb. 12: 67-76 (1995) - [c1]Ladislav Stacho, Imrich Vrt'o:
Bisection widths of transposition graphs. SPDP 1995: 681-688
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-06-10 20:27 CEST 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:
