Piotr Micek - RankMe

125 papers A* 11A 1B 4Misc 1Journal 107Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Centered colorings and weak coloring numbers in minor-closed graph classes. CoRR Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2026	A*	`conf`	Centered colorings in minor-closed graph classes. SODA Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2026	J	`jnl`	Cops and robber in graphs with bounded vertex cover number. CoRR Prosenjit Bose, Louis Esperet, Jedrzej Hodor, Gwenaël Joret, Piotr Micek, Clément Rambaud
2026	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. Discret. Math. Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2026	J	`jnl`	Note on the treewidth of graphs excluding a disjoint union of cycles as a minor. CoRR Gwenaël Joret, Piotr Micek
2026	J	`jnl`	Quickly Excluding an Apex-Forest. SIAM J. Discret. Math. Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2026	J	`jnl`	Tree decompositions whose trees are subgraphs: An application of Simon's factorization. CoRR Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk
2025	J	`jnl`	Boolean Dimension of a Boolean Lattice. Order Marcin Brianski, Jedrzej Hodor, Hoang La, Piotr Micek, Katzper Michno
2025	J	`jnl`	Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. ACM Trans. Algorithms Alina Ene, Troy Lee, Piotr Micek, Sushant Sachdeva
2025	A*	`conf`	Planar Graphs in Blowups of Fans. SODA Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2025	J	`jnl`	Shallow brambles. Discret. Math. Theor. Comput. Sci. Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek
2025	J	`jnl`	The Grid-Minor Theorem Revisited. Comb. Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2025	J	`jnl`	Tight bound for the Erdős-Pósa property of tree minors. Comb. Probab. Comput. Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2025	A*	`conf`	Weak coloring numbers of minor-closed graph classes. SODA Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2024	J	`jnl`	Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	J	`jnl`	Centered colorings in minor-closed graph classes. CoRR Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2024	A*	`conf`	Cliquewidth and Dimension. SODA Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2024	J	`jnl`	Dimension is polynomial in height for posets with planar cover graphs. J. Comb. Theory B Jakub Kozik, Piotr Micek, William T. Trotter
2024	J	`jnl`	Erdős-Pósa property of cycles that are far apart. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2024	J	`jnl`	Planar graphs in blowups of fans. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	J	`jnl`	Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood
2024	J	`jnl`	Quickly excluding an apex-forest. CoRR Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2024	J	`jnl`	The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2024	A*	`conf`	The Grid-Minor Theorem Revisited. SODA Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2024	J	`jnl`	Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2024	J	`jnl`	Tight bound for the Erdős-Pósa property of tree minors. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin
2024	J	`jnl`	Vertex Ranking of Degenerate Graphs. CoRR John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
2024	J	`jnl`	Weak coloring numbers of minor-closed graph classes. CoRR Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2023	J	`jnl`	Cliquewidth and dimension. CoRR Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
2023	J	`jnl`	Colouring bottomless rectangles and arborescences. Comput. Geom. Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
2023	J	`jnl`	The Excluded Tree Minor Theorem Revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2023	J	`jnl`	The grid-minor theorem revisited. CoRR Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2023	J	`jnl`	Tight bound on treedepth in terms of pathwidth and longest path. CoRR Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2023	J	`jnl`	Treedepth vs Circumference. Comb. Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2022	J	`jnl`	Boolean dimension and dim-boundedness: Planar cover graph with a zero. CoRR Piotr Micek, Heather C. Smith Blake, William T. Trotter
2022	J	`jnl`	Excluding a Ladder. Comb. Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
2022	J	`jnl`	Improved Bounds for Weak Coloring Numbers. Electron. J. Comb. Gwenaël Joret, Piotr Micek
2022	J	`jnl`	Treedepth vs circumference. CoRR Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
2021	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). J. ACM Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2021	J	`jnl`	Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn
2021	B	`conf`	Reconfiguring Independent Sets on Interval Graphs. MFCS Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek
2021	J	`jnl`	Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
2020	A*	`conf`	Adjacency Labelling for Planar Graphs (and Beyond). FOCS Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2020	J	`jnl`	Adjacency Labelling for Planar Graphs (and Beyond). CoRR Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
2020	J	`jnl`	Boolean Dimension and Tree-Width. Comb. Stefan Felsner, Tamás Mészáros, Piotr Micek
2020	J	`jnl`	Boolean Dimension, Components and Blocks. Order Tamás Mészáros, Piotr Micek, William T. Trotter
2020	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2020	J	`jnl`	Excluding a ladder. CoRR Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
2020	A*	`conf`	Improved bounds for centered colorings. SODA Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder
2020	J	`jnl`	Planar Graphs Have Bounded Queue-Number. J. ACM Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2020	J	`jnl`	Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2020	J	`jnl`	Tight Bounds on The Clique Chromatic Number. CoRR Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid
2019	J	`jnl`	A note on the minimum number of edges in hypergraphs with property O. Eur. J. Comb. Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran
2019	J	`jnl`	Dimension is polynomial in height for posets with planar cover graphs. CoRR Jakub Kozik, Piotr Micek, William T. Trotter
2019	J	`jnl`	Nowhere Dense Graph Classes and Dimension. Comb. Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
2019	A*	`conf`	Planar Graphs have Bounded Queue-Number. FOCS Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Planar Graphs have Bounded Queue-Number. CoRR Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
2019	J	`jnl`	Separating tree-chromatic number from path-chromatic number. J. Comb. Theory B Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter
2018	J	`jnl`	Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
2018	J	`jnl`	On an Extremal Problem for Poset Dimension. Order Grzegorz Guspiel, Piotr Micek, Adam Polak
2018	J	`jnl`	Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
2018	J	`jnl`	Sparsity and Dimension. Comb. Gwenaël Joret, Piotr Micek, Veit Wiechert
2018	A	`conf`	The Queue-Number of Posets of Bounded Width or Height. GD Kolja Knauer, Piotr Micek, Torsten Ueckerdt
2018	J	`jnl`	The queue-number of planar posets. CoRR Kolja Knauer, Piotr Micek, Torsten Ueckerdt
2017	J	`jnl`	An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. Algorithmica Piotr Micek, Veit Wiechert
2017	J	`jnl`	Boolean dimension and tree-width. CoRR Stefan Felsner, Tamás Mészáros, Piotr Micek
2017	J	`jnl`	Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
2017	J	`jnl`	Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. J. Graph Theory Adam Gagol, Piotr Micek, Bartosz Walczak
2017	J	`jnl`	Nowhere Dense Graph Classes and Dimension. CoRR Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
2017	J	`jnl`	On an extremal problem for poset dimension. CoRR Grzegorz Guspiel, Piotr Micek, Adam Polak
2017	J	`jnl`	On the Dimension of Posets with Cover Graphs of Treewidth 2. Order Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
2017	J	`jnl`	Planar Posets Have Dimension at Most Linear in Their Height. SIAM J. Discret. Math. Gwenaël Joret, Piotr Micek, Veit Wiechert
2017	J	`jnl`	Topological Minors of Cover Graphs and Dimension. J. Graph Theory Piotr Micek, Veit Wiechert
2016	J	`jnl`	A Note on Concurrent Graph Sharing Games. Integers Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
2016	J	`jnl`	Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
2016	J	`jnl`	Pathwidth and nonrepetitive list coloring. CoRR Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
2016	J	`jnl`	Planar posets have dimension at most linear in their height. CoRR Gwenaël Joret, Piotr Micek, Veit Wiechert
2016	A*	`conf`	Sparsity and dimension. SODA Gwenaël Joret, Piotr Micek, Veit Wiechert
2016	J	`jnl`	Tree-width and dimension. Comb. Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2015	J	`jnl`	An on-line competitive algorithm for coloring bipartite graphs without long induced paths. CoRR Piotr Micek, Veit Wiechert
2015	A*	`conf`	On-line Coloring between Two Lines. SoCG Stefan Felsner, Piotr Micek, Torsten Ueckerdt
2015	J	`jnl`	Sparsity and dimension. CoRR Gwenaël Joret, Piotr Micek, Veit Wiechert
2014	B	`conf`	An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. ISAAC Piotr Micek, Veit Wiechert
2014	J	`jnl`	An extremal problem on crossing vectors. J. Comb. Theory A Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
2014	J	`jnl`	Coloring Intersection Graphs of Arc-Connected Sets in the Plane. Discret. Comput. Geom. Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
2014	J	`jnl`	Graph sharing game and the structure of weighted graphs with forbidden subdivision. CoRR Adam Gagol, Piotr Micek, Bartosz Walczak
2014	B	`conf`	Lower Bounds for On-line Graph Colorings. ISAAC Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
2014	J	`jnl`	Lower bounds for on-line graph colorings. CoRR Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
2014	A*	`conf`	Making Octants Colorful and Related Covering Decomposition Problems. SODA Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	Making Octants Colorful and Related Covering Decomposition Problems. SIAM J. Discret. Math. Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	On-line coloring between two lines. CoRR Stefan Felsner, Piotr Micek, Torsten Ueckerdt
2014	J	`jnl`	Outerplanar graph drawings with few slopes. Comput. Geom. Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2014	J	`jnl`	Towards an on-line version of Ohba's conjecture. Eur. J. Comb. Jakub Kozik, Piotr Micek, Xuding Zhu
2014	J	`jnl`	Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2013	J	`jnl`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles CoRR 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
2013	B	`conf`	Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 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
2013	J	`jnl`	Coloring intersection graphs of arc-connected sets in the plane. CoRR Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
2013	J	`jnl`	Making Octants Colorful and Related Covering Decomposition Problems. CoRR Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013	J	`jnl`	Making Triangles Colorful. J. Comput. Geom. Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2013	J	`jnl`	New approach to nonrepetitive sequences. Random Struct. Algorithms Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
2013	J	`jnl`	Nonrepetitive Choice Number of Trees. SIAM J. Discret. Math. Jakub Kozik, Piotr Micek
2013	J	`jnl`	On the number of edges in families of pseudo-discs. CoRR Piotr Micek, Rom Pinchasi
2013	J	`jnl`	On-Line Dimension of Semi-Orders. Order Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
2013	J	`jnl`	On-line Chain Partitions of Up-growing Semi-orders. Order Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
2013	J	`jnl`	Tree-Width and Dimension CoRR Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
2013	J	`jnl`	Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2012	J	`jnl`	An extremal problem on crossing vectors CoRR Michal Lason, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
2012	J	`jnl`	Making Triangles Colorful CoRR Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2012	J	`jnl`	Nonrepetitive choice number of trees CoRR Jakub Kozik, Piotr Micek
2012	J	`jnl`	On-Line Chain Partitions of Orders: A Survey. Order Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek
2012	J	`jnl`	On-line version of Rabinovitch theorem for proper intervals. Discret. Math. Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
2012	Misc	`conf`	Outerplanar Graph Drawings with Few Slopes. COCOON Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Outerplanar graph drawings with few slopes CoRR Kolja B. Knauer, Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Parity in graph sharing games. Discret. Math. Piotr Micek, Bartosz Walczak
2012	J	`jnl`	Triangle-free geometric intersection graphs with large chromatic number CoRR Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2012	J	`jnl`	Triangle-free intersection graphs of line segments with large chromatic number CoRR Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
2011	J	`jnl`	A Graph-Grabbing Game. Comb. Probab. Comput. Piotr Micek, Bartosz Walczak
2011	J	`jnl`	A new approach to nonrepetitive sequences CoRR Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
2011	J	`jnl`	How to eat 4/9 of a pizza. Discret. Math. Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2011	J	`jnl`	Nonrepetitive games CoRR Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
2011	J	`jnl`	Towards on-line Ohba's conjecture CoRR Jakub Kozik, Piotr Micek, Xuding Zhu
2008	J	`jnl`	How to eat 4/9 of a pizza CoRR Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2007	J	`jnl`	On-line Chain Partitioning of Up-growing Interval Orders. Order Patrick Baier, Bartlomiej Bosek, Piotr Micek
2007	J	`jnl`	On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders CoRR Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
2004	—	`conf`	Variants of Online Chain Partition Problem of Posets. CLA Bartlomiej Bosek, Piotr Micek