- Lower bounds for online makespan minimization on a small number of related machines2013 | Faculty of Mathematics and Physics
- An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives2016 | Faculty of Mathematics and Physics
- Shortening Plans by Local Re-Planning2012 | Faculty of Mathematics and Physics
- On the extension complexity of scheduling polytopes2020 | Faculty of Mathematics and Physics
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms2023 | Faculty of Mathematics and Physics
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines2014 | Faculty of Mathematics and Physics
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption2015 | Faculty of Mathematics and Physics
- New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding2017 | Faculty of Mathematics and Physics
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Faculty of Mathematics and Physics
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption2012 | Faculty of Mathematics and Physics
- Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving2012 | Faculty of Mathematics and Physics
- Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving2012 | Faculty of Mathematics and Physics
- On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective2019 | Faculty of Mathematics and Physics
- Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective2016 | Faculty of Mathematics and Physics
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms2015 | Faculty of Mathematics and Physics
- Optimal and online preemptive scheduling on uniformly related machines2009 | Faculty of Mathematics and Physics
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines2020 | Faculty of Mathematics and Physics
- Scheduling Kernels via Configuration LP2022 | Faculty of Mathematics and Physics, Central Library of Charles University
- A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well2014 | Faculty of Mathematics and Physics
- On Improving Plan Quality via Local Enhancements2012 | Faculty of Mathematics and Physics
- Scheduling meets n-fold integer programming2018 | Faculty of Mathematics and Physics
- Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally2015 | Faculty of Mathematics and Physics
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding2015 | Faculty of Mathematics and Physics
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants2011 | Faculty of Mathematics and Physics
- Optimal Cooperative Path Planning through Satisfiability Solving2013 | Faculty of Mathematics and Physics
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Faculty of Mathematics and Physics
- Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding2017 | Faculty of Mathematics and Physics
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability2014 | Faculty of Mathematics and Physics
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Faculty of Mathematics and Physics