default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobin Thomas 0001
Person information
- affiliation: Georgia Institute of Technology, Atlanta, School of Mathematics, USA
Other persons with the same name
- Robin Thomas 0002 — Télécom ParisTech, France
- Robin Thomas 0003
![[0000-0002-9318-1458]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-9318-1458")
— University of Turin, Department of Public Health Sciences, Italy - Robin Thomas 0004 — Chemnitz University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j97]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. J. Comb. Theory B 164: 517-548 (2024)- 2023
- [j96]Martin Rolek, Zi-Xia Song, Robin Thomas:
Properties of 8-contraction-critical graphs with no K7 minor. Eur. J. Comb. 110: 103711 (2023) - [j95]Robin Thomas, Youngho Yoo:
Packing A-paths of length zero modulo a prime. J. Comb. Theory B 160: 114-143 (2023) - [j94]Robin Thomas, Youngho Yoo:
Packing cycles in undirected group-labelled graphs. J. Comb. Theory B 161: 228-267 (2023) - [j93]Sergey Norin, Robin Thomas, Hein van der Holst:
On 2-cycles of graphs. J. Comb. Theory B 162: 184-222 (2023) - 2022
- [j92]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory B 152: 483-504 (2022) - 2021
- [j91]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory B 150: 244-269 (2021) - [j90]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory B 150: 270-304 (2021) - 2020
- [j89]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory B 145: 376-432 (2020) - [i24]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
Quickly excluding a non-planar graph. CoRR abs/2010.12397 (2020)
2010 – 2019
- 2019
- [j88]Rose McCarty, Robin Thomas:
The Extremal Function for Bipartite Linklessly Embeddable Graphs. Comb. 39(5): 1081-1104 (2019) - [j87]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth Six Cubic Graphs Have Petersen Minors. Comb. 39(6): 1413-1423 (2019) - [j86]Robin Thomas, Youngho Yoo:
The extremal functions for triangle-free graphs with excluded minors. Eur. J. Comb. 75: 1-10 (2019) - [j85]Chun-Hung Liu, Robin Thomas:
Excluding subdivisions of bounded degree graphs. J. Comb. Theory B 134: 1-35 (2019) - [j84]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in 6-connected graphs of bounded tree-width. J. Comb. Theory B 136: 1-32 (2019) - [j83]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluded minors in cubic graphs. J. Comb. Theory B 138: 219-285 (2019) - [i23]Serguei Norine, Robin Thomas:
Minimal bricks. CoRR abs/1907.00305 (2019) - 2018
- [j82]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. J. Comb. Theory B 128: 1-16 (2018) - [j81]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K6 minors in large 6-connected graphs. J. Comb. Theory B 129: 158-203 (2018) - [j80]Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan:
A new proof of the flat wall theorem. J. Comb. Theory B 129: 204-238 (2018) - [j79]Rajneesh Hegde, Robin Thomas:
Non-embeddable extensions of embedded minors. J. Comb. Theory B 131: 55-84 (2018) - [j78]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory B 132: 1-46 (2018) - [j77]Alexander Hoyer, Robin Thomas:
Four Edge-Independent Spanning Trees. SIAM J. Discret. Math. 32(1): 233-248 (2018) - 2017
- [j76]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. J. Comb. Theory B 125: 132-167 (2017) - [i22]Thanh N. Dang, Robin Thomas:
Minors of two-connected graphs of large path-width. CoRR abs/1712.04549 (2017) - 2016
- [j75]Robin Thomas, Peter Whalen:
Odd K3, 3 subdivisions in bipartite graphs. J. Comb. Theory B 118: 76-87 (2016) - [j74]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. J. Comb. Theory B 119: 42-65 (2016) - [j73]Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Three-edge-colouring doublecross cubic graphs. J. Comb. Theory B 119: 66-95 (2016) - [j72]Zdenek Dvorák, Daniel Král', Robin Thomas:
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory B 120: 1-17 (2016) - [j71]Sergey Norin, Robin Thomas:
Non-planar extensions of subdivisions of planar graphs. J. Comb. Theory B 121: 326-366 (2016) - [j70]Waseem Abbas, Magnus Egerstedt, Chun-Hung Liu, Robin Thomas, Peter Whalen:
Deploying Robots With Two Sensors in K1, 6-Free Graphs. J. Graph Theory 82(3): 236-252 (2016) - [i21]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR abs/1601.01197 (2016) - [i20]Luke Postle, Robin Thomas:
Hyperbolic families and coloring graphs on surfaces. CoRR abs/1609.06749 (2016) - 2015
- [j69]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. J. Comb. Theory B 111: 234-241 (2015) - [i19]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. CoRR abs/1503.02298 (2015) - [i18]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. CoRR abs/1505.05927 (2015) - [i17]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR abs/1509.01013 (2015) - [i16]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding A Grid Minor In Planar Digraphs. CoRR abs/1510.00473 (2015) - 2014
- [i15]Zdenek Dvorák, Robin Thomas:
List-coloring apex-minor-free graphs. CoRR abs/1401.1399 (2014) - [i14]Rajneesh Hegde, Robin Thomas:
Non-Embeddable Extensions of Embedded Minors. CoRR abs/1401.2973 (2014) - [i13]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Reducibility in the Four-Color Theorem. CoRR abs/1401.6481 (2014) - [i12]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Discharging cartwheels. CoRR abs/1401.6485 (2014) - [i11]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. CoRR abs/1402.1813 (2014) - [i10]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth six cubic graphs have Petersen minors. CoRR abs/1405.0533 (2014) - 2013
- [j68]Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. J. ACM 60(5): 36:1-36:24 (2013) - [j67]Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas:
Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory B 103(6): 706-712 (2013) - [p1]Vojtech Rödl, Robin Thomas:
Arrangeability and Clique Subdivisions. The Mathematics of Paul Erdős II 2013: 233-236 - [i9]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. CoRR abs/1302.2158 (2013) - [i8]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. CoRR abs/1302.5121 (2013) - [i7]Robin Thomas, Peter Whalen:
Odd K_3, 3 subdivisions in bipartite graphs. CoRR abs/1309.5336 (2013) - 2012
- [j66]César Hernández-Vélez, Gelasio Salazar, Robin Thomas:
Nested cycles in large triangulations and crossing-critical graphs. J. Comb. Theory B 102(1): 86-92 (2012) - [j65]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger:
Five-coloring graphs on the Klein bottle. J. Comb. Theory B 102(5): 1067-1098 (2012) - [i6]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in 6-connected graphs of bounded tree-width. CoRR abs/1203.2171 (2012) - [i5]Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan:
K_6 minors in large 6-connected graphs. CoRR abs/1203.2192 (2012) - 2011
- [j64]Bertrand Guenin, Robin Thomas:
Packing directed circuits exactly. Comb. 31(4): 397-421 (2011) - [j63]Torsten Inkmann, Robin Thomas:
Minor-Minimal Planar Graphs of Even Branch-Width. Comb. Probab. Comput. 20(1): 73-82 (2011) - [j62]Arash Asadi, Luke Postle, Robin Thomas:
Minor-minimal non-projective planar graphs with an internal 3-separation. Electron. Notes Discret. Math. 38: 69-75 (2011) - [j61]Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan:
Large non-planar graphs and an application to crossing-critical graphs. J. Comb. Theory B 101(2): 111-121 (2011) - [j60]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms 7(4): 41:1-41:14 (2011) - [i4]Cristina G. Fernandes, Robin Thomas:
Edge-coloring series-parallel multigraphs. CoRR abs/1107.5370 (2011) - [i3]Zdenek Dvorák, Daniel Král, Robin Thomas:
Testing first-order properties for subclasses of sparse graphs. CoRR abs/1109.5036 (2011) - 2010
- [j59]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. J. Comb. Theory B 100(3): 313-331 (2010) - [j58]Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan:
Voting in Agreeable Societies. Am. Math. Mon. 117(1): 27-39 (2010) - [c12]Zdenek Dvorák, Daniel Král, Robin Thomas:
Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142 - [i2]Zdenek Dvorák, Daniel Král, Robin Thomas:
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. CoRR abs/1010.2472 (2010) - [i1]Bertrand Guenin, Robin Thomas:
Packing directed circuits exactly. CoRR abs/1012.2749 (2010)
2000 – 2009
- 2009
- [j57]Arash Asadi, Luke Postle, Robin Thomas:
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. Electron. Notes Discret. Math. 34: 81-87 (2009) - [c11]Robin Thomas:
Kt Minors in Large t-Connected Graphs. IWOCA 2009: 19 - [c10]Zdenek Dvorák, Daniel Král, Robin Thomas:
Coloring triangle-free graphs on surfaces. SODA 2009: 120-129 - [c9]Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas:
Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182 - 2008
- [j56]Serguei Norine, Robin Thomas:
Pfaffian labelings and signs of edge colorings. Comb. 28(1): 99-111 (2008) - [j55]Daniel Král, Robin Thomas:
Coloring even-faced graphs in the torus and the Klein bottle. Comb. 28(3): 325-341 (2008) - [j54]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31: 235-240 (2008) - [j53]Robin Thomas, Paul Wollan:
The extremal function for 3-linked graphs. J. Comb. Theory B 98(5): 939-971 (2008) - [j52]Serguei Norine, Robin Thomas:
Minimally non-Pfaffian graphs. J. Comb. Theory B 98(5): 1038-1055 (2008) - 2007
- [j51]Serguei Norine, Robin Thomas:
Generating bricks. J. Comb. Theory B 97(5): 769-817 (2007) - [c8]Zdenek Dvorák, Daniel Král, Robin Thomas:
Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4 - 2006
- [j50]Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas:
The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. 13(1) (2006) - [j49]Zi-Xia Song, Robin Thomas:
The extremal function for K9 minors. J. Comb. Theory B 96(2): 240-252 (2006) - [j48]Christopher Carl Heckman, Robin Thomas:
Independent sets in triangle-free cubic planar graphs. J. Comb. Theory B 96(2): 253-275 (2006) - [j47]Serguei Norine, Robin Thomas:
Minimal bricks. J. Comb. Theory B 96(4): 505-513 (2006) - [j46]Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan:
Proper minor-closed families are small. J. Comb. Theory B 96(5): 754-757 (2006) - 2005
- [j45]Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan:
Generation of simple quadrangulations of the sphere. Discret. Math. 305(1-3): 33-54 (2005) - [j44]Robin Thomas, Paul Wollan:
An improved linear edge bound for graph linkages. Eur. J. Comb. 26(3-4): 309-324 (2005) - [j43]Robin Thomas, Xingxing Yu, Wenan Zang:
Hamilton paths in toroidal graphs. J. Comb. Theory B 94(2): 214-236 (2005) - 2004
- [j42]Robin Thomas, Barrett Walls:
Three-coloring Klein bottle graphs of girth five. J. Comb. Theory B 92(1): 115-135 (2004) - [j41]Petr Hlinený, Robin Thomas:
On possible counterexamples to Negami's planar cover conjecture. J. Graph Theory 46(3): 183-206 (2004) - 2003
- [j40]Louis Kauffman, Robin Thomas:
Temperely-Lieb Algebras and the Four-Color Theorem. Comb. 23(4): 653-667 (2003) - [j39]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003) - 2002
- [j38]Thor Johnson, Robin Thomas:
Generating Internally Four-Connected Graphs. J. Comb. Theory B 85(1): 21-58 (2002) - 2001
- [j37]Christopher Carl Heckman, Robin Thomas:
A new proof of the independence ratio of triangle-free cubic graphs. Discret. Math. 233(1-3): 233-237 (2001) - [j36]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Directed Tree-Width. J. Comb. Theory B 82(1): 138-154 (2001) - [j35]Noga Alon, Dhruv Mubayi, Robin Thomas:
Large induced forests in sparse graphs. J. Graph Theory 38(3): 113-123 (2001) - 2000
- [j34]Robin Thomas, Jan Mcdonald Thomson:
Excluding Minors In Nonplanar Graphs Of Girth At Least Five. Comb. Probab. Comput. 9(6): 573-585 (2000) - [j33]Bruce A. Reed, Robin Thomas:
Clique Minors in Graphs and Their Complements. J. Comb. Theory B 78(1): 81-85 (2000) - [c7]Robin Thomas:
Digraph minors and algorithms (abstract only). SODA 2000: 75
1990 – 1999
- 1999
- [j32]Martin Juvan, Bojan Mohar, Robin Thomas:
List Edge-Colorings of Series-Parallel Graphs. Electron. J. Comb. 6 (1999) - [j31]Reinhard Diestel, Robin Thomas:
Excluding a Countable Clique. J. Comb. Theory B 76(1): 41-67 (1999) - [c6]Robin Thomas:
Graph Planarity and Related Topics. GD 1999: 137-144 - 1997
- [j30]Robin Thomas, Xingxing Yu:
Five-Connected Toroidal Graphs Are Hamiltonian. J. Comb. Theory B 69(1): 79-96 (1997) - [j29]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
The Four-Colour Theorem. J. Comb. Theory B 70(1): 2-44 (1997) - [j28]Neil Robertson, Paul D. Seymour, Robin Thomas:
Tutte's Edge-Colouring Conjecture. J. Comb. Theory B 70(1): 166-183 (1997) - [c5]William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas:
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405 - 1996
- [j27]Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas:
Packing Directed Circuits. Comb. 16(4): 535-554 (1996) - [j26]Nathaniel Dean, Robin Thomas, Xingxing Yu:
Spanning paths in infinite planar graphs. J. Graph Theory 23(2): 163-174 (1996) - [j25]Paul D. Seymour, Robin Thomas:
Uniqueness of highly representative surface embeddings. J. Graph Theory 23(4): 337-349 (1996) - [c4]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 - 1995
- [j24]Neil Robertson, Paul D. Seymour, Robin Thomas:
Kuratowski Chains. J. Comb. Theory B 64(2): 127-154 (1995) - [j23]Neil Robertson, Paul D. Seymour, Robin Thomas:
Petersen Family Minors. J. Comb. Theory B 64(2): 155-184 (1995) - [j22]Neil Robertson, Paul D. Seymour, Robin Thomas:
Sachs' Linkless Embedding Conjecture. J. Comb. Theory B 64(2): 185-227 (1995) - [j21]Vojtech Rödl, Robin Thomas:
On the Genus of a Random Graph. Random Struct. Algorithms 6(1): 1-12 (1995) - 1994
- [j20]Paul D. Seymour, Robin Thomas:
Call Routing and the Ratcatcher. Comb. 14(2): 217-241 (1994) - [j19]Robin Thomas, Xingxing Yu:
4-Connected Projective-Planar Graphs Are Hamiltonian. J. Comb. Theory B 62(1): 114-132 (1994) - [j18]Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly Excluding a Planar Graph. J. Comb. Theory B 62(2): 323-348 (1994) - [j17]Noga Alon, Paul D. Seymour, Robin Thomas:
Planar Separators. SIAM J. Discret. Math. 7(2): 184-193 (1994) - 1993
- [j16]Neil Robertson, Paul D. Seymour, Robin Thomas:
Hadwiger's conjecture for K 6-free graphs. Comb. 13(3): 279-361 (1993) - [j15]Bogdan Oporowski, James G. Oxley, Robin Thomas:
Typical Subgraphs of 3- and 4-Connected Graphs. J. Comb. Theory B 57(2): 239-257 (1993) - [j14]Paul D. Seymour, Robin Thomas:
Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory B 58(1): 22-33 (1993) - 1992
- [j13]Jirí Matousek, Robin Thomas:
On the complexity of finding iso- and other morphisms for partial k-trees. Discret. Math. 108(1-3): 343-364 (1992) - [j12]Hanno Lefmann, Vojtech Rödl, Robin Thomas:
Monochromatic Vs multicolored paths. Graphs Comb. 8(4): 323-332 (1992) - 1991
- [j11]Igor Kríz, Robin Thomas:
Analyzing Nash-Williams' partition theorem by means of ordinal types. Discret. Math. 95(1-3): 135-167 (1991) - [j10]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding infinite minors. Discret. Math. 95(1-3): 303-319 (1991) - [j9]Paul D. Seymour, Robin Thomas:
An end-faithful spanning tree counterexample. Discret. Math. 95(1-3): 321-330 (1991) - [j8]Jirí Matousek, Robin Thomas:
Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms 12(1): 1-22 (1991) - [j7]Igor Kríz, Robin Thomas:
The menger-like property of the tree-width of infinite graphs. J. Comb. Theory B 52(1): 86-91 (1991) - [j6]Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly excluding a forest. J. Comb. Theory B 52(2): 274-283 (1991) - [j5]Neil Robertson, Robin Thomas:
On the orientable genus of graphs embedded in the klein bottle. J. Graph Theory 15(4): 407-419 (1991) - [c3]Neil Robertson, Paul D. Seymour, Robin Thomas:
A survey of linkless embeddings. Graph Structure Theory 1991: 125-136 - [c2]Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 - 1990
- [j4]Igor Kríz, Robin Thomas:
Clique-sums, tree-decompositions and compactness. Discret. Math. 81(2): 177-185 (1990) - [j3]Igor Kríz, Robin Thomas:
On well-quasi-ordering finite structures with labels. Graphs Comb. 6(1): 41-49 (1990) - [j2]Robin Thomas:
A menger-like property of tree-width: The finite case. J. Comb. Theory B 48(1): 67-76 (1990) - [c1]Noga Alon, Paul D. Seymour, Robin Thomas:
A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990: 293-299
1980 – 1989
- 1985
- [j1]Robin Thomas:
Graphs without K4 and well-quasi-ordering. J. Comb. Theory B 38(3): 240-247 (1985)
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-10-07 21:23 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:
