An approximation of my appearance (2018).
A quite old approximation of my appearance (2015).
A somewhat better, but still old approximation (2015).
In years 2014-2018, I was a PhD student at Computer Science Institute of Charles University in Prague. The institute is a part of Faculty of Mathematics and Physics (MFF). My advisor was Jiří Sgall and I was also working a lot with his other PhD student Martin Böhm.
More about me can be found in CV.
- 1. 7. 2019: We updated the arXiv version of the paper with a φ-competitive algorithm for packet scheduling. The analysis is rewritten in an equivalent way that is hopefully more intuitive, and some other parts of the paper are also revised. Stay tuned, another revision will follow in O(1) months!
- 14. 5. 2019: Two new papers about streaming algorithms appeared at arXiv: one with a tight lower bound for quantile summaries and the other about bin packing and vector scheduling
- 25. 9. 2018: I successfully defended my thesis, which ended up my studies (after 4 years of PhD, 9 years at Charles University, and 22 years in total!).
- 3. 9. 2018: I have started as a postdoc of Graham Cormode at the University of Warwick.
- 17. 7. 2018: The thesis is finally submitted together with a new paper on bounded-delay packet scheduling containing a φ-competitive algorithm!
- Email: <first name>(dot)<last name> (a strange sign) warwick.ac.uk
Teaching / Výuka
Research interestsI am interested in theoretical computer science and combinatorics, with particular focus on designing efficient algorithms and data structures, specifically:
- streaming algorithms,
- online algorithms (currently mainly for buffer management problems),
- approximation algorithms,
- packing and scheduling problems,
ProjectsSelected work / projects (see also publications below):
- Streaming algorithms for packing / scheduling problems: paper about bin packing and vector scheduling and a related tight lower bound for quantile summaries.
- Packet Scheduling, which is the topic of my PhD thesis; papers:
- FPT approximation, breaking both FPT and approximation lower bounds (paper Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices)
- Online Coloring (paper Online Chromatic Number is PSPACE-Complete)
- Colored Bin Packing (master thesis, paper)
- Waltz: a strong Tzaar-playing program (bachelor thesis and a paper)
- Andreas Feldmann, Charles University, Czech republic
- Marcin Bieńkowski, Wroclaw University, Poland
- Marek Chrobak, University of California, Riverside, USA
- Łukasz Jeż, Wroclaw University, Poland
- Rob van Stee, University of Siegen, Germany