dr hab. Piotr Micek

Jednostki:

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

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

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

Publikacje:

67.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The excluded tree minor theorem revisited, Combinatorics Probability and Computing vol. 33 (2024), 85-90
66.
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 vol. 44 (2024), 417-427
65.
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
64.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
63.
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs, Journal of Combinatorial Theory. Series B vol. Volume 165, March 2024 (2024), 164-196
62.
Marcin Briański, Jędrzej Hodor, Hoang La, Katzper Michno, Piotr Micek
Boolean dimension of a Boolean lattice, Order (2023),
61.
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences, Computational Geometry: Theory and Applications vol. 115 (2023), 1-17
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
Improved bounds for weak coloring numbers, Electronic Journal of Combinatorics vol. Volume 29, Issue 1 (2022), P1.60
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
Adjacency Labelling for Planar Graphs (and Beyond), Journal of the ACM vol. 68 (2021), 1-33
56.
Marcin Briański, Piotr Micek, Michał Pilipczuk, Michał Seweryn
Erdös-Hajnal Properties for Powers of Sparse Graphs, SIAM Journal on Discrete Mathematics vol. 35 (1) (2021), 447-464
55.
Marcin Briański, Stefan Felsner, Jędrzej Hodor, Piotr Micek
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
Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), P3.51
52.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth, Combinatorica vol. 40 (2020), 839–868
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
Planar Graphs Have Bounded Queue-Number, Journal of the ACM vol. 67(4) (2020), 862-875
49.
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean Dimension and Tree-Width, Combinatorica vol. 40 (2020), 655-677
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
Boolean Dimension, Components and Blocks, Order (2020), 287-298
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
A note on the minimum number of edges in hypergraphs with property O, European Journal of Combinatorics vol. 81 (2019), 172-177
44.
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 vol. 138 (2019), 206-218
43.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
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
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions, Electronic Journal of Combinatorics vol. 25 (1) (2018), P1.35
39.
Grzegorz Guśpiel, Piotr Micek, Adam Polak
On an Extremal Problem for Poset Dimension, Order vol. 35(3) (2018), 489-493
38.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
On the Dimension of Posets with Cover Graphs of Treewidth 2, Order vol. 34.2 (2017), 185-234
37.
Piotr Micek, Veit Wiechert
Topological minors of cover graphs and dimension, Journal of Graph Theory vol. 86.3 (2017), 295–314
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
Planar posets have dimension at most linear in their height, SIAM Journal on Discrete Mathematics vol. 31 (4) (2017), 2754–2790
34.
Adam Gągol, Piotr Micek, Bartosz Walczak
Graph sharing game and the structure of weighted graphs with a forbidden subdivision, Journal of Graph Theory vol. 85 (2017), 22-50
33.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, Algorithmica vol. 77 (2017), 1060-1070
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, Electronic Journal of Combinatorics 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.
Piotr Micek
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.
Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
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
Making octants colorful, and related covering decomposition problems, SIAM Journal on Discrete Mathematics vol. 28-4 (2014), 1948-1959
23.
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
Coloring intersection graphs of arc-connected sets in the plane, Discrete and Computational Geometry vol. 52 (2014), 399-415
22.
Michał Lasoń, Piotr Micek, Noah Streib, William T. Trotter, Bartosz Walczak
An extremal problem on crossing vectors, Journal of Combinatorial Theory - Series A vol. 128 (2014), 41-55
21.
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 vol. 105 (2014), 6-10
20.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, Computational Geometry: Theory and Applications vol. 47 (2014), 614-624
19.
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba’s conjecture, European Journal of Combinatorics vol. 36 (2014), 110-121
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
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles, Lecture Notes in Computer Science vol. 8037 (2013), 73-84
16.
Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak
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
15.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-free geometric intersection graphs with large chromatic number, Discrete and Computational Geometry vol. 50 (2013), 714-726
14.
Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615
13.
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences, Random Structures and Algorithms vol. 42 (2013), 214-225
12.
Jakub Kozik, Piotr Micek
Nonrepetitive choice number of trees, SIAM Journal on Discrete Mathematics vol. 27-1 (2013), 436-446
11.
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
On-line Chain Partitions of Up-growing Semi-orders, Order vol. 30(1) (2013), 85-101
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
9.
Piotr Micek, Bartosz Walczak
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
8.
Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436
7.
Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek
On-Line Chain Partitions of Orders: A Survey, Order vol. 29(1) (2012), 49-73
6.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
5.
Piotr Micek, Bartosz Walczak
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629
4.
Patrick Baier, Bartłomiej Bosek, Piotr Micek
On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13
3.
Iwona Cieślik, Marcin Kozik, Piotr Micek
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.
Bartłomiej Bosek, Piotr Micek
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48
1.
Bartłomiej Bosek, Piotr Micek
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)