- Lower bounds for online makespan minimization on a small number of related machines2013 | Faculty of Mathematics and Physics
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines2014 | Faculty of Mathematics and Physics
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms2015 | Faculty of Mathematics and Physics
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms2023 | Faculty of Mathematics and Physics
- Scheduling Kernels via Configuration LP2022 | Faculty of Mathematics and Physics, Central Library of Charles University
- Scheduling meets n-fold integer programming2018 | Faculty of Mathematics and Physics
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines2020 | Faculty of Mathematics and Physics