Publikacje

• Quickly Excluding an Apex-Forest - 2026
  SIAM Journal on Discrete Mathematics 40 (2026), 282-307 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets - 2026
  Discrete Mathematics 349:4 (2026), 114904 Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
• Centered colorings in minor-closed graph classes - 2026 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2026), 164-184 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• Cliquewidth and dimension - 2026
  Proceedings of the London Mathematical Society 132 (2026), e70116 Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
• Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue - 2025
  ACM Transactions on Algorithms 21:3 (2025), 1-2 Alina Ene, Troy Lee, Piotr Micek, Sushant Sachdeva
• Shallow brambles - 2025
  Discrete Mathematics and Theoretical Computer Science 27:3 (2025), 12 Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek
• Tight bound for the Erdős-Pósa property of tree minors - 2025
  Combinatorics Probability and Computing 34 (2) (2025), 321-325 Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin
• The Grid-Minor Theorem Revisited - 2025
  Combinatorica 45 (2025), 62 Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
• Planar graphs in blowups of fans - 2025 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3382-3391 Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
• Weak coloring numbers of minor-closed graph classes - 2025 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3325-3334 Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
• Boolean dimension of a Boolean lattice - 2025
  Order 42 (2025), 25-36 Marcin Briański, Jędrzej Hodor, Hoang La, Katzper Michno, Piotr Micek
• Product structure extension of the Alon--Seymour--Thomas theorem - 2024
  SIAM Journal on Discrete Mathematics 38:3 (2024), 2095-2107 Piotr Micek
• Bounded-degree planar graphs do not have bounded-degree product structure - 2024
  Electronic Journal of Combinatorics 31 (2024), Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
• The excluded tree minor theorem revisited - 2024
  Combinatorics Probability and Computing 33 (2024), 85-90 Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
• Tight bound on treedepth in terms of pathwidth and longest path - 2024
  Combinatorica 44 (2024), 417-427 Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
• The grid-minor theorem revisited - 2024 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245 Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
• Cliquewidth and dimension - 2024 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446 Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
• Dimension is polynomial in height for posets with planar cover graphs - 2024
  Journal of Combinatorial Theory. Series B Volume 165, March 2024 (2024), 164-196 Jakub Kozik, Piotr Micek, William T. Trotter
• Colouring bottomless rectangles and arborescences - 2023
  Computational Geometry: Theory and Applications 115 (2023), 1-17 Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
• Treedepth vs circumference - 2023
  Combinatorica 43 (2023), 659-664 Marcin Briański, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał Seweryn, Roohani Sharma
• Improved bounds for weak coloring numbers - 2022
  Electronic Journal of Combinatorics Volume 29, Issue 1 (2022), P1.60 Gwenaël Joret, Piotr Micek
• Excludding a Ladder - 2022
  Combinatorica 42 (2022), 405–432 Tony Huynh, Gwenaël Joret, Piotr Micek, Michał Seweryn, Paul Wollan
• Adjacency Labelling for Planar Graphs (and Beyond) - 2021
  Journal of the ACM 68 (2021), 1-33 Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
• Erdös-Hajnal Properties for Powers of Sparse Graphs - 2021
  SIAM Journal on Discrete Mathematics 35 (1) (2021), 447-464 Marcin Briański, Piotr Micek, Michał Pilipczuk, Michał Seweryn
• Reconfiguring independent sets on interval graphs - 2021 International Symposium on Mathematical Foundations of Computer Science [MFCS] Leibniz International Proceedings in Informatics (LIPIcs) 202 (2021), 14 Marcin Briański, Stefan Felsner, Jędrzej Hodor, Piotr Micek
• Improved bounds for centered colorings - 2021
  Advances in Combinatorics (2021), 28 Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
• Tight bounds on the clique chromatic number - 2021
  Electronic Journal of Combinatorics 28 (2021), P3.51 Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
• Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth - 2020
  Combinatorica 40 (2020), 839–868 Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
• Adjacency labelling for planar graphs (and beyond) - 2020 (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE) Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
• Planar Graphs Have Bounded Queue-Number - 2020
  Journal of the ACM 67(4) (2020), 862-875 Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
• Boolean Dimension and Tree-Width - 2020
  Combinatorica 40 (2020), 655-677 Stefan Felsner, Tamás Mészáros, Piotr Micek
• Improved bounds for centered colorings - 2020 vol. SODA '20 (2020), "Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms", Society for Industrial and Applied Mathematics (SIAM) Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
• Boolean Dimension, Components and Blocks - 2020
  Order (2020), 287-298 Tamás Mészáros, Piotr Micek, William T. Trotter
• Planar Graphs have Bounded Queue-Number - 2019 (2019), "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE) Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
• A note on the minimum number of edges in hypergraphs with property O - 2019
  European Journal of Combinatorics 81 (2019), 172-177 Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran
• Separating tree-chromatic number from path-chromatic number - 2019
  Journal of Combinatorial Theory. Series B 138 (2019), 206-218 Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter
• Nowhere dense graph classes and dimension - 2019
  Combinatorica (2019), 1055-1079 Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
• The Queue-Number of Posets of Bounded Width or Height - 2018 vol. 11282 of Lecture Notes in Computer Science (2018), "Graph Drawing and Network Visualization. GD 2018", Springer Kolja Knauer, Piotr Micek, Torsten Ueckerdt
• Sparsity and dimension - 2018
  Combinatorica 38 (2018), 1129-1148 Gwenaël Joret, Piotr Micek, Veit Wiechert
• Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions - 2018
  Electronic Journal of Combinatorics 25 (1) (2018), P1.35 Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
• On an Extremal Problem for Poset Dimension - 2018
  Order 35(3) (2018), 489-493 Grzegorz Guśpiel, Piotr Micek, Adam Polak
• On the Dimension of Posets with Cover Graphs of Treewidth 2 - 2017
  Order 34.2 (2017), 185-234 Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
• Topological minors of cover graphs and dimension - 2017
  Journal of Graph Theory 86.3 (2017), 295–314 Piotr Micek, Veit Wiechert
• Planar posets have dimension at most linear in their height - 2017
  SIAM Journal on Discrete Mathematics 31 (4) (2017), 2754–2790 Gwenaël Joret, Piotr Micek, Veit Wiechert
• Graph sharing game and the structure of weighted graphs with a forbidden subdivision - 2017
  Journal of Graph Theory 85 (2017), 22-50 Adam Gągol, Piotr Micek, Bartosz Walczak
• An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths - 2017
  Algorithmica 77 (2017), 1060-1070 Piotr Micek, Veit Wiechert
• Sparsity and dimension - 2016 (2016), "27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), January 10-12, 2016, Arlington, VA, USA", Society for Industrial and Applied Mathematics (SIAM) Gwenaël Joret, Piotr Micek, Veit Wiechert
• A note on concurrent graph sharing games - 2016
  Integers Volume 16, G1 (2016), 5 Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
• Pathwidth and nonrepetitive list colorings - 2016
  Electronic Journal of Combinatorics Volume 23, Issue 4 (2016), 19 Adam Gągol, Gwenaël Joret, Jakub Kozik, Piotr Micek
• Tree-width and dimension - 2016
  Combinatorica 36 (2016), 431-450 Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
• On-line coloring between two lines - 2015 vol. 34 of Leibniz International Proceedings in Informatics (2015), "31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik Piotr Micek
• An on-line competitive algorithm for coloring P_8-free bipartite graphs - 2014 (2014), "Algorithms and Computation -- 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer Piotr Micek, Veit Wiechert
• Lower Bounds for On-Line Graph Colorings - 2014
  Lecture Notes in Computer Science vol. 8889 () (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
• Making octants colorful, and related covering decomposition problems - 2014 (2014), "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)", Society for Industrial and Applied Mathematics (SIAM) Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
• Making octants colorful, and related covering decomposition problems - 2014
  SIAM Journal on Discrete Mathematics 28-4 (2014), 1948-1959 Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
• Coloring intersection graphs of arc-connected sets in the plane - 2014
  Discrete and Computational Geometry 52 (2014), 399-415 Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
• An extremal problem on crossing vectors - 2014
  Journal of Combinatorial Theory - Series A 128 (2014), 41-55 Michał Lasoń, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
• Triangle-free intersection graphs of line segments with large chromatic number - 2014
  Journal of Combinatorial Theory. Series B 105 (2014), 6-10 Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
• Outerplanar graph drawings with few slopes - 2014
  Computational Geometry: Theory and Applications 47 (2014), 614-624 Kolja Knauer, Piotr Micek, Bartosz Walczak
• Towards an on-line version of Ohba’s conjecture - 2014
  European Journal of Combinatorics 36 (2014), 110-121 Jakub Kozik, Piotr Micek, Xuding Zhu
• Making triangles colorful - 2013
  Journal of Computational Geometry 4 (2013), 240-246 Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
• Coloring hypergraphs induced by dynamic point sets and bottomless rectangles - 2013
  Lecture Notes in Computer Science 8037 (2013), 73-84 Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Günter Rote, Thomas Hackl, Michael Hoffman, Kolja Knauer, Stefan Langerman, Michał Lasoń, Piotr Micek, Torsten Ueckerdt
• Coloring intersection graphs of arcwise connected sets in the plane - 2013
  Crm Series vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
• Triangle-free geometric intersection graphs with large chromatic number - 2013
  Discrete and Computational Geometry 50 (2013), 714-726 Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
• On-Line Dimension of Semi-Orders - 2013
  Order 30(2) (2013), 593-615 Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
• New approach to nonrepetitive sequences - 2013
  Random Structures and Algorithms 42 (2013), 214-225 Jarosław Grytczuk, Jakub Kozik, Piotr Micek
• Nonrepetitive choice number of trees - 2013
  SIAM Journal on Discrete Mathematics 27-1 (2013), 436-446 Jakub Kozik, Piotr Micek
• On-line Chain Partitions of Up-growing Semi-orders - 2013
  Order 30(1) (2013), 85-101 Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
• Outerplanar graph drawings with few slopes - 2012
  Lecture Notes in Computer Science vol. 7434 of (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer Kolja Knauer, Piotr Micek, Bartosz Walczak
• Parity in graph sharing games - 2012
  Discrete Mathematics 312 (2012), 1788-1795 Piotr Micek, Bartosz Walczak
• On-line version of Rabinovitch theorem for proper intervals - 2012
  Discrete Mathematics 312(23) (2012), 3426-3436 Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
• On-Line Chain Partitions of Orders: A Survey - 2012
  Order 29(1) (2012), 49-73 Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek
• How to eat 4/9 of a pizza - 2011
  Discrete Mathematics 311 (2011), 1635-1645 Kolja Knauer, Piotr Micek, Torsten Ueckerdt
• A graph-grabbing game - 2011
  Combinatorics Probability and Computing 20 (2011), 623-629 Piotr Micek, Bartosz Walczak
• On-line Chain Partitioning of Up-growing Interval Orders - 2007
  Order 24(1) (2007), 1-13 Patrick Baier, Bartłomiej Bosek, Piotr Micek
• On-line Coloring of I_s-free graphs and co-planar graphs - 2006
  Discrete Mathematics and Theoretical Computer Science Proceedings AF (2006), 61-68 Iwona Cieślik-Bielecka, Marcin Kozik, Piotr Micek
• On-line adaptive chain covering of upgrowing posets - 2006
  Discrete Mathematics & Theoretical Computer Science Proceedings AF (2006), 37-48 Bartłomiej Bosek, Piotr Micek
• Variants of Online Chain Partition Problem of Posets - 2005
  Electronic Notes in Theoretical Computer Science 140 (2005), 3-13 Bartłomiej Bosek, Piotr Micek