default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Noy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j93]Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé:
Chordal graphs with bounded tree-width. Adv. Appl. Math. 157: 102700 (2024)- 2023
- [j92]Michael Drmota, Marc Noy, Clément Requilé
, Juanjo Rué:
Random Cubic Planar Maps. Electron. J. Comb. 30(2) (2023) - [j91]Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. Electron. J. Comb. 30(3) (2023) - [j90]Jordi Castellví, Marc Noy, Clément Requilé:
Enumeration of chordal planar graphs and maps. Discret. Math. 346(1): 113163 (2023) - [j89]Marc Noy, Clément Requilé, Juanjo Rué:
Enumeration of labelled 4-regular planar graphs II: Asymptotics. Eur. J. Comb. 110: 103661 (2023) - 2022
- [j88]Michael Drmota, Marc Noy, Guan-Ru Yu:
Universal singular exponents in catalytic variable equations. J. Comb. Theory A 185: 105522 (2022) - [j87]Lázaro Alberto Larrauri, Tobias Müller, Marc Noy:
Limiting probabilities of first order properties of random sparse graphs and hypergraphs. Random Struct. Algorithms 60(3): 506-526 (2022) - [i5]Jordi Castellví, Marc Noy, Clément Requilé:
Enumeration of chordal planar graphs and maps. CoRR abs/2202.13340 (2022) - [i4]Erich Grädel, Phokion G. Kolaitis, Marc Noy:
Logic and Random Discrete Structures (Dagstuhl Seminar 22061). Dagstuhl Reports 12(2): 1-16 (2022) - 2021
- [j86]Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué:
Cycles of given lengths in unicyclic components in sparse random graphs. Adv. Appl. Math. 125: 102162 (2021) - 2020
- [j85]Marc Noy, Clément Requilé, Juanjo Rué:
Further results on random cubic planar graphs. Random Struct. Algorithms 56(3): 892-924 (2020) - [c23]Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. AofA 2020: 10:1-10:18 - [i3]Marc Noy, Clément Requilé, Juanjo Rué:
On the expected number of perfect matchings in cubic planar graphs. CoRR abs/2005.13821 (2020)
2010 – 2019
- 2018
- [j84]Marc Noy, Lander Ramos:
Random Planar Maps and Graphs with Minimum Degree Two and Three. Electron. J. Comb. 25(4): 4 (2018) - [j83]Julien Baste, Marc Noy, Ignasi Sau:
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71: 12-21 (2018) - [j82]Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. Electron. Notes Discret. Math. 68: 71-76 (2018) - [j81]Peter Heinig, Tobias Müller, Marc Noy, Anusch Taraz:
Logical limit laws for minor-closed classes of graphs. J. Comb. Theory B 130: 158-206 (2018) - [j80]Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. Random Struct. Algorithms 53(4): 717-727 (2018) - [c22]Albert Atserias, Stephan Kreutzer, Marc Noy:
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. ICALP 2018: 116:1-116:14 - 2017
- [j79]Ivan Geffner, Marc Noy:
Counting Outerplanar Maps. Electron. J. Comb. 24(2): 2 (2017) - [j78]Marc Noy, Clément Requilé, Juanjo Rué:
Enumeration of labeled 4-regular planar graphs. Electron. Notes Discret. Math. 61: 933-939 (2017) - [c21]Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué:
Isolated cycles of critical random graphs. ANALCO 2017: 46-55 - [c20]Julien Baste, Marc Noy, Ignasi Sau:
On the Number of Labeled Graphs of Bounded Treewidth. WG 2017: 88-99 - 2016
- [j77]Omer Giménez, Dieter Mitsche, Marc Noy:
Maximum degree in minor-closed classes of graphs. Eur. J. Comb. 55: 41-61 (2016) - [j76]Marc Noy, Clément Requilé, Juanjo Rué:
Random cubic planar graphs revisited. Electron. Notes Discret. Math. 54: 211-216 (2016) - [i2]Julien Baste, Marc Noy, Ignasi Sau:
The number of labeled graphs of bounded treewidth. CoRR abs/1604.07273 (2016) - 2015
- [j75]Guillaume Chapuy, Éric Fusy, Omer Giménez, Marc Noy:
On the Diameter of Random Planar Graphs. Comb. Probab. Comput. 24(1): 145-178 (2015) - 2014
- [j74]Michael Drmota, Anna de Mier, Marc Noy:
Extremal statistics on non-crossing configurations. Discret. Math. 327: 103-117 (2014) - [j73]Sergey Kitaev, Anna de Mier, Marc Noy:
On the number of self-dual rooted maps. Eur. J. Comb. 35: 377-387 (2014) - 2013
- [j72]Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. Random Struct. Algorithms 42(4): 438-479 (2013) - [c19]Michael Drmota, Marc Noy:
Extremal Parameters in Sub-Critical Graph Classes. ANALCO 2013: 1-7 - 2012
- [j71]Sergi Elizalde, Marc Noy:
Clusters, generating functions and asymptotics for consecutive patterns in permutations. Adv. Appl. Math. 49(Issues): 351-374 (2012) - [j70]Anna de Mier, Marc Noy:
On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs. Graphs Comb. 28(2): 265-275 (2012) - [c18]Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger:
The maximum degree of random planar graphs. SODA 2012: 281-287 - 2011
- [j69]Michael Drmota, Omer Giménez, Marc Noy:
The Maximum Degree of Series-Parallel Graphs. Comb. Probab. Comput. 20(4): 529-570 (2011) - [j68]Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Comb. Probab. Comput. 20(4): 609-616 (2011) - [j67]Michael Drmota, Marc Noy:
Universal exponents and tail estimates in the enumeration of planar maps. Electron. Notes Discret. Math. 38: 309-317 (2011) - [j66]Andrew J. Goodall, Anna de Mier, Steven D. Noble, Marc Noy:
The Tutte polynomial characterizes simple outerplanar graphs. Electron. Notes Discret. Math. 38: 639-644 (2011) - [j65]Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy:
Asymptotic enumeration and limit laws for graphs of fixed genus. J. Comb. Theory A 118(3): 748-777 (2011) - [j64]Stefan Felsner, Éric Fusy, Marc Noy, David Orden:
Bijections for Baxter families and related objects. J. Comb. Theory A 118(3): 993-1020 (2011) - [j63]Michael Drmota, Omer Giménez, Marc Noy:
Degree distribution in random planar graphs. J. Comb. Theory A 118(7): 2102-2130 (2011) - 2010
- [j62]Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel:
Augmenting the Connectivity of Outerplanar Graphs. Algorithmica 56(2): 160-179 (2010) - [j61]Stefan Felsner, Éric Fusy, Marc Noy:
Asymptotic enumeration of orientations. Discret. Math. Theor. Comput. Sci. 12(2): 249-262 (2010) - [j60]Olivier Bernardi, Marc Noy, Dominic Welsh:
Growth constants of minor-closed classes of graphs. J. Comb. Theory B 100(5): 468-484 (2010) - [j59]Michael Drmota, Omer Giménez, Marc Noy:
Vertices of given degree in series-parallel graphs. Random Struct. Algorithms 36(3): 273-314 (2010)
2000 – 2009
- 2009
- [j58]Clemens Huemer, Ferran Hurtado, Marc Noy, Elsa Omaña-Pulido:
Gray codes for non-crossing partitions and dissections of a convex polygon. Discret. Appl. Math. 157(7): 1509-1520 (2009) - [j57]Josep M. Brunat, António Guedes de Oliveira, Marc Noy:
Partitions of a finite Boolean lattice into intervals. Eur. J. Comb. 30(8): 1801-1809 (2009) - [j56]Anna de Mier, Marc Noy:
On the maximum number of cycles in outerplanar and series-parallel graphs. Electron. Notes Discret. Math. 34: 489-493 (2009) - 2008
- [j55]Marc Noy, Juanjo Rué:
Counting polygon dissections in the projective plane. Adv. Appl. Math. 41(4): 599-619 (2008) - [j54]Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl:
The Number of Graphs Not Containing K3, 3 as a Minor. Electron. J. Comb. 15(1) (2008) - [j53]Rubén Albiol, Marc Noy:
Identities for non-crossing graphs and multigraphs. Discret. Math. 308(23): 5895-5897 (2008) - 2007
- [j52]Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy:
Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007) - [j51]Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: asymptotic counting and critical phenomena. Electron. Notes Discret. Math. 29: 521-529 (2007) - 2006
- [j50]Omer Giménez, Marc Noy:
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. Comb. Probab. Comput. 15(3): 385-395 (2006) - [j49]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154(17): 2470-2483 (2006) - [j48]Omer Giménez, Petr Hlinený, Marc Noy:
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discret. Math. 20(4): 932-946 (2006) - 2005
- [j47]Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs. Comput. Geom. 32(1): 59-69 (2005) - [j46]Anna de Mier, Marc Noy:
Tutte uniqueness of line graphs. Discret. Math. 301(1): 57-65 (2005) - [j45]Anna de Mier, Marc Noy:
On matroids determined by their Tutte polynomials. Discret. Math. 302(1-3): 52-76 (2005) - [j44]Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo:
Graphs of Triangulations and Perfect Matchings. Graphs Comb. 21(3): 325-331 (2005) - [j43]Anna de Mier, Marc Noy:
A solution to the tennis ball problem. Theor. Comput. Sci. 346(2-3): 254-264 (2005) - [c17]Omer Giménez, Petr Hlinený, Marc Noy:
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68 - 2004
- [j42]Joseph P. S. Kung, Marc Noy, Dominic Welsh:
Special issue on the Tutte polynomial. Adv. Appl. Math. 32(1-2): 1-2 (2004) - [j41]Marc Noy, Ares Ribó:
Recursively constructible families of graphs. Adv. Appl. Math. 32(1-2): 350-363 (2004) - [j40]Ferran Hurtado, Marc Noy, J.-M. Robert, Vera Sacristán, Steven Skiena:
Visualizing Objects with Mirrors. Comput. Graph. Forum 23(2): 157-166 (2004) - [j39]Oswin Aichholzer, Ferran Hurtado, Marc Noy:
A lower bound on the number of triangulations of planar point sets. Comput. Geom. 29(2): 135-145 (2004) - [j38]Anna de Mier, Marc Noy:
On Graphs Determined by Their Tutte Polynomials. Graphs Comb. 20(1): 105-119 (2004) - 2003
- [j37]Sergi Elizalde, Marc Noy:
Consecutive patterns in permutations. Adv. Appl. Math. 30(1-2): 110-125 (2003) - [j36]Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy:
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electron. J. Comb. 10 (2003) - [j35]Alberto Márquez, Anna de Mier, Marc Noy, Maria Pastora Revuelta Marchena:
Locally grid graphs: classification and Tutte uniqueness. Discret. Math. 266(1-3): 327-352 (2003) - [j34]Jaroslav Nesetril, Marc Noy, Oriol Serra:
Foreword. Discret. Math. 273(1-3): 1-6 (2003) - [j33]Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia:
Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geom. Appl. 13(2): 113-133 (2003) - [j32]Joseph E. Bonin, Anna de Mier, Marc Noy:
Lattice path matroids: enumerative aspects and Tutte polynomials. J. Comb. Theory A 104(1): 63-94 (2003) - [j31]Marc Noy:
Graphs determined by polynomial invariants. Theor. Comput. Sci. 307(2): 365-384 (2003) - 2002
- [j30]Robert Cori, Marc Noy:
Foreword. Discret. Math. 246(1-3): 1- (2002) - [j29]Emeric Deutsch, Marc Noy:
Statistics on non-crossing trees. Discret. Math. 254(1-3): 75-87 (2002) - [j28]Emeric Deutsch, Svjetlan Feretic, Marc Noy:
Diagonally convex directed polyominoes and even trees: a bijection and related issues. Discret. Math. 256(3): 645-654 (2002) - [j27]M. Carmen Hernando, Ferran Hurtado, Marc Noy:
Graphs of Non-Crossing Perfect Matchings. Graphs Comb. 18(3): 517-532 (2002) - [j26]Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel:
On the minimum size of visibility graphs. Inf. Process. Lett. 81(4): 223-230 (2002) - [j25]Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Márquez, Marc Noy:
Triangle-Free Planar Graphs and Segment Intersection Graphs. J. Graph Algorithms Appl. 6(1): 7-26 (2002) - [j24]Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel:
Packing trees into planar graphs. J. Graph Theory 40(3): 172-181 (2002) - [i1]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. CoRR cs.CG/0210003 (2002) - 2001
- [j23]Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy:
Foreword. Discret. Appl. Math. 109(1-2): 1 (2001) - [j22]Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara:
Separating objects in the plane by wedges and strips. Discret. Appl. Math. 109(1-2): 109-138 (2001) - [j21]Ferran Hurtado, Marc Noy:
On the number of visibility graphs of simple polygons. Discret. Math. 232(1-3): 139-143 (2001) - [j20]Jaroslav Nesetril, Marc Noy, Oriol Serra:
Preface: Volume 10. Electron. Notes Discret. Math. 10: 1 (2001) - [j19]Criel Merino, Anna de Mier, Marc Noy:
Irreducibility of the Tutte Polynomial of a Connected Matroid. J. Comb. Theory B 83(2): 298-304 (2001) - [j18]Marc Noy:
Acyclic and Totally Cyclic Orientations in Planar Graphs. Am. Math. Mon. 108(1): 66-68 (2001) - [c16]Oswin Aichholzer, Ferran Hurtado, Marc Noy:
On the number of triangulations every planar point set must have. CCCG 2001: 13-16 - [c15]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. WADS 2001: 192-204 - 2000
- [j17]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl:
A class of point-sets with few k-sets. Comput. Geom. 16(2): 95-101 (2000) - [j16]Alfredo García Olaverri, Marc Noy, Javier Tejel:
Lower bounds on the number of crossing-free subgraphs of KN. Comput. Geom. 16(4): 211-221 (2000) - [j15]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. Comput. Geom. 16(4): 235-243 (2000) - [j14]Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia:
On the chromatic number of tree graphs. Discret. Math. 223(1-3): 363-366 (2000) - [c14]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. SODA 2000: 155-164
1990 – 1999
- 1999
- [j13]Ferran Hurtado, Marc Noy:
Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. 13(3): 179-188 (1999) - [j12]Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon. Discret. Appl. Math. 91(1-3): 67-82 (1999) - [j11]M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric Tree Graphs of Points in Convex Position. Discret. Appl. Math. 93(1): 51-66 (1999) - [j10]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
Bipartite Embeddings of Trees in the Plane. Discret. Appl. Math. 93(2-3): 141-148 (1999) - [j9]Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger:
Properties of Random Triangulations and Trees. Discret. Comput. Geom. 22(1): 105-117 (1999) - [j8]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. Discret. Comput. Geom. 22(3): 333-346 (1999) - [j7]Philippe Flajolet, Marc Noy:
Analytic combinatorics of non-crossing configurations. Discret. Math. 204(1-3): 203-229 (1999) - [j6]Chính T. Hoàng, Frédéric Maffray, Marc Noy:
A characterization of P4-indifference graphs. J. Graph Theory 31(3): 155-162 (1999) - [c13]Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Márquez, Marc Noy:
Triangle-Free Planar Graphs as Segments Intersection Graphs. GD 1999: 341-358 - 1998
- [j5]Marc Noy:
Enumeration of noncrossing trees on a circle. Discret. Math. 180(1-3): 301-313 (1998) - [c12]M. Carmen Hernando, Ferran Hurtado, Alberto Márquez, Mercè Mora, Marc Noy:
Geometric tree graphs of points in the plane. CCCG 1998 - [c11]Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara:
Separating objects in the plane with wedges and strips. CCCG 1998 - [c10]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Parallel edge flipping. CCCG 1998 - [c9]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy:
Point-Sets with few k-Sets. SCG 1998: 200-205 - 1997
- [j4]Ferran Hurtado, Marc Noy:
Counting triangulations of almost-convex polygons. Ars Comb. 45 (1997) - [j3]Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations. Discret. Appl. Math. 75(1): 71-80 (1997) - [c8]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. CCCG 1997 - [c7]Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel:
Packing Trees into Planar Graphs. GD 1997: 383-390 - 1996
- [j2]Ferran Hurtado, Marc Noy:
Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon. Comput. Geom. 6: 355-369 (1996) - [j1]Ferran Hurtado, Marc Noy:
Ears of triangulations and Catalan numbers. Discret. Math. 149(1-3): 319-324 (1996) - [c6]Hazel Everett, Ferran Hurtado, Marc Noy:
Stabbing Information of a Simple Polygon. CCCG 1996: 74-79 - [c5]Ferran Hurtado, Marc Noy, Jorge Urrutia:
Flipping Edges in Triangulations. SCG 1996: 214-223 - [c4]Ferran Hurtado, Marc Noy:
The Graph of Triangulations of a Convex Polygon. SCG 1996: C-7-C-8 - [c3]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos:
Bipartite Embeddings of Trees in the Plane. GD 1996: 1-10 - 1995
- [c2]Alfredo García Olaverri, Marc Noy, Javier Tejel:
Lower bounds for the number noncrossing free subgraphs of Kn. CCCG 1995: 97-102 - [c1]Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231
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:11 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:
