Online Algorithms for Multi-Level Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jiri Sgall; Kim Thang Nguyen; Pavel Veselý 001 (ESA, 2016)

General Caching Is Hard: Even with Small Pages. - Lukás Folwarczný; Jirí Sgall (Algorithmica, 2017)

IV-matching is strongly NP-hard. - Lukás Folwarczný; Dusan Knop (Inf. Process. Lett., 2017)

Online Algorithms for Multilevel Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Oper. Res., 2020)

New results on multi-level aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Theor. Comput. Sci., 2021)

PPP-Completeness and Extremal Combinatorics. - Romain Bourneuf; Lukás Folwarczný; Pavel Hubácek; Alon Rosen; Nikolaj I. Schwartzbach (Electron. Colloquium Comput. Complex., 2022)

Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters. - Pavel Dvorák; Lukás Folwarczný; Michal Opler; Pavel Pudlák; Robert Sámal; Tung Anh Vu (WG, 2023)

One-Way Functions vs. TFNP: Simpler and Improved. - Lukás Folwarczný; Mika Göös; Pavel Hubácek; Gilbert Maystre; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2023)

On Protocols for Monotone Feasible Interpolation. - Lukás Folwarczný (ACM Trans. Comput. Theory, 2023)