Lukáš Folwarczný

PhD student of Theoretical Computer Science

© 2023. Hyde theme.

Publications

See also my dblp page or my profile on Google Scholar.

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

Preprints

Pavel Dvořák, Lukáš Folwarczný, Michal Opler, Pavel Pudlák, Robert Šámal, Tung Anh Vu: Bounds on Functionality and Symmetric Difference ‐ Two Intriguing Graph Parameters
arXiv: 2302.11862

Conference papers

Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček, Alon Rosen, Nikolaj Ignatieff Schwartzbach: PPP-Completeness and Extremal Combinatorics
In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023): 22:1-22:20 (2023).
DOI: 10.4230/LIPIcs.ITCS.2023.22
Talk by Nikolaj

Journal papers

Lukáš Folwarczný: On Protocols for Monotone Feasible Interpolation
In ACM Transactions on Computation Theory, "Just Accepted" https://doi.org/10.1145/3583754
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, Pavel Veselý: New results on multi-level aggregation
In Theoretical Computer Science 861: 133-143 (2021).
DOI: https://doi.org/10.1016/j.tcs.2021.02.016
more about this work
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 Multilevel Aggregation
In Operarions Research 68(1): 214-232 (2020).
DOI: https://doi.org/10.1287/opre.2019.1847
A preliminary version appeared at ESA 2016.
arXiv, more about this work
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

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, article version, record in the university thesis repository