default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Micek
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
[j49]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024)- [j48]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. 31(2) (2024) - [j47]Vida Dujmovic, Robert Hickingbotham
, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - [j46]Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. J. Comb. Theory B 165: 164-196 (2024) - [j45]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - [c15]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - [c14]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and Dimension. SODA 2024: 1437-1446 - [i45]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. CoRR abs/2403.06370 (2024) - [i44]John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed:
Vertex Ranking of Degenerate Graphs. CoRR abs/2404.16340 (2024) - [i43]Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud:
Quickly excluding an apex-forest. CoRR abs/2404.17306 (2024) - [i42]Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud:
Weak coloring numbers of minor-closed graph classes. CoRR abs/2407.04588 (2024) - [i41]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Planar graphs in blowups of fans. CoRR abs/2407.05936 (2024) - 2023
- [j44]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [j43]Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan:
Colouring bottomless rectangles and arborescences. Comput. Geom. 115: 102020 (2023) - [i40]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - [i39]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i38]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i37]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and dimension. CoRR abs/2308.11950 (2023) - 2022
- [j42]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a Ladder. Comb. 42(3): 405-432 (2022) - [j41]Gwenaël Joret, Piotr Micek:
Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. 29(1) (2022) - [i36]Piotr Micek, Heather C. Smith Blake, William T. Trotter:
Boolean dimension and dim-boundedness: Planar cover graph with a zero. CoRR abs/2206.06942 (2022) - [i35]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - 2021
- [j40]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j39]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [j38]Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn:
Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. 35(1): 447-464 (2021) - [c13]Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek:
Reconfiguring Independent Sets on Interval Graphs. MFCS 2021: 23:1-23:14 - 2020
- [j37]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean Dimension and Tree-Width. Comb. 40(5): 655-677 (2020) - [j36]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40(6): 839-868 (2020) - [j35]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [j34]Tamás Mészáros, Piotr Micek, William T. Trotter:
Boolean Dimension, Components and Blocks. Order 37(2): 287-298 (2020) - [c12]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [c11]Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder:
Improved bounds for centered colorings. SODA 2020: 2212-2226 - [i34]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a ladder. CoRR abs/2002.00496 (2020) - [i33]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i32]Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine:
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR abs/2004.07214 (2020) - [i31]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020)
2010 – 2019
- 2019
- [j33]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. Comb. 39(5): 1055-1079 (2019) - [j32]Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran:
A note on the minimum number of edges in hypergraphs with property O. Eur. J. Comb. 81: 172-177 (2019) - [j31]Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. J. Comb. Theory B 138: 206-218 (2019) - [c10]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [i30]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - [i29]Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. CoRR abs/1907.00380 (2019) - 2018
- [j30]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and Dimension. Comb. 38(5): 1129-1148 (2018) - [j29]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. 25(1): 1 (2018) - [j28]Grzegorz Guspiel, Piotr Micek, Adam Polak:
On an Extremal Problem for Poset Dimension. Order 35(3): 489-493 (2018) - [c9]Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The Queue-Number of Posets of Bounded Width or Height. GD 2018: 200-212 - [i28]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR abs/1801.01833 (2018) - [i27]Kolja Knauer, Piotr Micek, Torsten Ueckerdt:
The queue-number of planar posets. CoRR abs/1806.04489 (2018) - 2017
- [j27]Piotr Micek, Veit Wiechert:
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. Algorithmica 77(4): 1060-1070 (2017) - [j26]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. 61: 415-420 (2017) - [j25]Adam Gagol, Piotr Micek, Bartosz Walczak:
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory 85(1): 22-50 (2017) - [j24]Piotr Micek, Veit Wiechert:
Topological Minors of Cover Graphs and Dimension. J. Graph Theory 86(3): 295-314 (2017) - [j23]Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert:
On the Dimension of Posets with Cover Graphs of Treewidth 2. Order 34(2): 185-234 (2017) - [j22]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. 31(4): 2754-2790 (2017) - [i26]Grzegorz Guspiel, Piotr Micek, Adam Polak:
On an extremal problem for poset dimension. CoRR abs/1705.00176 (2017) - [i25]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean dimension and tree-width. CoRR abs/1707.06114 (2017) - [i24]Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. CoRR abs/1708.05424 (2017) - 2016
- [j21]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - [j20]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23(4): 4 (2016) - [j19]Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert:
A Note on Concurrent Graph Sharing Games. Integers 16: G1 (2016) - [c8]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. SODA 2016: 1804-1813 - [i23]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and nonrepetitive list coloring. CoRR abs/1601.01886 (2016) - [i22]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar posets have dimension at most linear in their height. CoRR abs/1612.07540 (2016) - 2015
- [c7]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line Coloring between Two Lines. SoCG 2015: 630-641 - [i21]Piotr Micek, Veit Wiechert:
An on-line competitive algorithm for coloring bipartite graphs without long induced paths. CoRR abs/1502.00859 (2015) - [i20]Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and dimension. CoRR abs/1507.01120 (2015) - 2014
- [j18]Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar graph drawings with few slopes. Comput. Geom. 47(5): 614-624 (2014) - [j17]Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak:
Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. 52(2): 399-415 (2014) - [j16]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36: 110-121 (2014) - [j15]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B 105: 6-10 (2014) - [j14]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. J. Comb. Theory A 128: 41-55 (2014) - [j13]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. 28(4): 1948-1959 (2014) - [c6]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower Bounds for On-line Graph Colorings. ISAAC 2014: 507-515 - [c5]Piotr Micek, Veit Wiechert:
An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. ISAAC 2014: 516-527 - [c4]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. SODA 2014: 1424-1432 - [i19]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower bounds for on-line graph colorings. CoRR abs/1404.7259 (2014) - [i18]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line coloring between two lines. CoRR abs/1411.0402 (2014) - [i17]Adam Gagol, Piotr Micek, Bartosz Walczak:
Graph sharing game and the structure of weighted graphs with forbidden subdivision. CoRR abs/1411.6727 (2014) - 2013
- [j12]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [j11]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. J. Comput. Geom. 4(1): 240-246 (2013) - [j10]Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek:
On-line Chain Partitions of Up-growing Semi-orders. Order 30(1): 85-101 (2013) - [j9]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-Line Dimension of Semi-Orders. Order 30(2): 593-615 (2013) - [j8]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
New approach to nonrepetitive sequences. Random Struct. Algorithms 42(2): 214-225 (2013) - [j7]Jakub Kozik, Piotr Micek:
Nonrepetitive Choice Number of Trees. SIAM J. Discret. Math. 27(1): 436-446 (2013) - [c3]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i16]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013) - [i15]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - [i14]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Octants Colorful and Related Covering Decomposition Problems. CoRR abs/1307.2705 (2013) - [i13]Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak:
Coloring intersection graphs of arc-connected sets in the plane. CoRR abs/1310.7558 (2013) - [i12]Piotr Micek, Rom Pinchasi:
On the number of edges in families of pseudo-discs. CoRR abs/1312.1678 (2013) - 2012
- [j6]Piotr Micek, Bartosz Walczak:
Parity in graph sharing games. Discret. Math. 312(10): 1788-1795 (2012) - [j5]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-line version of Rabinovitch theorem for proper intervals. Discret. Math. 312(23): 3426-3436 (2012) - [j4]Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek:
On-Line Chain Partitions of Orders: A Survey. Order 29(1): 49-73 (2012) - [c2]Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar Graph Drawings with Few Slopes. COCOON 2012: 323-334 - [i11]Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak:
An extremal problem on crossing vectors. CoRR abs/1205.1824 (2012) - [i10]Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar graph drawings with few slopes. CoRR abs/1205.2548 (2012) - [i9]Jakub Kozik, Piotr Micek:
Nonrepetitive choice number of trees. CoRR abs/1207.5155 (2012) - [i8]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i7]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012) - [i6]Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. CoRR abs/1212.2346 (2012) - 2011
- [j3]Piotr Micek, Bartosz Walczak:
A Graph-Grabbing Game. Comb. Probab. Comput. 20(4): 623-629 (2011) - [j2]Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
How to eat 4/9 of a pizza. Discret. Math. 311(16): 1635-1645 (2011) - [i5]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
A new approach to nonrepetitive sequences. CoRR abs/1103.3809 (2011) - [i4]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
Nonrepetitive games. CoRR abs/1103.3810 (2011) - [i3]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards on-line Ohba's conjecture. CoRR abs/1111.5458 (2011)
2000 – 2009
- 2008
- [i2]Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
How to eat 4/9 of a pizza. CoRR abs/0812.2870 (2008) - 2007
- [j1]Patrick Baier, Bartlomiej Bosek, Piotr Micek:
On-line Chain Partitioning of Up-growing Interval Orders. Order 24(1): 1-13 (2007) - [i1]Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek:
On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders. CoRR abs/0704.1829 (2007) - 2004
- [c1]Bartlomiej Bosek, Piotr Micek:
Variants of Online Chain Partition Problem of Posets. CLA 2004: 3-13
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-08-25 20:08 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:
