| 2026 | ICAART | SAT-Based Large Neighborhood Search for Multi-Agent Pathfinding. | Max Frommknecht, Pavel Surynek |
| 2026 | ICAART | Local Visibility Roadmaps in Continous Multi-Agent Path Finding. | Kristna Janovsk, Pavel Surynek |
| 2026 | ICAART | Recent Progress in Compilation-Based Approaches for Multi-Agent Path Finding. | Pavel Surynek |
| 2025 | AAAI | Accessible Hardware Implementation for Multi-Agent Collective Construction. | Martin Rames, Pavel Surynek |
| 2025 | IROS | Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver. | Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis |
| 2025 | SoCS | Object Packing and Scheduling for Sequential 3D Printing: A Linear Arithmetic Model and a CEGAR-Inspired Optimal Solver (Extended Abstract). | Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis |
| 2024 | ECAI | Reaching New Heights in Multi-Agent Collective Construction. | Martin Rames, Pavel Surynek |
| 2024 | ICAART | Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. | Toms Kolrik, Stefan Ratschan, Pavel Surynek |
| 2024 | ICAART | Action Duration Generalization for Exact Multi-Agent Collective Construction. | Martin Rames, Pavel Surynek |
| 2024 | ICINCO | Solving Multi-Agent Pathfinding with Stochastic Local Search SAT Algorithms. | Max Frommknecht, Pavel Surynek |
| 2024 | ICTAI | Multi-Agent Path Finding in Continuous Environment. | Kristna Janovsk, Pavel Surynek |
| 2024 | ICTAI | Virtual Network Embedding as Boolean Satisfiability. | Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar |
| 2024 | SoCS | Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). | Irene Saccani, Kristna Janovsk, Pavel Surynek |
| 2024 | SoCS | Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). | Pavel Surynek |
| 2023 | ICAART | Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. | Pavel Surynek |
| 2023 | ICINCO | Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop. | Matous Kulhan, Pavel Surynek |
| 2023 | ICINCO | Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding. | Irene Saccani, Kristna Janovsk, Pavel Surynek |
| 2023 | IROS | Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning. | Pavel Surynek |
| 2023 | ICTAI | Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding. | Pavel Surynek |
| 2023 | PAAMS | Multi-agent Path Finding for Indoor Quadcopters. | Matous Kulhan, Pavel Surynek |
| 2022 | ICAART | Parameter Setting in SAT Solver using Machine Learning Techniques. | Filip Beskyd, Pavel Surynek |
| 2022 | ICAART | Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques. | Filip Beskyd, Pavel Surynek |
| 2022 | ICAART | Highways in Warehouse Multi-Agent Path Finding: A Case Study. | Vojtech Rybr, Pavel Surynek |
| 2022 | IJCAI | Problem Compilation for Multi-Agent Path Finding: a Survey. | Pavel Surynek |
| 2022 | SoCS | Lazy Compilation in Classical Planning (Extended Abstract). | Zuzana Flov, Pavel Surynek |
| 2022 | SoCS | Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). | Kristna Janovsk, Pavel Surynek |
| 2022 | SoCS | Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). | Pavel Surynek |
| 2021 | AAAI | ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. | Jn Chud, Pavel Surynek |
| 2021 | AAAI | Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. | Pavel Surynek |
| 2021 | IC3K | Hierarchical Control of Swarms during Evacuation. | Kristna Janovsk, Pavel Surynek |
| 2021 | IROS | Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. | Pavel Surynek |
| 2021 | ICTAI | Adversarial Multi-Agent Path Finding is Intractable. | Marika Ivanov, Pavel Surynek |
| 2021 | ICTAI | Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning. | Pavel Surynek |
| 2021 | SoCS | DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. | Martin Capek, Pavel Surynek |
| 2021 | SoCS | Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. | Pavel Surynek |
| 2021 | SoCS | Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. | Pavel Surynek |
| 2021 | SoCS | Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. | Pavel Surynek |
| 2020 | ICAART | On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. | Pavel Surynek |
| 2020 | ICAART | Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT). | Pavel Surynek |
| 2020 | IROS | Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. | Pavel Surynek |
| 2020 | ICTAI | At-Most-One Constraints in Efficient Representations of Mutex Networks. | Pavel Surynek |
| 2020 | ICTAI | Bounded Suboptimal Token Swapping. | Pavel Surynek |
| 2020 | KI | Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective. | Pavel Surynek |
| 2020 | PRIMA | Mutex Propagation for SAT-based Multi-agent Path Finding. | Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig |
| 2020 | SMC | Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. | Jn Chud, Nestor Popov, Pavel Surynek |
| 2020 | SMC | Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding. | Pavel Surynek |
| 2019 | AAAI | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | IC3K | Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. | Rbert Selvek, Pavel Surynek |
| 2019 | IC3K | Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding. | Rbert Selvek, Pavel Surynek |
| 2019 | ICAART | Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. | Pavel Surynek |
| 2019 | ICAART | Multi-agent Path Finding with Generalized Conflicts: An Experimental Study. | Pavel Surynek |
| 2019 | IJCAI | Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. | Pavel Surynek |
| 2019 | IJCCI | On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. | Vojtech Cahlk, Pavel Surynek |
| 2019 | IROS | Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. | Pavel Surynek |
| 2019 | SoCS | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | SoCS | Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). | Pavel Surynek |
| 2019 | SoCS | Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. | Pavel Surynek |
| 2018 | FlAIRS | Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. | Marika Ivanov, Pavel Surynek, Diep Thi Ngoc Nguyen |
| 2018 | ICAART | Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. | Marika Ivanov, Pavel Surynek, Katsutoshi Hirayama |
| 2018 | IJCAI | Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). | Adi Botea, Davide Bonusi, Pavel Surynek |
| 2018 | ICTAI | Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. | Pavel Surynek |
| 2018 | SoCS | Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. | Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2017 | ICAART | Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. | Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski |
| 2017 | ICAART | Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. | Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski |
| 2017 | ICAART | New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. | Jiri Svancara, Pavel Surynek |
| 2017 | ICTAI | Modeling and Solving the Multi-agent Pathfinding Problem in Picat. | Roman Bartk, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek |
| 2017 | SoCS | Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. | Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek |
| 2017 | SoCS | Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. | Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2016 | ECAI | Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. | Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2016 | SoCS | An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. | Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2015 | AAAI | Multi-Agent Path Finding on Strongly Biconnected Digraphs. | Adi Botea, Pavel Surynek |
| 2015 | IJCAI | Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. | Pavel Surynek |
| 2015 | SoCS | UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. | Pavel Surynek |
| 2014 | IC3K | Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View. | Pavel Surynek, Petra Surynkov |
| 2014 | ICTAI | Adversarial Cooperative Path-Finding: Complexity and Algorithms. | Marika Ivanov, Pavel Surynek |
| 2014 | ICTAI | Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. | Pavel Surynek |
| 2014 | PRICAI | A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. | Pavel Surynek |
| 2013 | AAAI | Adversarial Cooperative Path-Finding: A First View. | Marika Ivanov, Pavel Surynek |
| 2013 | IC3K | A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results. | Pavel Surynek |
| 2013 | IROS | Mutex reasoning in cooperative path finding modeled as propositional satisfiability. | Pavel Surynek |
| 2012 | ECAI | An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors. | Pavel Surynek |
| 2012 | ICMLC | Application of propositional satisfiability to special cases of cooperative path-planning. | Pavel Surynek |
| 2012 | ICMLC | Relocation tasks and a hierarchical subclass. | Pavel Surynek |
| 2012 | ICTAI | Shortening Plans by Local Re-planning. | Toms Balyo, Roman Bartk, Pavel Surynek |
| 2012 | ICTAI | On Propositional Encodings of Cooperative Path-Finding. | Pavel Surynek |
| 2012 | PRICAI | Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. | Pavel Surynek |
| 2012 | SoCS | On Improving Plan Quality via Local Enhancements. | Toms Balyo, Roman Bartk, Pavel Surynek |
| 2012 | SoCS | A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. | Pavel Surynek |
| 2011 | ICTAI | Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. | Pavel Surynek |
| 2010 | AAAI | An Optimization Variant of Multi-Robot Path Planning Is Intractable. | Pavel Surynek |
| 2009 | FlAIRS | Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments. | Pavel Surynek |
| 2009 | ICRA | A novel approach to path planning for multiple robots in bi-connected graphs. | Pavel Surynek |
| 2009 | ICTAI | An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning. | Pavel Surynek |
| 2008 | FlAIRS | Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network. | Pavel Surynek |
| 2007 | FlAIRS | Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. | Pavel Surynek, Roman Bartk |
| 2005 | CP | Encoding HTN Planning as a Dynamic CSP. | Pavel Surynek, Roman Bartk |
| 2005 | FlAIRS | An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. | Roman Bartk, Pavel Surynek |
| 2004 | CP | A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. | Pavel Surynek, Roman Bartk |