All papers are listed at dblp.

Conference proceedings papers

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, Pavel Veselý: Online Algorithms for Multi-Level Aggregation
In Proc. of the 24th Annual European Symposium on Algorithms (ESA 2016). Pages 12:1 – 12:17. DOI: 10.4230/LIPIcs.ESA.2016.12
arXiv, more about this work
Lukáš Folwarczný, Jiří Sgall: General Caching Is Hard: Even with Small Pages
In Proc. of the 26th International Symposium on Algorithms and Computation (ISAAC 2015). Pages 116 – 126. DOI: 10.1007/978-3-662-48971-0_11
arXiv, more about this work

Papers in preparation

Lukáš Folwarczný, Dušan Knop: IV-matching is strongly NP-hard
Appeared in proceedings DIMACS-DIMATIA International REU Research Experience for Undergraduates. 2014. Url:
arXiv, more about this work

Bachelor thesis

On the Hardness of General Caching
Advised by prof. Jiří Sgall
Defended in September 2015 at Faculty of Mathematics and Physics, Charles University in Prague
PDF, more about this work, record in the university thesis repository