- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption2012 | Faculty of Mathematics and Physics
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption2015 | Faculty of Mathematics and Physics
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms2023 | Faculty of Mathematics and Physics
- Preemption of a shareholder's right to information in a limited liability company and the company's obligation to provide the information requested by the shareholder (also critical comment on the Supreme Court judgment 27 Cdo 1385/2022)2023 | Faculty of Law
- A Stochastic-Integer Programming Approach to Tactical Fixed Interval Scheduling Problems2017 | Faculty of Mathematics and Physics