| 2026 | FlAIRS | Ghost Agents in SAT-based Models for Multi-Agent Pathfinding. | Jir Svancara, Roman Bartk |
| 2025 | ICAART | Generating Safe Policies for Multi-Agent Path Finding with Temporal Uncertainty. | Jir Svancara, David Zahrdka, Mrinalini Subramanian, Roman Bartk, Miroslav Kulich |
| 2025 | ICAART | Towards Holistic Approach to Robust Execution of MAPF Plans. | David Zahrdka, Denisa Muzkov, Miroslav Kulich, Jir Svancara, Roman Bartk |
| 2025 | ICAART | A Holistic Architecture for Monitoring and Optimization of Robust Multi-agent Path Finding Plan Execution. | David Zahrdka, Denisa Muzkov, David Woller, Miroslav Kulich, Jir Svancara, Roman Bartk |
| 2025 | SoCS | On Path Selection for Reduction-Based Solving of Multi-Agent Pathfinding Using Graph Pruning. | Matej Husr, Jir Svancara, Roman Bartk |
| 2024 | FlAIRS | The Effectiveness of Autonomous Intersections in a City. | Elis Cizl, Jir Svancara, Roman Bartk |
| 2024 | ICAART | Improving the Sum-of-Cost Methods for Reduction-Based Multi-Agent Pathfinding Solvers. | Roland Kaminski, Torsten Schaub, Klaus Strauch, Jir Svancara |
| 2024 | ICAART | Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends. | Jir Svancara, Dor Atzmon, Klaus Strauch, Roland Kaminski, Torsten Schaub |
| 2023 | ICAART | Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? | Jir Svancara, Philipp Obermeier, Matej Husr, Roman Bartk, Torsten Schaub |
| 2023 | SoCS | Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. | Jir Svancara, Etienne Tignon, Roman Bartk, Torsten Schaub, Philipp Wanko, Roland Kaminski |
| 2022 | ICAART | Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling. | Jir Svancara, Roman Bartk |
| 2022 | ICAART | Coordinated Collision-free Movement of Groups of Agents. | Jir Svancara, Marika Ivanov, Roman Bartk |
| 2022 | SoCS | Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). | Jir Svancara, Philipp Obermeier, Matej Husr, Roman Bartk, Torsten Schaub |
| 2021 | FlAIRS | Colored Multi-Agent Path Finding: Solving Approaches. | Roman Bartk, Marika Ivanov, Jir Svancara |
| 2021 | SoCS | From Classical to Colored Multi-Agent Path Finding. | Roman Bartk, Marika Ivanov, Jir Svancara |
| 2020 | AAAI | MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots. | Roman Bartk, Jir Svancara, Ivan Krasicenko |
| 2020 | ICAART | What Does Multi-agent Path-finding Tell Us About Intelligent Intersections. | Vera Skopkov, Roman Bartk, Jir Svancara |
| 2020 | ICTAI | On Modelling Multi-Agent Path Finding as a Classical Planning Problem. | Jindrich Vodrzka, Roman Bartk, Jir Svancara |
| 2020 | SoCS | On Modelling Multi-Agent Path Finding as a Classical Planning Problem. | Jindrich Vodrzka, Roman Bartk, Jir Svancara |
| 2019 | AAAI | Online Multi-Agent Pathfinding. | Jir Svancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Bartk |
| 2019 | ICAART | Combining Strengths of Optimal Multi-Agent Path Finding Algorithms. | Jir Svancara, Roman Bartk |
| 2019 | IJCAI | Multi-Agent Path Finding on Ozobots. | Roman Bartk, Ivan Krasicenko, Jir Svancara |
| 2019 | SoCS | On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. | Roman Bartk, Jir Svancara |
| 2018 | IJCAI | Bringing Multi-agent Path Finding Closer to Reality. | Jir Svancara |