Graph Burning and Non-uniform k-centers for Small Treewidth. - Matej Lieskovský; Jirí Sgall (WAOA, 2022)

Approximation Algorithms and Lower Bounds for Graph Burning. - Matej Lieskovský; Jirí Sgall; Andreas Emil Feldmann (APPROX/RANDOM, 2023)

Improved Online Load Balancing with Known Makespan. - Martin Böhm 001; Matej Lieskovský; Sören Schmitt; Jirí Sgall; Rob van Stee (APPROX/RANDOM, 2024)

Better Algorithms for Online Bin Stretching via Computer Search. - Matej Lieskovský (LATIN (1), 2024)