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:

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
37.
Piotr Micek, 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.
Gwenaël Joret, Piotr Micek, Veit Wiechert
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
30.
Adam Gągol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
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
22.
Michał Lasoń, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
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
13.
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 MATH 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)