- 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
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | 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