Piotr Micek

465 total citations
41 papers, 152 citations indexed

About

Piotr Micek is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Piotr Micek has authored 41 papers receiving a total of 152 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 16 papers in Discrete Mathematics and Combinatorics and 11 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Piotr Micek's work include Advanced Graph Theory Research (33 papers), Limits and Structures in Graph Theory (16 papers) and Computational Geometry and Mesh Generation (11 papers). Piotr Micek is often cited by papers focused on Advanced Graph Theory Research (33 papers), Limits and Structures in Graph Theory (16 papers) and Computational Geometry and Mesh Generation (11 papers). Piotr Micek collaborates with scholars based in Poland, Germany and Belgium. Piotr Micek's co-authors include Bartosz Walczak, Gwenaël Joret, Stefan Felsner, Torsten Ueckerdt, Vida Dujmović, Pat Morin, Kolja Knauer, William T. Trotter, Xuding Zhu and Cyril Gavoille and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Piotr Micek

35 papers receiving 145 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Piotr Micek Poland 8 137 54 35 25 25 41 152
Bartosz Walczak Poland 7 87 0.6× 42 0.8× 27 0.8× 9 0.4× 15 0.6× 27 110
Sebastian Siebertz Germany 9 206 1.5× 62 1.1× 22 0.6× 44 1.8× 31 1.2× 38 224
Robert Cowen United States 6 191 1.4× 68 1.3× 37 1.1× 43 1.7× 20 0.8× 23 220
John Gimbel United States 9 242 1.8× 86 1.6× 33 0.9× 18 0.7× 8 0.3× 30 266
Jérémie Chalopin France 8 92 0.7× 24 0.4× 18 0.5× 30 1.2× 19 0.8× 31 134
Cláudia Linhares Sales Brazil 8 194 1.4× 97 1.8× 8 0.2× 25 1.0× 11 0.4× 33 219
Rudini Sampaio Brazil 8 155 1.1× 84 1.6× 6 0.2× 27 1.1× 31 1.2× 49 198
Shai Gutner Israel 6 111 0.8× 23 0.4× 14 0.4× 44 1.8× 10 0.4× 10 130
David Erwin United States 9 198 1.4× 28 0.5× 9 0.3× 32 1.3× 9 0.4× 16 218
Édouard Bonnet France 6 62 0.5× 19 0.4× 10 0.3× 15 0.6× 15 0.6× 27 82

Countries citing papers authored by Piotr Micek

Since Specialization
Citations

This map shows the geographic impact of Piotr Micek's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Piotr Micek with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Piotr Micek more than expected).

Fields of papers citing papers by Piotr Micek

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Piotr Micek. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Piotr Micek. The network helps show where Piotr Micek may publish in the future.

Co-authorship network of co-authors of Piotr Micek

This figure shows the co-authorship network connecting the top 25 collaborators of Piotr Micek. A scholar is included among the top collaborators of Piotr Micek based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Piotr Micek. Piotr Micek is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dujmović, Vida, David Eppstein, Gwenaël Joret, et al.. (2024). Product Structure Extension of the Alon–Seymour–Thomas Theorem. SIAM Journal on Discrete Mathematics. 38(3). 2095–2107. 1 indexed citations
2.
Dujmović, Vida, Gwenaël Joret, Piotr Micek, & Pat Morin. (2024). Tight bound for the Erdős–Pósa property of tree minors. Combinatorics Probability Computing. 34(2). 321–325.
3.
Dujmović, Vida, Gwenaël Joret, Piotr Micek, Pat Morin, & David R. Wood. (2024). Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. The Electronic Journal of Combinatorics. 31(2).
4.
Dujmović, Vida, et al.. (2023). The Excluded Tree Minor Theorem Revisited. Combinatorics Probability Computing. 33(1). 85–90. 1 indexed citations
5.
Joret, Gwenaël, et al.. (2023). Treedepth vs Circumference. COMBINATORICA. 43(4). 659–664. 1 indexed citations
6.
Micek, Piotr, et al.. (2023). Dimension is polynomial in height for posets with planar cover graphs. Journal of Combinatorial Theory Series B. 165. 164–196.
7.
Cardinal, Jean, et al.. (2023). Colouring bottomless rectangles and arborescences. Computational Geometry. 115. 102020–102020.
8.
Micek, Piotr, et al.. (2021). Improved Bounds for Centered Colorings. arXiv (Cornell University). 14 indexed citations
9.
Dujmović, Vida, Louis Esperet, Cyril Gavoille, et al.. (2020). Adjacency Labelling for Planar Graphs (and Beyond). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 577–588. 16 indexed citations
10.
Micek, Piotr, et al.. (2017). On an Extremal Problem for Poset Dimension. Order. 35(3). 489–493. 2 indexed citations
11.
Felsner, Stefan, et al.. (2017). Burling graphs, chromatic number, and orthogonal tree-decompositions. Electronic Notes in Discrete Mathematics. 61. 415–420.
12.
Joret, Gwenaël, et al.. (2017). Planar Posets Have Dimension at Most Linear in Their Height. SIAM Journal on Discrete Mathematics. 31(4). 2754–2790. 3 indexed citations
13.
Micek, Piotr, et al.. (2014). An extremal problem on crossing vectors. Journal of Combinatorial Theory Series A. 128. 41–55. 1 indexed citations
14.
Micek, Piotr, et al.. (2013). Towards an on-line version of Ohba’s conjecture. European Journal of Combinatorics. 36. 110–121. 9 indexed citations
15.
Micek, Piotr, et al.. (2013). Nonrepetitive Choice Number of Trees. SIAM Journal on Discrete Mathematics. 27(1). 436–446. 3 indexed citations
16.
Cardinal, Jean, Kolja Knauer, Piotr Micek, & Torsten Ueckerdt. (2013). Making Octants Colorful and Related Covering Decomposition Problems. arXiv (Cornell University). 1424–1432. 3 indexed citations
17.
Micek, Piotr, et al.. (2012). On-line version of Rabinovitch theorem for proper intervals. Discrete Mathematics. 312(23). 3426–3436. 3 indexed citations
18.
Micek, Piotr & Bartosz Walczak. (2012). Parity in graph sharing games. Discrete Mathematics. 312(10). 1788–1795. 3 indexed citations
19.
Felsner, Stefan, et al.. (2011). On-line Chain Partitions of Up-growing Semi-orders. Order. 30(1). 85–101. 3 indexed citations
20.
Knauer, Kolja, Piotr Micek, & Torsten Ueckerdt. (2011). How to eat 4/9 of a pizza. Discrete Mathematics. 311(16). 1635–1645. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026