group photo

Piotr Micek

I am an associate professor at

Jagiellonian University
Faculty of Mathematics and Computer Science
Theoretical Computer Science Department

From September 2016 till February 2017, I am a BMS Substitute Professor at

Freie Universität Berlin
Institute of Mathematics
Combinatorics and Graph Theory Group

reach me:
firstname.lastname@gmail.com
+493083875205

find me:
room 207, Arnimallee 3

Affiliations

Research Interests

Papers

As of Jan 8, 2017. Conference and journal versions merged.
Here is my Google Scholar profile.
  1. Variants of online chain partition problem of posets
    with Bartłomiej Bosek
    Proceedings of Computational Logic and Applications, CLA 2004, Electronic Notes on Theoretical Computer Science: 140, 3–13, 2005
  2. On-line coloring of Is-free graphs and co-planar graphs
    with Iwona Cieślik and Marcin Kozik
    Proceedings of Computational logic and applications, CLA 2005, Discrete Mathematics & Theoretical Computer Science Proceedings, AF., 61–68, 2006
  3. On-line adaptive chain covering of upgrowing posets
    with Bartłomiej Bosek
    Proceedings of Computational Logic and Applications, CLA 2005, Discrete Mathematics & Theoretical Computer Science Proceedings, AF., 37–48, 2006
  4. On-line chain partitioning of up-growing interval orders
    with Patrick Baier and Bartłomiej Bosek
    Order (ORDE): 24.1, pp. 1–13, 2007
  5. A graph-grabbing game
    with Bartosz Walczak
    Combinatorics, Probability & Computing (CPC): 20.4, 623–629, 2011
  6. How to eat 4/9 of a pizza
    with Kolja Knauer, and Torsten Ueckerdt
    Discrete Mathematics (DM): 311.16, 1635–1645, 2011
  7. Parity in graph sharing games
    with Bartosz Walczak
    Discrete Mathematics (DM): 312.10, 1788–1795, 2012
  8. On-line version of Rabinovitch theorem for proper intervals
    with Bartłomiej Bosek, Kamil Kloch, and Tomasz Krawczyk
    Discrete Mathematics (DM): 312.23, 3426–3436, 2012
  9. On-line chain partitions of orders: a survey
    with Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, and Grzegorz Matecki
    Order (ORDE): 29.1, 49-73, 2012
  10. On-line chain partitions of up-growing semi-orders
    with Stefan Felsner, Kamil Kloch, and Grzegorz Matecki
    Order (ORDE): 30.1,85–101, 2013
  11. Making triangles colorful
    with Jean Cardinal, Kolja Knauer, and Torsten Ueckerdt
    Journal of Computational Geometry: 4.1, 240–246, 2013
  12. On-line dimension of semi-orders
    with Bartłomiej Bosek, Kamil Kloch, and Tomasz Krawczyk
    Order (ORDE): 30.2, 593–615, 2013
  13. Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
    with Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja Knauer, Stefan Langerman, Michał Lasoń, Günter Rote, and Torsten Ueckerdt
    Proc. Workshop on Algorithms and Data Structures (WADS), Algorithms and data structures, Lecture Notes in Computer Science: 8037, 73-84, 2013
  14. Triangle-free geometric intersection graphs with large chromatic number
    with Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, William T. Trotter, and Bartosz Walczak
    Discrete & Computational Geometry (DCG): 50 , 714-726, 2013
  15. Nonrepetitive choice number of trees
    with Jakub Kozik
    SIAM Journal on Discrete Mathematics (SIDMA): 27, no. 1, 436-446, 2013
  16. A new approach to nonrepetitive sequences
    with Jarosław Grytczuk and Jakub Kozik
    Random Structures and Algorithms (RSA): 42, Issue 2, 214-225, 2013
  17. Coloring intersection graphs of arc-connected sets in the plane
    with Michał Lasoń, Arkadiusz Pawlik, and Bartosz Walczak
    final version: Discrete & Computational Geometry (DCG): 52, Issue 2, 399-415, 2014
    preliminary version: 7th European Conference on Combinatorics, Graph Theory and Applications (EuroComb): vol. 16 of CRM Series, 299-304, 2013
  18. Towards an on-line version of Ohba’s conjecture
    with Jakub Kozik, and Xuding Zhu
    European Journal of Combinatorics (EJC): 36, 110-121, 2014
  19. Outerplanar graph drawings with few slopes
    with Kolja Knauer, Bartosz Walczak
    final version: Computational Geometry: Theory and Applications (CGTA): 47 (5), 614-624, 2014
    preliminary version: Computing and combinatorics. Lecture Notes in Comput. Sci.: vol. 7434, 2012
  20. Lower bounds for on-line graph colorings
    with Grzegorz Gutowski, Jakub Kozik and Xuding Zhu
    Algorithms and Computation: 25th International Symposium (ISAAC) Proceedings: 507-515, 2014
  21. An on-line competitive algorithm for coloring bipartite graphs without long induced paths
    with Veit Wiechert
    full version: Algorithmica (ALGO) 77, 1060-1070, 2017.
    preliminary version: An on-line competitive algorithm for coloring P8-free bipartite graphs, Algorithms and Computation: 25th International Symposium (ISAAC) Proceedings: 516-527, 2014
  22. An extremal problem on crossing vectors
    with Michał Lasoń, Noah Streib, William T. Trotter, and Bartosz Walczak
    Journal of Combinatorial Theory Series A (JCT-A): 128, 41–55, 2014
  23. Triangle-free intersection graphs of line segments with large chromatic number
    with Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, William T. Trotter, and Bartosz Walczak
    Journal of Combinatorial Theory Series B (JCT-B), 105: 6-10, 2014.
  24. Making octants colorful, and related covering decomposition problems
    with Jean Cardinal, Kolja Knauer, and Torsten Ueckerdt
    full version: SIAM Journal on Discrete Mathematics (SIDMA) 28 (4): 1948-1959, 2014
    preliminary version: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA): 1424-1432, 2014
  25. On-line coloring between two lines
    with Stefan Felsner and Torsten Ueckerdt
    31st International Symposium on Computational Geometry (SoCG), LIPIcs 34: 630-641, 2015
  26. Sparsity and dimension
    with Gwenaël Joret and Veit Wiechert
    final version: to appear in Combinatorica
    preliminary version: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA): 1804-1813, 2016
  27. A note on concurrent graph sharing games
    with Steven Chaplick, Torsten Ueckerdt, and Veit Wiechert
    Integers 16, No. G1, 2016.
  28. On the dimension of posets with cover graphs of treewidth 2
    with Gwenaël Joret, William T. Trotter, Ruidong Wang, and Veit Wiechert
    to appear in Order (ORDE)
  29. Tree-width and dimension
    with Gwenaël Joret, Kevin G. Milans, William T. Trotter, Bartosz Walczak, and Ruidong Wang
    Combinatorica, 36/4:431-450, 2016.
  30. Graph sharing game and the structure of weighted graphs with a forbidden subdivision
    with Adam Gągol and Bartosz Walczak
    to appear in Journal of Graph Theory (JGT)
  31. Pathwidth and nonrepetitive list colorings
    with Adam Gągol, Gwenaël Joret, and Jakub Kozik
    Electronic Journal of Combinatorics (E-JC) Vol. 23, Issue 4, 2016.
  32. Topological minors of cover graphs and dimension
    with Veit Wiechert
    to appear in Journal of Graph Theory (JGT)

Recent Collaborators

My Events

flags counting since December 2013

Free counters!