Variants of Online Chain Partition Problem of Posets. - Bartlomiej Bosek; Piotr Micek (CLA, 2004)

On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders - Stefan Felsner; Kamil Kloch; Grzegorz Matecki; Piotr Micek (CoRR, 2007)

On-line Chain Partitioning of Up-growing Interval Orders. - Patrick Baier; Bartlomiej Bosek; Piotr Micek (Order, 2007)

Nonrepetitive games - Jaroslaw Grytczuk; Jakub Kozik; Piotr Micek (CoRR, 2011)

Towards on-line Ohba's conjecture - Jakub Kozik; Piotr Micek; Xuding Zhu (CoRR, 2011)

A Graph-Grabbing Game. - Piotr Micek; Bartosz Walczak (Comb. Probab. Comput., 2011)

How to eat 4/9 of a pizza. - Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (Discret. Math., 2011)

On-line version of Rabinovitch theorem for proper intervals. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Discret. Math., 2012)

Parity in graph sharing games. - Piotr Micek; Bartosz Walczak (Discret. Math., 2012)

On-Line Chain Partitions of Orders: A Survey. - Bartlomiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki; Piotr Micek (Order, 2012)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

On the number of edges in families of pseudo-discs. - Piotr Micek; Rom Pinchasi (CoRR, 2013)

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (Discret. Comput. Geom., 2013)

Making Triangles Colorful. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (J. Comput. Geom., 2013)

On-Line Dimension of Semi-Orders. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Order, 2013)

On-line Chain Partitions of Up-growing Semi-orders. - Stefan Felsner; Kamil Kloch; Grzegorz Matecki; Piotr Micek (Order, 2013)

New approach to nonrepetitive sequences. - Jaroslaw Grytczuk; Jakub Kozik; Piotr Micek (Random Struct. Algorithms, 2013)

Nonrepetitive Choice Number of Trees. - Jakub Kozik; Piotr Micek (SIAM J. Discret. Math., 2013)

Lower Bounds for On-line Graph Colorings. - Grzegorz Gutowski; Jakub Kozik; Piotr Micek; Xuding Zhu (ISAAC, 2014)

An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. - Piotr Micek; Veit Wiechert (ISAAC, 2014)

Outerplanar graph drawings with few slopes. - Kolja B. Knauer; Piotr Micek; Bartosz Walczak (Comput. Geom., 2014)

Coloring Intersection Graphs of Arc-Connected Sets in the Plane. - Michal Lason; Piotr Micek; Arkadiusz Pawlik; Bartosz Walczak (Discret. Comput. Geom., 2014)

Towards an on-line version of Ohba's conjecture. - Jakub Kozik; Piotr Micek; Xuding Zhu (Eur. J. Comb., 2014)

An extremal problem on crossing vectors. - Michal Lason; Piotr Micek; Noah Streib; William T. Trotter; Bartosz Walczak (J. Comb. Theory A, 2014)

Triangle-free intersection graphs of line segments with large chromatic number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (J. Comb. Theory B, 2014)

Making Octants Colorful and Related Covering Decomposition Problems. - Jean Cardinal; Kolja B. Knauer; Piotr Micek; Torsten Ueckerdt (SIAM J. Discret. Math., 2014)

On-line Coloring between Two Lines. - Stefan Felsner; Piotr Micek; Torsten Ueckerdt (SoCG, 2015)

Tree-width and dimension. - Gwenaël Joret; Piotr Micek; Kevin G. Milans; William T. Trotter; Bartosz Walczak; Ruidong Wang (Comb., 2016)

Pathwidth and Nonrepetitive List Coloring. - Adam Gagol; Gwenaël Joret; Jakub Kozik; Piotr Micek (Electron. J. Comb., 2016)

A Note on Concurrent Graph Sharing Games. - Steven Chaplick; Piotr Micek; Torsten Ueckerdt; Veit Wiechert (Integers, 2016)

An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths. - Piotr Micek; Veit Wiechert (Algorithmica, 2017)

Burling graphs, chromatic number, and orthogonal tree-decompositions. - Stefan Felsner; Gwenaël Joret; Piotr Micek; William T. Trotter; Veit Wiechert (Electron. Notes Discret. Math., 2017)

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision. - Adam Gagol; Piotr Micek; Bartosz Walczak (J. Graph Theory, 2017)

Topological Minors of Cover Graphs and Dimension. - Piotr Micek; Veit Wiechert (J. Graph Theory, 2017)

On the Dimension of Posets with Cover Graphs of Treewidth 2. - Gwenaël Joret; Piotr Micek; William T. Trotter; Ruidong Wang; Veit Wiechert (Order, 2017)

Planar Posets Have Dimension at Most Linear in Their Height. - Gwenaël Joret; Piotr Micek; Veit Wiechert (SIAM J. Discret. Math., 2017)

The Queue-Number of Posets of Bounded Width or Height. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (GD, 2018)

Sparsity and Dimension. - Gwenaël Joret; Piotr Micek; Veit Wiechert (Comb., 2018)

The queue-number of planar posets. - Kolja Knauer; Piotr Micek; Torsten Ueckerdt (CoRR, 2018)

On an Extremal Problem for Poset Dimension. - Grzegorz Guspiel; Piotr Micek; Adam Polak 001 (Order, 2018)

Nowhere Dense Graph Classes and Dimension. - Gwenaël Joret; Piotr Micek; Patrice Ossona de Mendez; Veit Wiechert (Comb., 2019)

A note on the minimum number of edges in hypergraphs with property O. - Gal Kronenberg; Christopher Kusch; Ander Lamaison; Piotr Micek; Tuan Tran (Eur. J. Comb., 2019)

Separating tree-chromatic number from path-chromatic number. - Fidel Barrera-Cruz; Stefan Felsner; Tamás Mészáros 001; Piotr Micek; Heather C. Smith; Libby Taylor; William T. Trotter (J. Comb. Theory B, 2019)

Improved bounds for centered colorings. - Michal Debski; Stefan Felsner; Piotr Micek; Felix Schröder (SODA, 2020)

Boolean Dimension and Tree-Width. - Stefan Felsner; Tamás Mészáros 001; Piotr Micek (Comb., 2020)

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. - Tony Huynh; Gwenaël Joret; Piotr Micek; David R. Wood (Comb., 2020)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. - Marthe Bonamy; Oscar Defrain; Piotr Micek; Lhouari Nourine (CoRR, 2020)

Planar Graphs Have Bounded Queue-Number. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; Torsten Ueckerdt; David R. Wood (J. ACM, 2020)

Boolean Dimension, Components and Blocks. - Tamás Mészáros 001; Piotr Micek; William T. Trotter (Order, 2020)

Reconfiguring Independent Sets on Interval Graphs. - Marcin Brianski; Stefan Felsner; Jedrzej Hodor; Piotr Micek (MFCS, 2021)

Tight Bounds on the Clique Chromatic Number. - Gwenaël Joret; Piotr Micek; Bruce A. Reed; Michiel Smid (Electron. J. Comb., 2021)

Adjacency Labelling for Planar Graphs (and Beyond). - Vida Dujmovic; Louis Esperet; Cyril Gavoille; Gwenaël Joret; Piotr Micek; Pat Morin (J. ACM, 2021)

Erdös-Hajnal Properties for Powers of Sparse Graphs. - Marcin Brianski; Piotr Micek; Michal Pilipczuk; Michal T. Seweryn (SIAM J. Discret. Math., 2021)

Excluding a Ladder. - Tony Huynh; Gwenaël Joret; Piotr Micek; Michal T. Seweryn; Paul Wollan (Comb., 2022)

Improved Bounds for Weak Coloring Numbers. - Gwenaël Joret; Piotr Micek (Electron. J. Comb., 2022)

Boolean dimension and dim-boundedness: Planar cover graph with a zero. - Piotr Micek; Heather C. Smith Blake; William T. Trotter (CoRR, 2022)

Treedepth vs Circumference. - Marcin Brianski; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michal T. Seweryn; Roohani Sharma (Comb., 2023)

Colouring bottomless rectangles and arborescences. - Jean Cardinal; Kolja Knauer; Piotr Micek; Dömötör Pálvölgyi; Torsten Ueckerdt; Narmada Varadarajan (Comput. Geom., 2023)

The Grid-Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Jedrzej Hodor; Gwenaël Joret; Hoang La; Piotr Micek; Pat Morin; Clément Rambaud; David R. Wood (SODA, 2024)

Cliquewidth and Dimension. - Gwenaël Joret; Piotr Micek; Michal Pilipczuk; Bartosz Walczak (SODA, 2024)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Electron. J. Comb., 2024)

Vertex Ranking of Degenerate Graphs. - John Iacono; Piotr Micek; Pat Morin; Bruce A. Reed (CoRR, 2024)

Quickly excluding an apex-forest. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Centered colorings in minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Erdős-Pósa property of cycles that are far apart. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (CoRR, 2024)

Product Structure Extension of the Alon-Seymour-Thomas Theorem. - Marc Distel; Vida Dujmovic; David Eppstein; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; Michal T. Seweryn; David R. Wood (SIAM J. Discret. Math., 2024)

The Excluded Tree Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (Comb. Probab. Comput., 2024)

Dimension is polynomial in height for posets with planar cover graphs. - Jakub Kozik; Piotr Micek; William T. Trotter (J. Comb. Theory B, 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Planar Graphs in Blowups of Fans. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin; David R. Wood (SODA, 2025)

Weak coloring numbers of minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (SODA, 2025)

Tight bound for the Erdős-Pósa property of tree minors. - Vida Dujmovic; Gwenaël Joret; Piotr Micek; Pat Morin (Comb. Probab. Comput., 2025)

Boolean Dimension of a Boolean Lattice. - Marcin Brianski; Jedrzej Hodor; Hoang La; Piotr Micek; Katzper Michno (Order, 2025)

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. - Alina Ene; Troy Lee; Piotr Micek; Sushant Sachdeva (ACM Trans. Algorithms, 2025)