- SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition2018 | Matematicko-fyzikální fakulta
- A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints2012 | Matematicko-fyzikální fakulta
- Variants of independence detection in SAT-based optimal multi-agent path finding2017 | Matematicko-fyzikální fakulta
- On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective2019 | 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
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Matematicko-fyzikální fakulta
- Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems2013 | Matematicko-fyzikální fakulta
- An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives2016 | Matematicko-fyzikální fakulta
- Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models2016 | Matematicko-fyzikální fakulta
- Reformulace CSP modelů pro klasické plánování2008 | UNIVERZITA KARLOVA
- Reformulace modelů s podmínkami pro klasické plánování2008 | Matematicko-fyzikální fakulta
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Matematicko-fyzikální fakulta
- Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT2016 | 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
- Incremental Verification by SMT-based Summary Repair2020 | Matematicko-fyzikální fakulta