dr hab. Piotr Micek

Jednostki:

  • Wydział Matematyki i Informatyki UJ
  • Instytut Informatyki Analitycznej
  • Katedra Algorytmiki

DoktoratOtwarcie: 2006-06-29, Zamknięcie: 2008-10-30

HabilitacjaOtwarcie: 2019-04-30, Zamknięcie: 2020-05-28

Publikacje:

66.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
65.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
64.
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
63.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
61.
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
60.
Marcin Briański, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał Seweryn, Roohani Sharma
Treedepth vs circumference, Combinatorica vol. 43 (2023), 659-664
59.
Gwenaël Joret, Piotr Micek
58.
Tony Huynh, Gwenaël Joret, Piotr Micek, Michał Seweryn, Paul Wollan
Excludding a Ladder, Combinatorica vol. 42 (2022), 405–432
57.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
55.
Reconfiguring independent sets on interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. Leibniz International Proceedings in Informatics (LIPIcs) 202 (2021), 14
54.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, Advances in Combinatorics (2021), 28
53.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
52.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
51.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency labelling for planar graphs (and beyond), (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
50.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
49.
Stefan Felsner, Tamás Mészáros, Piotr Micek
48.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings vol. SODA '20 (2020), "Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms", Society for Industrial and Applied Mathematics (SIAM)
47.
Tamás Mészáros, Piotr Micek, William T. Trotter
46.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number, (2019), "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
45.
Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran
44.
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter
43.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
42.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The Queue-Number of Posets of Bounded Width or Height vol. 11282 of Lecture Notes in Computer Science (2018), "Graph Drawing and Network Visualization. GD 2018", Springer
41.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148
40.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
38.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
36.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling graphs, chromatic number, and orthogonal tree-decompositions, Electronic Notes in Discrete Mathematics vol. 61 (2017), 415-420
35.
32.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, (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)
31.
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A note on concurrent graph sharing games, Integers vol. Volume 16, G1 (2016), 5
29.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450
28.
On-line coloring between two lines 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
27.
Piotr Micek, Veit Wiechert
An on-line competitive algorithm for coloring P_8-free bipartite graphs, (2014), "Algorithms and Computation -- 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
26.
Lower Bounds for On-Line Graph Colorings vol. 8889 (Lecture Notes in Computer Science) (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
25.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, (2014), "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)", Society for Industrial and Applied Mathematics (SIAM)
24.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
18.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making triangles colorful, Journal of Computational Geometry vol. 4 (2013), 240-246
17.
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
16.
Coloring intersection graphs of arcwise connected sets in the plane vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer
11.
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
10.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes vol. 7434 of Lecture Notes in Computer Science (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer
6.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
3.
On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68
2.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48
1.
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13

Granty (realizowane po maju 2009 roku)