dr Piotr Micek

Jednostki:

  • Wydział Matematyki i Informatyki UJ
  • Zespół Katedr i Zakładów Informatyki Matematycznej
  • Katedra Algorytmiki

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

Publikacje:

32.
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)
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.
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.
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)
18.
Making triangles colorful, JOURNAL OF COMPUTATIONAL GEOMETRY vol. 4 (2013), 240-246
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
10.
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
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)