Najważniejsze publikacje
- Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin, Adjacency Labelling for Planar Graphs (and Beyond), Journal of the ACM 68 (2021), 1-33
- Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood, Planar Graphs Have Bounded Queue-Number, Journal of the ACM 67(4) (2020), 862-875
- 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, Journal of Combinatorial Theory. Series B 138 (2019), 206-218
- Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert, Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
- Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak, Triangle-free intersection graphs of line segments with large chromatic number, Journal of Combinatorial Theory. Series B 105 (2014), 6-10
Najnowsze publikacje
- Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood, The excluded tree minor theorem revisited, Combinatorics Probability and Computing 33 (2024), 85-90
- Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak, Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica 44 (2024), 417-427
- Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood, The grid-minor theorem revisited, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245
- Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak, Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
- Jakub Kozik, Piotr Micek, William T. Trotter, Dimension is polynomial in height for posets with planar cover graphs, Journal of Combinatorial Theory. Series B Volume 165, March 2024 (2024), 164-196
Zainteresowania
strukturalna teoria grafów, kombinatoryka posetów, kolorowania grafów, algorytmy grafowe
Piotr Micek
stopień/tytuł doktor habilitowany stanowiskobadawczo-dydaktyczne, profesor uczelni
jednostka
- Katedra Algorytmiki
- Instytut Informatyki Analitycznej
piotr.micek@uj.edu.pl
www