A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. - Pavel Surynek; Roman Barták (CP, 2004)

Encoding HTN Planning as a Dynamic CSP. - Pavel Surynek; Roman Barták (CP, 2005)

An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. - Roman Barták; Pavel Surynek (FLAIRS, 2005)

Modelling Alternatives in Temporal Networks. - Roman Barták; Ondrej Cepek; Pavel Surynek (CISched, 2007)

A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. - Pavel Surynek (CSCLP, 2007)

Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. - Pavel Surynek; Roman Barták (FLAIRS, 2007)

Solving Difficult Problems by Viewing them as Structured Dense Graphs. - Pavel Surynek; Lukás Chrpa; Jirí Vyskocil (IICAI, 2007)

Solving Difficult SAT Instances Using Greedy Clique Decomposition. - Pavel Surynek (SARA, 2007)

Encoding of Planning Problems and Their Optimizations in Linear Logic. - Lukás Chrpa; Pavel Surynek; Jirí Vyskocil (INAP/WLP, 2007)

Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network. - Pavel Surynek (FLAIRS, 2008)

Domain-Dependent View of Multiple Robots Path Planning. - Pavel Surynek (STAIRS, 2008)

Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments. - Pavel Surynek (FLAIRS, 2009)

A novel approach to path planning for multiple robots in bi-connected graphs. - Pavel Surynek (ICRA, 2009)

An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning. - Pavel Surynek (ICTAI, 2009)

An Optimization Variant of Multi-Robot Path Planning Is Intractable. - Pavel Surynek (AAAI, 2010)

Discovering implied constraints in precedence graphs with alternatives. - Roman Barták; Ondrej Cepek; Pavel Surynek (Ann. Oper. Res., 2010)

Exploiting Global Properties in Path-Consistency Applied on SAT. - Pavel Surynek (SCAI, 2011)

Automated Classification of Bitmap Images using Decision Trees. - Pavel Surynek; Ivaná Luksová (Polibits, 2011)

An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors. - Pavel Surynek (ECAI, 2012)

Application of propositional satisfiability to special cases of cooperative path-planning. - Pavel Surynek (ICMLC, 2012)

Relocation tasks and a hierarchical subclass. - Pavel Surynek (ICMLC, 2012)

Shortening Plans by Local Re-planning. - Tomás Balyo; Roman Barták; Pavel Surynek (ICTAI, 2012)

On Propositional Encodings of Cooperative Path-Finding. - Pavel Surynek (ICTAI, 2012)

Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. - Pavel Surynek (PRICAI, 2012)

On Improving Plan Quality via Local Enhancements. - Tomás Balyo; Roman Barták; Pavel Surynek (SOCS, 2012)

A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. - Pavel Surynek (SOCS, 2012)

Adversarial Cooperative Path-Finding: A First View. - Marika Ivanová; Pavel Surynek (AAAI (Late-Breaking Developments), 2013)

A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results. - Pavel Surynek (KEOD, 2013)

Mutex reasoning in cooperative path finding modeled as propositional satisfiability. - Pavel Surynek (IROS, 2013)

Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. - Pavel Surynek (SARA, 2013)

Redundancy Elimination in Highly Parallel solutions of Motion Coordination Problems. - Pavel Surynek (Int. J. Artif. Intell. Tools, 2013)

Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View. - Pavel Surynek; Petra Surynková (KEOD, 2014)

Adversarial Cooperative Path-Finding: Complexity and Algorithms. - Marika Ivanová; Pavel Surynek (ICTAI, 2014)

Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. - Pavel Surynek (ICTAI, 2014)

Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More. - Pavel Surynek (MICAI (2), 2014)

A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. - Pavel Surynek (PRICAI, 2014)

Solving Abstract Cooperative Path-Finding in Densely Populated Environments. - Pavel Surynek (Comput. Intell., 2014)

The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems. - Pavel Surynek; Petra Surynková; Milos Chromý (Fundam. Informaticae, 2014)

Preprocessing in Propositional Satisfiability Using Bounded (2, k)-Consistency on Regions with a Locally Difficult Constraint Setup. - Pavel Surynek (Int. J. Artif. Intell. Tools, 2014)

Multi-Agent Path Finding on Strongly Biconnected Digraphs. - Adi Botea; Pavel Surynek (AAAI, 2015)

Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. - Pavel Surynek (IJCAI, 2015)

UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. - Pavel Surynek (SOCS, 2015)

On the Complexity of Optimal Parallel Cooperative Path-Finding. - Pavel Surynek (Fundam. Informaticae, 2015)

Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). - Pavel Surynek; Ariel Felner; Roni Stern; Eli Boyarski (AAMAS, 2016)

Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. - Pavel Surynek; Ariel Felner; Roni Stern; Eli Boyarski (ECAI, 2016)

Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals. - Petra Surynková; Pavel Surynek (MMCS, 2016)

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 (SOCS, 2016)

Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability. - Pavel Surynek (CoRR, 2016)

Improvements in Sub-optimal Solving of the (N2-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding. - Pavel Surynek; Petr Michalík (CoRR, 2016)

Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS). - Pavel Surynek; Petr Michalík (AAMAS, 2017)

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 (ICAART (2), 2017)

Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. - Pavel Surynek; Jiri Svancara; Ariel Felner; Eli Boyarski (ICAART (Revised Selected Papers), 2017)

New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. - Jiri Svancara; Pavel Surynek (ICAART (2), 2017)

Modeling and Solving the Multi-agent Pathfinding Problem in Picat. - Roman Barták; Neng-Fa Zhou; Roni Stern; Eli Boyarski; Pavel Surynek (ICTAI, 2017)

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 (SOCS, 2017)

Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. - Pavel Surynek; Ariel Felner; Roni Stern; Eli Boyarski (SOCS, 2017)

The joint movement of pebbles in solving the ( N2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding. - Pavel Surynek; Petr Michalík (Auton. Agents Multi Agent Syst., 2017)

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. - Pavel Surynek (Ann. Math. Artif. Intell., 2017)

Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination. - Marika Ivanová; Pavel Surynek (CoRR, 2017)

Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. - Marika Ivanová; Pavel Surynek; Diep Thi Ngoc Nguyen (FLAIRS, 2018)

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 (ICAART (1), 2018)

Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. - Pavel Surynek (ICTAI, 2018)

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). - Adi Botea; Davide Bonusi; Pavel Surynek (IJCAI, 2018)

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. - Pavel Surynek; Ariel Felner; Roni Stern; Eli Boyarski (SOCS, 2018)

Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search. - Pavel Surynek (CoRR, 2018)

A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach. - Pavel Surynek (CoRR, 2018)

Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. - Adi Botea; Davide Bonusi; Pavel Surynek (J. Artif. Intell. Res., 2018)

Multi-Agent Path Finding for Large Agents. - Jiaoyang Li 001; Pavel Surynek; Ariel Felner; Hang Ma 001; T. K. Satish Kumar; Sven Koenig (AAAI, 2019)

On the Tour Towards DPLL(MAPF) and Beyond. - Pavel Surynek (DDC@AI*IA, 2019)

Multi-agent Path Finding with Capacity Constraints. - Pavel Surynek; T. K. Satish Kumar; Sven Koenig (AI*IA, 2019)

Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. - Róbert Selvek; Pavel Surynek (KEOD, 2019)

Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding. - Róbert Selvek; Pavel Surynek (IC3K, 2019)

Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. - Pavel Surynek (ICAART (2), 2019)

Multi-agent Path Finding with Generalized Conflicts: An Experimental Study. - Pavel Surynek (ICAART (Revised Selected Papers), 2019)

Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. - Pavel Surynek (IJCAI, 2019)

On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. - Vojtech Cahlík; Pavel Surynek (IJCCI, 2019)

Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. - Pavel Surynek (IROS, 2019)

Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). - Pavel Surynek (SOCS, 2019)

Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT). - Pavel Surynek (CoRR, 2019)

On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. - Pavel Surynek (ICAART (2), 2020)

Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT). - Pavel Surynek (ICAART (Revised Selected Papers), 2020)

At-Most-One Constraints in Efficient Representations of Mutex Networks. - Pavel Surynek (ICTAI, 2020)

Bounded Suboptimal Token Swapping. - Pavel Surynek (ICTAI, 2020)

Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. - Pavel Surynek (IROS, 2020)

Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective. - Pavel Surynek (KI, 2020)

Mutex Propagation for SAT-based Multi-agent Path Finding. - Pavel Surynek; Jiaoyang Li 001; Han Zhang 018; T. K. Satish Kumar; Sven Koenig (PRIMA, 2020)

Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective. - Pavel Surynek (RCAI, 2020)

Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior. - Ján Chudý; Nestor Popov; Pavel Surynek (ROBOVIS, 2020)

Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. - Ján Chudý; Nestor Popov; Pavel Surynek (SMC, 2020)

Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding. - Pavel Surynek (SMC, 2020)

Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings. - Pavel Surynek (CoRR, 2020)

ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. - Ján Chudý; Pavel Surynek (AAAI, 2021)

Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. - Pavel Surynek (AAAI, 2021)

Hierarchical Control of Swarms during Evacuation. - Kristýna Janovská; Pavel Surynek (KEOD, 2021)

Adversarial Multi-Agent Path Finding is Intractable. - Marika Ivanová; Pavel Surynek (ICTAI, 2021)

Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning. - Pavel Surynek (ICTAI, 2021)

Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. - Pavel Surynek (IROS, 2021)

DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. - Martin Capek; Pavel Surynek (SOCS, 2021)

Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. - Pavel Surynek (SOCS, 2021)

Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. - Pavel Surynek (SOCS, 2021)

Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities. - Pavel Surynek (CoRR, 2021)

Parameter Setting in SAT Solver using Machine Learning Techniques. - Filip Beskyd; Pavel Surynek (ICAART (2), 2022)

Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques. - Filip Beskyd; Pavel Surynek (ICAART (Revised Selected Paper, 2022)

Highways in Warehouse Multi-Agent Path Finding: A Case Study. - Vojtech Rybár; Pavel Surynek (ICAART (1), 2022)

Problem Compilation for Multi-Agent Path Finding: a Survey. - Pavel Surynek (IJCAI, 2022)

Lazy Compilation in Classical Planning (Extended Abstract). - Zuzana Fílová; Pavel Surynek (SOCS, 2022)

Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). - Kristýna Janovská; Pavel Surynek (SOCS, 2022)

Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). - Pavel Surynek (SOCS, 2022)

Multi-agent pathfinding with continuous time. - Anton Andreychuk; Konstantin S. Yakovlev; Pavel Surynek; Dor Atzmon; Roni Stern (Artif. Intell., 2022)

Multi-agent path finding with mutex propagation. - Han Zhang 018; Jiaoyang Li 001; Pavel Surynek; T. K. Satish Kumar; Sven Koenig (Artif. Intell., 2022)

Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters. - Matous Kulhan; Pavel Surynek (CoRR, 2022)

Heuristically Guided Compilation for Multi-Agent Path Finding. - Pavel Surynek (CoRR, 2022)

Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. - Pavel Surynek; Roni Stern; Eli Boyarski; Ariel Felner (J. Artif. Intell. Res., 2022)

Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. - Pavel Surynek (ICAART (3), 2023)

Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop. - Matous Kulhan; Pavel Surynek (ICINCO (1), 2023)

Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding. - Irene Saccani; Kristýna Janovská; Pavel Surynek (ICINCO (1), 2023)

Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding. - Pavel Surynek (ICTAI, 2023)

Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning. - Pavel Surynek (IROS, 2023)

Multi-agent Path Finding for Indoor Quadcopters. - Matous Kulhan; Pavel Surynek (PAAMS, 2023)

Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding. - Pavel Surynek (CoRR, 2023)

Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation. - Kristýna Janovská; Pavel Surynek (SN Comput. Sci., 2023)

A Small 3D Printed Robotic Arm for Teaching Industry 4.0 and Robotic Engineering. - Pavel Surynek (CASE, 2024)

Reaching New Heights in Multi-Agent Collective Construction. - Martin Rames; Pavel Surynek (ECAI, 2024)

Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. - Tomás Kolárik; Stefan Ratschan; Pavel Surynek (ICAART (1), 2024)

Action Duration Generalization for Exact Multi-Agent Collective Construction. - Martin Rames; Pavel Surynek (ICAART (3), 2024)

Solving Multi-Agent Pathfinding with Stochastic Local Search SAT Algorithms. - Max Frommknecht; Pavel Surynek (ICINCO (1), 2024)

Multi-Agent Path Finding in Continuous Environment. - Kristýna Janovská; Pavel Surynek (ICTAI, 2024)

Virtual Network Embedding as Boolean Satisfiability. - Pavel Surynek; Yi Zheng; Erik Kline; Sven Koenig; T. K. Satish Kumar (ICTAI, 2024)

Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). - Irene Saccani; Kristýna Janovská; Pavel Surynek (SOCS, 2024)

Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). - Pavel Surynek (SOCS, 2024)

Accessible Hardware Implementation for Multi-Agent Collective Construction. - Martin Rames; Pavel Surynek (AAAI, 2025)

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 (CoRR, 2025)