dr Tomasz Krawczyk


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

DoktoratOtwarcie: 2004-03-25, Zamknięcie: 2005-09-22


The Partial Visibility Representation Extension Problem vol. 9801 (Lecture Notes in Computer Science) (2016), "Graph Drawing and Network Visualization, 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers", Springer
Asymmetric coloring games on incomparability graphs, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 49 (2015), 803-811
Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer
The Sub-exponential Upper Bound for On-Line Chain Partitioning, (2010), "51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA", Institute of Electrical and Electronics Engineers (IEEE)
An automaton that recognizes the base of a semiretract, WORDS 2005, 5-TH INTERNATIONAL CONFERENCE ON WORDS (2005), 235-247

Granty (realizowane po maju 2009 roku)