Piotr Micek

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 63

Top Venues

Publications

Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Weak coloring numbers of minor-closed graph classes. CoRR (2024)
John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
Vertex Ranking of Degenerate Graphs. CoRR (2024)
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)
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) (2024)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
Planar graphs in blowups of fans. CoRR (2024)
Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
Cliquewidth and Dimension. SODA (2024)
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs. J. Comb. Theory, Ser. B 165 (2024)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
Tight bound for the Erdős-Pósa property of tree minors. CoRR (2024)
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)
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Quickly excluding an apex-forest. CoRR (2024)
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) (2024)
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) (2024)
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
Treedepth vs Circumference. Comb. 43 (4) (2023)
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 (2023)
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 (2023)
Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The Excluded Tree Minor Theorem Revisited. CoRR (2023)
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 (2023)
Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
Cliquewidth and dimension. CoRR (2023)
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
Treedepth vs circumference. CoRR (2022)
Gwenaël Joret, Piotr Micek
Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. 29 (1) (2022)
Piotr Micek, Heather C. Smith Blake, William T. Trotter
Boolean dimension and dim-boundedness: Planar cover graph with a zero. CoRR (2022)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a Ladder. Comb. 42 (3) (2022)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68 (6) (2021)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28 (3) (2021)
Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek
Reconfiguring Independent Sets on Interval Graphs. MFCS (2021)
Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn
Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean Dimension and Tree-Width. Comb. 40 (5) (2020)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40 (6) (2020)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). FOCS (2020)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs Have Bounded Queue-Number. J. ACM 67 (4) (2020)
Tamás Mészáros, Piotr Micek, William T. Trotter
Boolean Dimension, Components and Blocks. Order 37 (2) (2020)
Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). CoRR (2020)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a ladder. CoRR (2020)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
Tight Bounds on The Clique Chromatic Number. CoRR (2020)
Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings. SODA (2020)
Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR (2020)
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs. CoRR (2019)
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, Ser. B 138 (2019)
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere Dense Graph Classes and Dimension. Comb. 39 (5) (2019)
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 (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. CoRR (2019)
Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number. FOCS (2019)
Grzegorz Guspiel, Piotr Micek, Adam Polak
On an Extremal Problem for Poset Dimension. Order 35 (3) (2018)
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and Dimension. Comb. 38 (5) (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The Queue-Number of Posets of Bounded Width or Height. Graph Drawing (2018)
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) (2018)
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The queue-number of planar posets. CoRR (2018)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR (2018)
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) (2017)
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. Algorithmica 77 (4) (2017)
Piotr Micek, Veit Wiechert
Topological Minors of Cover Graphs and Dimension. J. Graph Theory 86 (3) (2017)
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere Dense Graph Classes and Dimension. CoRR (2017)
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 (2017)
Adam Gagol, Piotr Micek, Bartosz Walczak
Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory 85 (1) (2017)
Gwenaël Joret, Piotr Micek, Veit Wiechert
Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. 31 (4) (2017)
Grzegorz Guspiel, Piotr Micek, Adam Polak
On an extremal problem for poset dimension. CoRR (2017)
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean dimension and tree-width. CoRR (2017)
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension. SODA (2016)
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension. Comb. 36 (4) (2016)
Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23 (4) (2016)
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A Note on Concurrent Graph Sharing Games. Integers 16 (2016)
Gwenaël Joret, Piotr Micek, Veit Wiechert
Planar posets have dimension at most linear in their height. CoRR (2016)
Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and nonrepetitive list coloring. CoRR (2016)
Piotr Micek, Veit Wiechert
An on-line competitive algorithm for coloring bipartite graphs without long induced paths. CoRR (2015)
Stefan Felsner, Piotr Micek, Torsten Ueckerdt
On-line Coloring between Two Lines. SoCG (2015)
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension. CoRR (2015)
Stefan Felsner, Piotr Micek, Torsten Ueckerdt
On-line coloring between two lines. CoRR (2014)
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. 28 (4) (2014)
Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. 52 (2) (2014)
Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
Lower Bounds for On-line Graph Colorings. ISAAC (2014)
Adam Gagol, Piotr Micek, Bartosz Walczak
Graph sharing game and the structure of weighted graphs with forbidden subdivision. CoRR (2014)
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36 (2014)
Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
An extremal problem on crossing vectors. J. Comb. Theory, Ser. A 128 (2014)
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, Ser. B 105 (2014)
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
Making Octants Colorful and Related Covering Decomposition Problems. SODA (2014)
Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
Lower bounds for on-line graph colorings. CoRR (2014)
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. ISAAC (2014)
Kolja B. Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes. Comput. Geom. 47 (5) (2014)
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
Making Triangles Colorful. J. Comput. Geom. 4 (1) (2013)
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
On-line Chain Partitions of Up-growing Semi-orders. Order 30 (1) (2013)
Jakub Kozik, Piotr Micek
Nonrepetitive Choice Number of Trees. SIAM J. Discret. Math. 27 (1) (2013)
Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-Line Dimension of Semi-Orders. Order 30 (2) (2013)
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 (2013)
Piotr Micek, Rom Pinchasi
On the number of edges in families of pseudo-discs. CoRR (2013)
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)
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences. Random Struct. Algorithms 42 (2) (2013)
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-Width and Dimension CoRR (2013)
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) (2013)
Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
Coloring intersection graphs of arc-connected sets in the plane. CoRR (2013)
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
Making Octants Colorful and Related Covering Decomposition Problems. CoRR (2013)
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 (2012)
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
Making Triangles Colorful CoRR (2012)
Jakub Kozik, Piotr Micek
Nonrepetitive choice number of trees CoRR (2012)
Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
An extremal problem on crossing vectors CoRR (2012)
Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-line version of Rabinovitch theorem for proper intervals. Discret. Math. 312 (23) (2012)
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 (2012)
Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek
On-Line Chain Partitions of Orders: A Survey. Order 29 (1) (2012)
Kolja B. Knauer, Piotr Micek, Bartosz Walczak
Outerplanar Graph Drawings with Few Slopes. COCOON (2012)
Kolja B. Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes CoRR (2012)
Piotr Micek, Bartosz Walczak
Parity in graph sharing games. Discret. Math. 312 (10) (2012)

Piotr Micek.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Piotr Micek