- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | Matematicko-fyzikální fakulta
- A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well2014 | Matematicko-fyzikální fakulta
- Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning2012 | Matematicko-fyzikální fakulta
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Matematicko-fyzikální fakulta
- Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability2014 | Matematicko-fyzikální fakulta
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Matematicko-fyzikální fakulta
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Matematicko-fyzikální fakulta
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Matematicko-fyzikální fakulta
- Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding2017 | Matematicko-fyzikální fakulta