Publications

See also my dblp page.

ORCID iD
iconhttps://orcid.org/0000-0002-3020-6443

Journal papers

Lukáš Folwarczný and Jiří Sgall: General Caching Is Hard: Even with Small Pages
In Algorithmica 79(2): 319-339 (2017). DOI: https://doi.org/10.1007/s00453-016-0185-0 A preliminary version appeared at ISAAC 2015.
arXiv, more about this work
Lukáš Folwarczný and Dušan Knop: IV-matching is strongly NP-hard
In Information Processing Letters 125: 5-8 (2017). DOI: https://doi.org/10.1016/j.ipl.2017.04.014
arXiv, more about this work

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

Master thesis

Graph communication protocols
Advised by prof. Pavel Pudlák
Defended in September 2018 at Faculty of Mathematics and Physics, Charles University in Prague
PDF, more about this work, record in the university thesis repository

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