Pavel Surynek - RankMe

158 papers A* 12A 13B 40C 7Misc 9Journal 41Unranked 36

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Local Visibility Roadmaps in Continous Multi-Agent Path Finding. ICAART (2) Kristýna Janovská, Pavel Surynek
2026	J	`jnl`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Arithmetic Over the Reals. SN Comput. Sci. Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2026	J	`jnl`	Portfolio of Solving Strategies in CEGAR-based Object Packing and Scheduling for Sequential 3D Printing. CoRR Pavel Surynek
2026	—	`conf`	Recent Progress in Compilation-Based Approaches for Multi-Agent Path Finding. ICAART (4) Pavel Surynek
2026	—	`conf`	SAT-Based Large Neighborhood Search for Multi-Agent Pathfinding. ICAART (1) Max Frommknecht, Pavel Surynek
2025	—	`conf`	A Linear Arithmetic Model Reflecting Vertical Object Details in Object Packing and Scheduling for Sequential 3D Printing. CASE Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis
2025	A*	`conf`	Accessible Hardware Implementation for Multi-Agent Collective Construction. AAAI Martin Rames, Pavel Surynek
2025	A	`conf`	Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver. IROS Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis
2025	J	`jnl`	Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver. CoRR Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis
2024	—	`conf`	A Small 3D Printed Robotic Arm for Teaching Industry 4.0 and Robotic Engineering. CASE Pavel Surynek
2024	—	`conf`	Action Duration Generalization for Exact Multi-Agent Collective Construction. ICAART (3) Martin Rames, Pavel Surynek
2024	B	`conf`	Multi-Agent Path Finding in Continuous Environment. ICTAI Kristýna Janovská, Pavel Surynek
2024	—	`conf`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. ICAART (1) Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2024	J	`jnl`	Multi-agent Path Finding in Continuous Environment. CoRR Kristýna Janovská, Pavel Surynek
2024	B	`conf`	Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). SOCS Pavel Surynek
2024	A	`conf`	Reaching New Heights in Multi-Agent Collective Construction. ECAI Martin Rames, Pavel Surynek
2024	J	`jnl`	Reaching New Heights in Multi-Agent Collective Construction. CoRR Martin Rames, Pavel Surynek
2024	C	`conf`	Solving Multi-Agent Pathfinding with Stochastic Local Search SAT Algorithms. ICINCO (1) Max Frommknecht, Pavel Surynek
2024	B	`conf`	Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). SOCS Irene Saccani, Kristýna Janovská, Pavel Surynek
2024	B	`conf`	Virtual Network Embedding as Boolean Satisfiability. ICTAI Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar
2023	J	`jnl`	Action Duration Generalization for Exact Multi-Agent Collective Construction. CoRR Martin Rames, Pavel Surynek
2023	J	`jnl`	Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation. SN Comput. Sci. Kristýna Janovská, Pavel Surynek
2023	—	`conf`	Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. ICAART (3) Pavel Surynek
2023	J	`jnl`	Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding. CoRR Pavel Surynek
2023	A	`conf`	Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning. IROS Pavel Surynek
2023	J	`jnl`	Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. CoRR Tomás Kolárik, Stefan Ratschan, Pavel Surynek
2023	—	`conf`	Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop. ICINCO (1) Matous Kulhan, Pavel Surynek
2023	Misc	`conf`	Multi-agent Path Finding for Indoor Quadcopters. PAAMS Matous Kulhan, Pavel Surynek
2023	B	`conf`	Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding. ICTAI Pavel Surynek
2023	—	`conf`	Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding. ICINCO (1) Irene Saccani, Kristýna Janovská, Pavel Surynek
2022	B	`conf`	Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). SOCS Kristýna Janovská, Pavel Surynek
2022	—	`conf`	Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques. ICAART (Revised Selected Paper Filip Beskyd, Pavel Surynek
2022	J	`jnl`	Heuristically Guided Compilation for Multi-Agent Path Finding. CoRR Pavel Surynek
2022	—	`conf`	Highways in Warehouse Multi-Agent Path Finding: A Case Study. ICAART (1) Vojtech Rybár, Pavel Surynek
2022	B	`conf`	Lazy Compilation in Classical Planning (Extended Abstract). SOCS Zuzana Fílová, Pavel Surynek
2022	J	`jnl`	Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. J. Artif. Intell. Res. Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner
2022	J	`jnl`	Multi-agent path finding with mutex propagation. Artif. Intell. Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2022	J	`jnl`	Multi-agent pathfinding with continuous time. Artif. Intell. Anton Andreychuk, Konstantin S. Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern
2022	—	`conf`	Parameter Setting in SAT Solver using Machine Learning Techniques. ICAART (2) Filip Beskyd, Pavel Surynek
2022	J	`jnl`	Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters. CoRR Matous Kulhan, Pavel Surynek
2022	A*	`conf`	Problem Compilation for Multi-Agent Path Finding: a Survey. IJCAI Pavel Surynek
2022	B	`conf`	Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). SOCS Pavel Surynek
2021	B	`conf`	Adversarial Multi-Agent Path Finding is Intractable. ICTAI Marika Ivanová, Pavel Surynek
2021	J	`jnl`	Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities. CoRR Pavel Surynek
2021	B	`conf`	Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. SOCS Pavel Surynek
2021	B	`conf`	DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. SOCS Martin Capek, Pavel Surynek
2021	J	`jnl`	DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. CoRR Martin Capek, Pavel Surynek
2021	A*	`conf`	ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. AAAI Ján Chudý, Pavel Surynek
2021	C	`conf`	Hierarchical Control of Swarms during Evacuation. KEOD Kristýna Janovská, Pavel Surynek
2021	A*	`conf`	Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. AAAI Pavel Surynek
2021	B	`conf`	Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. SOCS Pavel Surynek
2021	B	`conf`	Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning. ICTAI Pavel Surynek
2021	A	`conf`	Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. IROS Pavel Surynek
2021	J	`jnl`	Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. CoRR Pavel Surynek
2021	B	`conf`	Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. SOCS Pavel Surynek
2020	B	`conf`	At-Most-One Constraints in Efficient Representations of Mutex Networks. ICTAI Pavel Surynek
2020	J	`jnl`	At-Most-One Constraints in Efficient Representations of Mutex Networks. CoRR Pavel Surynek
2020	A	`conf`	Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. IROS Pavel Surynek
2020	B	`conf`	Bounded Suboptimal Token Swapping. ICTAI Pavel Surynek
2020	—	`conf`	Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT). ICAART (Revised Selected Papers) Pavel Surynek
2020	—	`conf`	Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior. ROBOVIS Ján Chudý, Nestor Popov, Pavel Surynek
2020	B	`conf`	Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. SMC Ján Chudý, Nestor Popov, Pavel Surynek
2020	—	`conf`	Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective. RCAI Pavel Surynek
2020	A*	`conf`	Multi-Agent Path Finding with Mutex Propagation. ICAPS Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar
2020	J	`jnl`	Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. CoRR Pavel Surynek
2020	Misc	`conf`	Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective. KI Pavel Surynek
2020	B	`conf`	Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig
2020	—	`conf`	On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. ICAART (2) Pavel Surynek
2020	J	`jnl`	Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings. CoRR Pavel Surynek
2020	B	`conf`	Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding. SMC Pavel Surynek
2019	—	`conf`	Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. ICAART (2) Pavel Surynek
2019	C	`conf`	Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. KEOD Róbert Selvek, Pavel Surynek
2019	A	`conf`	Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. IROS Pavel Surynek
2019	A*	`conf`	Multi-Agent Path Finding for Large Agents. AAAI Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
2019	B	`conf`	Multi-Agent Path Finding for Large Agents. SOCS Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
2019	J	`jnl`	Multi-Agent Path Finding with Capacity Constraints. CoRR Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2019	B	`conf`	Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). SOCS Pavel Surynek
2019	—	`conf`	Multi-agent Path Finding with Capacity Constraints. AI*IA Pavel Surynek, T. K. Satish Kumar, Sven Koenig
2019	J	`jnl`	Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT). CoRR Pavel Surynek
2019	—	`conf`	Multi-agent Path Finding with Generalized Conflicts: An Experimental Study. ICAART (Revised Selected Papers) Pavel Surynek
2019	C	`conf`	On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. IJCCI Vojtech Cahlík, Pavel Surynek
2019	—	`conf`	On the Tour Towards DPLL(MAPF) and Beyond. DDC@AI*IA Pavel Surynek
2019	J	`jnl`	On the Tour Towards DPLL(MAPF) and Beyond. CoRR Pavel Surynek
2019	B	`ed.`	Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019 SOCS Pavel Surynek, William Yeoh
2019	C	`conf`	Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding. IC3K Róbert Selvek, Pavel Surynek
2019	B	`conf`	Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. SOCS Pavel Surynek
2019	A*	`conf`	Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. IJCAI Pavel Surynek
2018	J	`jnl`	A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach. CoRR Pavel Surynek
2018	—	`conf`	Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. ICAART (1) Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama
2018	B	`conf`	Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. ICTAI Pavel Surynek
2018	J	`jnl`	Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT. CoRR Pavel Surynek
2018	J	`jnl`	Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search. CoRR Pavel Surynek
2018	Misc	`conf`	Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. FLAIRS Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
2018	A*	`conf`	Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). IJCAI Adi Botea, Davide Bonusi, Pavel Surynek
2018	J	`jnl`	Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. Adi Botea, Davide Bonusi, Pavel Surynek
2018	B	`conf`	Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2017	J	`jnl`	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. CoRR Marika Ivanová, Pavel Surynek
2017	—	`conf`	Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. ICAART (2) Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski
2017	A	`conf`	Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS). AAMAS Pavel Surynek, Petr Michalík
2017	J	`jnl`	Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. CoRR Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
2017	B	`conf`	Modeling and Solving the Multi-agent Pathfinding Problem in Picat. ICTAI Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek
2017	B	`conf`	Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2017	J	`jnl`	Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. CoRR Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2017	—	`conf`	New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. ICAART (2) Jiri Svancara, Pavel Surynek
2017	B	`conf`	Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek
2017	J	`jnl`	The joint movement of pebbles in solving the ( N Auton. Agents Multi Agent Syst. Pavel Surynek, Petr Michalík
2017	J	`jnl`	Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Ann. Math. Artif. Intell. Pavel Surynek
2017	—	`conf`	Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. ICAART (Revised Selected Papers) Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski
2016	B	`conf`	An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2016	—	`conf`	Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals. MMCS Petra Surynková, Pavel Surynek
2016	A	`conf`	Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). AAMAS Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2016	A	`conf`	Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. ECAI Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2016	J	`jnl`	Improvements in Sub-optimal Solving of the (N CoRR Pavel Surynek, Petr Michalík
2016	J	`jnl`	Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability. CoRR Pavel Surynek
2015	A*	`conf`	Multi-Agent Path Finding on Strongly Biconnected Digraphs. AAAI Adi Botea, Pavel Surynek
2015	J	`jnl`	On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundam. Informaticae Pavel Surynek
2015	A*	`conf`	Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. IJCAI Pavel Surynek
2015	B	`conf`	UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. SOCS Pavel Surynek
2014	B	`conf`	A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. PRICAI Pavel Surynek
2014	B	`conf`	Adversarial Cooperative Path-Finding: Complexity and Algorithms. ICTAI Marika Ivanová, Pavel Surynek
2014	B	`conf`	Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. ICTAI Pavel Surynek
2014	J	`jnl`	Preprocessing in Propositional Satisfiability Using Bounded (2, Int. J. Artif. Intell. Tools Pavel Surynek
2014	—	`conf`	Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More. MICAI (2) Pavel Surynek
2014	J	`jnl`	Solving Abstract Cooperative Path-Finding in Densely Populated Environments. Comput. Intell. Pavel Surynek
2014	J	`jnl`	The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems. Fundam. Informaticae Pavel Surynek, Petra Surynková, Milos Chromý
2014	C	`conf`	Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View. KEOD Pavel Surynek, Petra Surynková
2013	C	`conf`	A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results. KEOD Pavel Surynek
2013	—	`conf`	Adversarial Cooperative Path-Finding: A First View. AAAI (Late-Breaking Developments) Marika Ivanová, Pavel Surynek
2013	A	`conf`	Mutex reasoning in cooperative path finding modeled as propositional satisfiability. IROS Pavel Surynek
2013	—	`conf`	Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. SARA Pavel Surynek
2013	J	`jnl`	Redundancy Elimination in Highly Parallel solutions of Motion Coordination Problems. Int. J. Artif. Intell. Tools Pavel Surynek
2012	B	`conf`	A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. SOCS Pavel Surynek
2012	A	`conf`	An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors. ECAI Pavel Surynek
2012	Misc	`conf`	Application of propositional satisfiability to special cases of cooperative path-planning. ICMLC Pavel Surynek
2012	B	`conf`	On Improving Plan Quality via Local Enhancements. SOCS Tomás Balyo, Roman Barták, Pavel Surynek
2012	B	`conf`	On Propositional Encodings of Cooperative Path-Finding. ICTAI Pavel Surynek
2012	Misc	`conf`	Relocation tasks and a hierarchical subclass. ICMLC Pavel Surynek
2012	B	`conf`	Shortening Plans by Local Re-planning. ICTAI Tomás Balyo, Roman Barták, Pavel Surynek
2012	B	`conf`	Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. PRICAI Pavel Surynek
2011	J	`jnl`	Automated Classification of Bitmap Images using Decision Trees. Polibits Pavel Surynek, Ivaná Luksová
2011	—	`conf`	Exploiting Global Properties in Path-Consistency Applied on SAT. SCAI Pavel Surynek
2011	B	`conf`	Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. ICTAI Pavel Surynek
2010	A*	`conf`	An Optimization Variant of Multi-Robot Path Planning Is Intractable. AAAI Pavel Surynek
2010	J	`jnl`	Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. Roman Barták, Ondrej Cepek, Pavel Surynek
2009	A*	`conf`	A novel approach to path planning for multiple robots in bi-connected graphs. ICRA Pavel Surynek
2009	B	`conf`	An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning. ICTAI Pavel Surynek
2009	Misc	`conf`	Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments. FLAIRS Pavel Surynek
2008	—	`conf`	Domain-Dependent View of Multiple Robots Path Planning. STAIRS Pavel Surynek
2008	Misc	`conf`	Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network. FLAIRS Pavel Surynek
2007	—	`conf`	A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. CSCLP Pavel Surynek
2007	—	`conf`	Encoding of Planning Problems and Their Optimizations in Linear Logic. INAP/WLP Lukás Chrpa, Pavel Surynek, Jirí Vyskocil
2007	Misc	`conf`	Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS Pavel Surynek, Roman Barták
2007	—	`conf`	Modelling Alternatives in Temporal Networks. CISched Roman Barták, Ondrej Cepek, Pavel Surynek
2007	—	`conf`	Solving Difficult Problems by Viewing them as Structured Dense Graphs. IICAI Pavel Surynek, Lukás Chrpa, Jirí Vyskocil
2007	—	`conf`	Solving Difficult SAT Instances Using Greedy Clique Decomposition. SARA Pavel Surynek
2005	Misc	`conf`	An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS Roman Barták, Pavel Surynek
2005	A	`conf`	Encoding HTN Planning as a Dynamic CSP. CP Pavel Surynek, Roman Barták
2004	A	`conf`	A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP Pavel Surynek, Roman Barták