- On Propositional Encodings of Cooperative Path-finding2012 | Faculty of Mathematics and Physics
- Adversarial Cooperative Path-Finding: A First View2013 | Faculty of Mathematics and Physics
- A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints2012 | Faculty of Mathematics and Physics
- Solving Abstract Cooperative Path-Finding in Densely Populated Environments2014 | Faculty of Mathematics and Physics
- Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases2013 | Faculty of Mathematics and Physics
- Mutex reasoning in cooperative path finding modeled as propositional satisfiability2013 | Faculty of Mathematics and Physics
- Adversarial Cooperative Path-finding: Complexity and Algorithms2014 | Faculty of Mathematics and Physics
- Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally2015 | Faculty of Mathematics and Physics
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Faculty of Mathematics and Physics
- A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well2014 | Faculty of Mathematics and Physics
- The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems2014 | Faculty of Mathematics and Physics
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding2015 | 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
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving2012 | Faculty of Mathematics and Physics
- Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems2011 | Faculty of Mathematics and Physics
- Application of Propositional Satistiability to Special Cases of Cooperative Path-Planning2012 | Faculty of Mathematics and Physics