default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin McDiarmid
Colin J. H. McDiarmid
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j118]Colin McDiarmid:
Pendant appearances and components in random graphs from structured classes. Eur. J. Comb. 120: 103994 (2024)- [j117]Colin McDiarmid, Sophia Saller:
Random graphs embeddable in order-dependent surfaces. Random Struct. Algorithms 64(4): 940-985 (2024) - [c10]Baptiste Louf, Colin McDiarmid, Fiona Skerman:
Modularity and Graph Expansion. ITCS 2024: 78:1-78:21 - 2023
- [j116]Colin McDiarmid, Sophia Saller:
Classes of graphs embeddable in order-dependent surfaces. Comb. Theory 3(1) (2023) - [i9]Colin McDiarmid, Fiona Skerman:
Modularity of very dense graphs. CoRR abs/2311.06875 (2023) - 2021
- [j115]Colin McDiarmid, Alex Scott, Paul Withers:
The component structure of dense random subgraphs of the hypercube. Random Struct. Algorithms 59(1): 3-24 (2021) - [i8]Colin McDiarmid, Fiona Skerman:
Modularity and edge sampling. CoRR abs/2112.13190 (2021) - 2020
- [j114]Colin McDiarmid, Fiona Skerman
:
Modularity of Erdős-Rényi random graphs. Random Struct. Algorithms 57(1): 211-243 (2020) - [j113]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. Random Struct. Algorithms 57(2): 339-370 (2020)
2010 – 2019
- 2019
- [j112]Colin McDiarmid, Michal Przykucki:
On the critical densities of minor-closed classes. Eur. J. Comb. 75: 66-91 (2019) - [j111]Colin McDiarmid, Michal Przykucki:
On the purity of minor-closed classes of graphs. J. Comb. Theory B 135: 295-318 (2019) - [j110]Colin McDiarmid, Nikola Yolov:
Random perfect graphs. Random Struct. Algorithms 54(1): 148-186 (2019) - [j109]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique coloring of binomial random graphs. Random Struct. Algorithms 54(4): 589-614 (2019) - 2018
- [j108]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique Colourings of Geometric Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j107]Colin McDiarmid, Fiona Skerman:
Modularity of regular and treelike graphs. J. Complex Networks 6(4): 596-619 (2018) - [j106]Colin McDiarmid, David B. Penman, Vasileios Iliopoulos:
Linear Extensions and Comparable Pairs in Partial Orders. Order 35(3): 403-420 (2018) - [c9]Colin McDiarmid, Fiona Skerman:
Modularity of Erdös-Rényi Random Graphs. AofA 2018: 31:1-31:13 - [i7]Colin McDiarmid, Fiona Skerman:
Modularity of Erdős-Rényi random graphs. CoRR abs/1808.02243 (2018) - [i6]Josep Díaz, Colin McDiarmid, Dieter Mitsche:
Learning random points from geometric graphs or orderings. CoRR abs/1809.09879 (2018) - 2017
- [j105]Colin McDiarmid, Kerstin Weller:
Bridge-Addability, Edge-Expansion and Connectivity. Comb. Probab. Comput. 26(5): 697-719 (2017) - [j104]Colin McDiarmid, Nikola Yolov:
Hamilton Cycles, Minimum Degree, and Bipartite Holes. J. Graph Theory 86(3): 277-285 (2017) - [j103]Colin McDiarmid, Alex Scott, Paul Withers:
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50(3): 437-463 (2017) - 2016
- [b1]Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid:
Random Graphs, Geometry and Asymptotic Structure. London Mathematical Society student texts 84, Cambridge University Press 2016, ISBN 978-1-316-50191-7, pp. 1-122 - [j102]A. Hillebrand, Colin McDiarmid:
Colour degree matrices of graphs with at most one cycle. Discret. Appl. Math. 209: 144-152 (2016) - [j101]Colin McDiarmid:
Connectivity for bridge-alterable graph classes. Eur. J. Comb. 56: 33-39 (2016) - [j100]Colin McDiarmid, Alex Scott:
Random graphs from a block-stable class. Eur. J. Comb. 58: 96-106 (2016) - [i5]Colin McDiarmid, Nikola Yolov:
Recognition of unipolar and generalised split graphs. CoRR abs/1604.00922 (2016) - [i4]Colin McDiarmid, Fiona Skerman:
Modularity of tree-like and random regular graphs. CoRR abs/1606.09101 (2016) - 2015
- [j99]Colin McDiarmid, Nikola Yolov:
Recognition of Unipolar and Generalised Split Graphs. Algorithms 8(1): 46-59 (2015) - [i3]Ross Atkins, Colin McDiarmid:
Extremal Distances for Subtree Transfer Operations in Binary Trees. CoRR abs/1509.00669 (2015) - 2014
- [j98]Louigi Addario-Berry, Svante Janson, Colin McDiarmid:
On the Spread of Random Graphs. Comb. Probab. Comput. 23(4): 477-504 (2014) - [j97]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35: 232-244 (2014) - [j96]Colin McDiarmid, Tobias Müller:
The number of disk graphs. Eur. J. Comb. 35: 413-431 (2014) - [j95]Colin McDiarmid, Valentas Kurauskas:
Random graphs containing few disjoint excluded minors. Random Struct. Algorithms 44(2): 240-268 (2014) - [j94]Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - [c8]Colin McDiarmid, Kerstin Weller:
Relatively Bridge-Addable Classes of Graphs. LATIN 2014: 391-398 - [i2]Colin McDiarmid, Alex D. Scott, Paul Withers:
Uniform multicommodity flow in the hypercube with random edge capacities. CoRR abs/1406.4433 (2014) - 2013
- [j93]Colin McDiarmid:
Random Graphs from a Weighted Minor-Closed Class. Electron. J. Comb. 20(2): 52 (2013) - [j92]Hiu-Fai Law, Colin McDiarmid:
On Independent Sets in Graphs with Given Minimum Degree. Comb. Probab. Comput. 22(6): 874-884 (2013) - [j91]Colin McDiarmid, Fiona Skerman:
Modularity in random regular graphs and lattices. Electron. Notes Discret. Math. 43: 431-437 (2013) - [j90]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. J. Comb. Theory B 103(1): 114-143 (2013) - 2012
- [j89]Colin McDiarmid:
Connectivity for Random Graphs from a Weighted Bridge-Addable Class. Electron. J. Comb. 19(4): 53 (2012) - [j88]Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21(6): 803-815 (2012) - [c7]Colin McDiarmid:
Quicksort and Large Deviations. MEMICS 2012: 43-52 - 2011
- [j87]Colin McDiarmid, Tobias Müller:
On the chromatic number of random geometric graphs. Comb. 31(4): 423-488 (2011) - [j86]Valentas Kurauskas, Colin McDiarmid:
Random Graphs with Few Disjoint Cycles. Comb. Probab. Comput. 20(5): 763-775 (2011) - [j85]Colin McDiarmid:
On graphs with few disjoint t-star minors. Eur. J. Comb. 32(8): 1394-1406 (2011) - [j84]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. 38: 349-354 (2011) - [j83]Colin McDiarmid, Tobias Müller:
Counting disk graphs. Electron. Notes Discret. Math. 38: 627-632 (2011) - [j82]Mihyun Kang, Colin McDiarmid:
Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38(1-2): 174-204 (2011) - [i1]Colin McDiarmid, Tobias Müller:
Integer realizations of disk and segment graphs. CoRR abs/1111.2931 (2011) - 2010
- [j81]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
The t-Stability Number of a Random Graph. Electron. J. Comb. 17(1) (2010) - [j80]Ross J. Kang, Colin McDiarmid:
The t-Improper Chromatic Number of Random Graphs. Comb. Probab. Comput. 19(1): 87-98 (2010) - [j79]Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou:
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310(2): 223-229 (2010) - [c6]Colin McDiarmid, Tobias Müller:
The Number of Bits Needed to Represent a Unit Disk Graph. WG 2010: 315-323
2000 – 2009
- 2009
- [j78]Colin McDiarmid:
Random Graphs from a Minor-Closed Class. Comb. Probab. Comput. 18(4): 583-599 (2009) - [j77]David J. Aldous, Colin McDiarmid, Alex D. Scott:
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37(5): 299-302 (2009) - [j76]Luc Devroye, James King, Colin McDiarmid:
Random Hyperplane Search Trees. SIAM J. Comput. 38(6): 2411-2425 (2009) - 2008
- [j75]Colin McDiarmid, Bruce A. Reed:
On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. 17(4): 591-601 (2008) - [j74]Colin McDiarmid:
Random graphs on surfaces. J. Comb. Theory B 98(4): 778-797 (2008) - 2007
- [j73]Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. Comb. 27(1): 1-12 (2007) - [j72]Colin McDiarmid:
On The Span Of A Random Channel Assignment Problem. Comb. 27(2): 183-203 (2007) - [j71]Ross J. Kang, Colin J. H. McDiarmid:
The t-improper chromatic number of random graphs. Electron. Notes Discret. Math. 29: 411-417 (2007) - [j70]Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed:
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29: 515-519 (2007) - [j69]Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid:
Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007) - 2006
- [j68]Colin McDiarmid, Bruce A. Reed:
Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006) - 2005
- [j67]Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh:
Random planar graphs. J. Comb. Theory B 93(2): 187-205 (2005) - [c5]Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl:
Random planar graphs with n nodes and a fixed number of edges. SODA 2005: 999-1007 - 2004
- [j66]Stefanie Gerke, Colin McDiarmid:
On the Number of Edges in Random Planar Graphs. Comb. Probab. Comput. 13(2): 165-183 (2004) - [j65]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection with a Co-Site Constraint. SIAM J. Discret. Math. 17(3): 403-425 (2004) - 2003
- [j64]Malwina J. Luczak, Colin J. H. McDiarmid:
Concentration for locally acting permutations. Discret. Math. 265(1-3): 159-171 (2003) - [j63]Colin J. H. McDiarmid:
On the span in channel assignment problems: bounds, computing and counting. Discret. Math. 266(1-3): 387-397 (2003) - [j62]Colin McDiarmid, Bruce A. Reed:
Channel assignment on graphs of bounded treewidth. Discret. Math. 273(1-3): 183-192 (2003) - [j61]Colin McDiarmid:
Random channel assignment in the plane. Random Struct. Algorithms 22(2): 187-212 (2003) - 2002
- [j60]Colin McDiarmid:
Concentration For Independent Permutations. Comb. Probab. Comput. 11(2): 163-178 (2002) - [j59]Chính T. Hoàng, Colin J. H. McDiarmid:
On the divisibility of graphs. Discret. Math. 242(1-3): 145-156 (2002) - [j58]Nikolaos Fountoulakis, Colin McDiarmid:
Upper bounds on the non-3-colourability threshold of random graphs. Discret. Math. Theor. Comput. Sci. 5(1): 205-226 (2002) - 2001
- [j57]Stefanie Gerke, Colin McDiarmid:
Channel Assignment with Large Demands. Ann. Oper. Res. 107(1-4): 143-159 (2001) - [j56]Colin McDiarmid, Bruce A. Reed:
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electron. Notes Discret. Math. 10: 198-201 (2001) - [j55]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection. J. Comb. Theory B 83(1): 58-78 (2001) - [j54]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection II. J. Comb. Theory B 83(1): 79-101 (2001) - [j53]Malwina J. Luczak, Colin McDiarmid:
Bisecting sparse random graphs. Random Struct. Algorithms 18(1): 31-38 (2001) - 2000
- [j52]Colin J. H. McDiarmid:
Frequency-distance constraints with large distances. Discret. Math. 223(1-3): 227-251 (2000) - [j51]Colin McDiarmid, Bruce A. Reed:
Channel assignment and weighted coloring. Networks 36(2): 114-117 (2000)
1990 – 1999
- 1999
- [j50]Colin McDiarmid:
Pattern Minimisation in Cutting Stock Problems. Discret. Appl. Math. 98(1-2): 121-130 (1999) - [j49]Colin McDiarmid, Bruce A. Reed:
Colouring proximity graphs in the plane. Discret. Math. 199(1-3): 123-137 (1999) - 1998
- [j48]Andrew Beveridge, Alan M. Frieze, Colin McDiarmid:
Random Minimum Length Spanning Trees in Regular Graphs. Comb. 18(3): 311-333 (1998) - 1997
- [j47]Colin McDiarmid:
Centering Sequences with Bounded Differences. Comb. Probab. Comput. 6(1): 79-86 (1997) - [j46]Colin McDiarmid:
A Doubly Cyclic Channel Assignment Problem. Discret. Appl. Math. 80(2-3): 263-268 (1997) - [j45]Colin McDiarmid:
Hypergraph colouring and the Lovász Local Lemma. Discret. Math. 167-168: 481-486 (1997) - [j44]Alan M. Frieze, Colin McDiarmid:
Algorithmic theory of random graphs. Random Struct. Algorithms 10(1-2): 5-42 (1997) - [j43]Colin McDiarmid, Theodore Johnson, Harold S. Stone:
On finding a minimum spanning tree in a network with random weights. Random Struct. Algorithms 10(1-2): 187-204 (1997) - 1996
- [j42]Colin McDiarmid, Ryan Hayward:
Large Deviations for Quicksort. J. Algorithms 21(3): 476-507 (1996) - [j41]Colin McDiarmid, Angelika Steger:
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers. J. Comb. Theory A 74(1): 147-152 (1996) - [j40]Noga Alon, Colin McDiarmid, Michael Molloy:
Edge-disjoint cycles in regular directed graphs. J. Graph Theory 22(3): 231-237 (1996) - [j39]Colin McDiarmid:
A random bit-flipping method for seeking agreement. Random Struct. Algorithms 8(2): 121-130 (1996) - 1995
- [j38]Colin McDiarmid, Bruce A. Reed:
Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Comb. Probab. Comput. 4: 257-268 (1995) - [j37]Keith Edwards, Colin McDiarmid:
The Complexity of Harmonious Colouring for Trees. Discret. Appl. Math. 57(2-3): 133-144 (1995) - [j36]Robert Hochberg, Colin McDiarmid, Michael E. Saks:
On the bandwidth of triangulated triangles. Discret. Math. 138(1-3): 261-265 (1995) - 1994
- [j35]Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
Total colouring regular bipartite graphs is NP-hard. Discret. Math. 124(1-3): 155-162 (1994) - [j34]Colin J. H. McDiarmid, Jorge L. Ramírez Alfonsín:
Sharing jugs of wine. Discret. Math. 125(1-3): 279-287 (1994) - [j33]Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Induced Circuits in Planar Graphs. J. Comb. Theory B 60(2): 169-176 (1994) - [j32]Keith Edwards, Colin McDiarmid:
New upper bounds on harmonious colorings. J. Graph Theory 18(3): 257-267 (1994) - 1993
- [j31]Colin McDiarmid:
A Random Recolouring Method for Graphs and Hypergrams. Comb. Probab. Comput. 2: 363-365 (1993) - [j30]Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
An upper bound for total colouring of graphs. Discret. Math. 111(1-3): 389-392 (1993) - [j29]Colin J. H. McDiarmid, Bruce A. Reed:
On Total Colorings of Graphs. J. Comb. Theory B 57(1): 122-130 (1993) - 1992
- [j28]Vasek Chvátal, Colin McDiarmid:
Small transversals in hypergraphs. Comb. 12(1): 19-26 (1992) - [j27]William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid:
On integer points in polyhedra. Comb. 12(1): 27-37 (1992) - [j26]Noga Alon, Colin McDiarmid, Bruce A. Reed:
Star arboricity. Comb. 12(4): 375-380 (1992) - [j25]Colin McDiarmid:
On a Correlation Inequality of Farr. Comb. Probab. Comput. 1: 157-160 (1992) - [j24]Bruce A. Reed, Colin McDiarmid:
The Strongly Connected Components of 1-in, 1-out. Comb. Probab. Comput. 1: 265-274 (1992) - [j23]Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms 3(1): 91-106 (1992) - [c4]Colin McDiarmid, Ryan Hayward:
Strong Concentration for Quicksort. SODA 1992: 414-421 - [c3]Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Non-Interfering Network Flows. SWAT 1992: 245-257 - 1991
- [j22]Colin McDiarmid, Zevi Miller:
Lattice bandwidth of random graphs. Discret. Appl. Math. 30(2-3): 221-227 (1991) - [j21]Ryan Hayward, Colin McDiarmid:
Average Case Analysis of Heap Building by Repeated Insertion. J. Algorithms 12(1): 126-153 (1991) - [j20]Colin McDiarmid, Luo Xinhua:
Upper bounds for harmonious colorings. J. Graph Theory 15(6): 629-636 (1991) - [j19]Colin McDiarmid:
Expected numbers at hitting times. J. Graph Theory 15(6): 637-648 (1991) - [j18]Noga Alon, Colin McDiarmid, Bruce A. Reed:
Acyclic Coloring of Graphs. Random Struct. Algorithms 2(3): 277-288 (1991) - [c2]Colin J. H. McDiarmid, Gregory M. Provan:
An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms. IJCAI 1991: 172-177 - 1990
- [j17]Colin McDiarmid:
On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming. Math. Program. 46: 299-320 (1990) - [j16]Colin McDiarmid:
On the Chromatic Number of Random Graphs. Random Struct. Algorithms 1(4): 435-442 (1990) - [j15]Colin McDiarmid, Bruce A. Reed:
Linear Arboricity of Random Regular Graphs. Random Struct. Algorithms 1(4): 443-447 (1990) - [j14]Alan M. Frieze, Colin McDiarmid, Bruce A. Reed:
Greedy Matching on the Line. SIAM J. Comput. 19(4): 666-672 (1990) - [c1]Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Random Volumes in the n-Cube. Polyhedral Combinatorics 1990: 33-38
1980 – 1989
- 1989
- [j13]Alan M. Frieze, Colin J. H. McDiarmid:
On random minimum lenght spanning trees. Comb. 9(4): 363-374 (1989) - [j12]Colin McDiarmid, Bruce A. Reed:
Building Heaps Fast. J. Algorithms 10(3): 352-365 (1989) - 1988
- [j11]Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed:
Edge-colouring random graphs. J. Comb. Theory B 45(2): 135-149 (1988) - [j10]Colin McDiarmid:
Average-Case Lower Bounds for Searching. SIAM J. Comput. 17(5): 1044-1060 (1988) - 1986
- [j9]Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid:
On linear programs with random costs. Math. Program. 35(1): 3-16 (1986) - [j8]Colin McDiarmid:
On the greedy algorithm with random costs. Math. Program. 36(3): 245-255 (1986) - 1985
- [j7]Colin McDiarmid:
On some conditioning results in the probabilistic analysis of algorithms. Discret. Appl. Math. 10(2): 197-201 (1985) - [j6]Graham Farr, Colin McDiarmid:
The Compexity of Counting Homeomorphs. Theor. Comput. Sci. 36: 345-348 (1985) - 1984
- [j5]Colin McDiarmid:
Colouring random graphs. Ann. Oper. Res. 1(3): 183-200 (1984) - 1983
- [j4]Colin McDiarmid:
On the chromatic forcing number of a random graph. Discret. Appl. Math. 5(1): 123-132 (1983) - [j3]Colin McDiarmid:
Integral decomposition in polyhedra. Math. Program. 25(2): 183-198 (1983)
1970 – 1979
- 1979
- [j2]Colin McDiarmid:
Determining the Chromatic Number of a Graph. SIAM J. Comput. 8(1): 1-14 (1979) - 1978
- [j1]Colin McDiarmid:
Blocking, antiblocking, and pairs of matroids and polymatroids. J. Comb. Theory B 25(3): 313-325 (1978)
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 2025-01-21 00:09 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:
