default search action
Pavel Surynek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c107]Pavel Surynek:
A Small 3D Printed Robotic Arm for Teaching Industry 4.0 and Robotic Engineering. CASE 2024: 2274-2280 - [c106]Martin Rames, Pavel Surynek
:
Reaching New Heights in Multi-Agent Collective Construction. ECAI 2024: 3644-3651 - [c105]Tomás Kolárik, Stefan Ratschan, Pavel Surynek:
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. ICAART (1) 2024: 47-58 - [c104]Martin Rames, Pavel Surynek:
Action Duration Generalization for Exact Multi-Agent Collective Construction. ICAART (3) 2024: 718-725 - [c103]Irene Saccani, Kristýna Janovská, Pavel Surynek:
Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). SOCS 2024: 281-282 - [c102]Pavel Surynek:
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 287-288 - [i24]Martin Rames, Pavel Surynek:
Reaching New Heights in Multi-Agent Collective Construction. CoRR abs/2408.13615 (2024) - [i23]Kristýna Janovská, Pavel Surynek:
Multi-agent Path Finding in Continuous Environment. CoRR abs/2409.10680 (2024) - 2023
- [j14]Kristýna Janovská, Pavel Surynek
Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation. SN Comput. Sci. 4(1): 38 (2023) - [c101]Pavel Surynek:
Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. ICAART (3) 2023: 517-524 - [c100]Matous Kulhan, Pavel Surynek:
Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop. ICINCO (1) 2023: 221-228 - [c99]Irene Saccani, Kristýna Janovská, Pavel Surynek:
Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding. ICINCO (1) 2023: 258-265 - [c98]Pavel Surynek:
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding. ICTAI 2023: 333-340 - [c97]Pavel Surynek:
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning. IROS 2023: 7341-7347 - [c96]Matous Kulhan, Pavel Surynek
Multi-agent Path Finding for Indoor Quadcopters. PAAMS 2023: 409-414 - [i22]Pavel Surynek:
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding. CoRR abs/2301.08687 (2023) - [i21]Tomás Kolárik, Stefan Ratschan, Pavel Surynek:
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. CoRR abs/2312.08051 (2023) - [i20]Martin Rames, Pavel Surynek:
Action Duration Generalization for Exact Multi-Agent Collective Construction. CoRR abs/2312.13485 (2023) - 2022
- [j13]Anton Andreychuk, Konstantin S. Yakovlev
Multi-agent pathfinding with continuous time. Artif. Intell. 305: 103662 (2022) - [j12]Han Zhang
Multi-agent path finding with mutex propagation. Artif. Intell. 311: 103766 (2022) - [j11]Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner:
Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. J. Artif. Intell. Res. 73: 553-618 (2022) - [c95]Filip Beskyd
Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques. ICAART (Revised Selected Paper 2022: 169-200 - [c94]Vojtech Rybár, Pavel Surynek:
Highways in Warehouse Multi-Agent Path Finding: A Case Study. ICAART (1) 2022: 274-281 - [c93]Filip Beskyd
Parameter Setting in SAT Solver using Machine Learning Techniques. ICAART (2) 2022: 586-597 - [c92]Pavel Surynek:
Problem Compilation for Multi-Agent Path Finding: a Survey. IJCAI 2022: 5615-5622 - [c91]Zuzana Fílová, Pavel Surynek:
Lazy Compilation in Classical Planning (Extended Abstract). SOCS 2022: 270-272 - [c90]Kristýna Janovská, Pavel Surynek:
Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). SOCS 2022: 294-296 - [c89]Pavel Surynek:
Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). SOCS 2022: 317-319 - [i19]Matous Kulhan, Pavel Surynek:
Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters. CoRR abs/2207.01752 (2022) - [i18]Pavel Surynek:
Heuristically Guided Compilation for Multi-Agent Path Finding. CoRR abs/2212.06940 (2022) - 2021
- [c88]Pavel Surynek:
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. AAAI 2021: 12409-12417 - [c87]Ján Chudý
ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. AAAI 2021: 16014-16016 - [c86]Kristýna Janovská
Hierarchical Control of Swarms during Evacuation. KEOD 2021: 61-73 - [c85]Pavel Surynek:
Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning. ICTAI 2021: 91-96 - [c84]Marika Ivanová, Pavel Surynek:
Adversarial Multi-Agent Path Finding is Intractable. ICTAI 2021: 481-486 - [c83]Pavel Surynek:
Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. IROS 2021: 7931-7938 - [c82]Martin Capek, Pavel Surynek:
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. SOCS 2021: 153-155 - [c81]Pavel Surynek:
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. SOCS 2021: 197-199 - [c80]Pavel Surynek:
Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. SOCS 2021: 200-202 - [c79]Pavel Surynek:
Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. SOCS 2021: 203-205 - [i17]Pavel Surynek:
Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. CoRR abs/2103.04496 (2021) - [i16]Pavel Surynek:
Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities. CoRR abs/2104.11809 (2021) - [i15]Martin Capek, Pavel Surynek:
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. CoRR abs/2111.06494 (2021) - 2020
- [c78]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c77]Pavel Surynek:
On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. ICAART (2) 2020: 182-193 - [c76]Pavel Surynek
Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT). ICAART (Revised Selected Papers) 2020: 399-420 - [c75]Pavel Surynek:
At-Most-One Constraints in Efficient Representations of Mutex Networks. ICTAI 2020: 170-177 - [c74]Pavel Surynek:
Bounded Suboptimal Token Swapping. ICTAI 2020: 1233-1240 - [c73]Pavel Surynek:
Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. IROS 2020: 11631-11637 - [c72]Pavel Surynek
Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective. KI 2020: 219-232 - [c71]Pavel Surynek
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA 2020: 248-258 - [c70]Pavel Surynek
Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective. RCAI 2020: 85-99 - [c69]Ján Chudý
Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior. ROBOVIS 2020: 28-38 - [c68]Pavel Surynek:
Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding. SMC 2020: 3006-3012 - [c67]Ján Chudý
Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. SMC 2020: 3998-4005 - [i14]Pavel Surynek:
Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings. CoRR abs/2004.13477 (2020) - [i13]Pavel Surynek:
At-Most-One Constraints in Efficient Representations of Mutex Networks. CoRR abs/2006.05962 (2020) - [i12]Pavel Surynek:
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. CoRR abs/2009.05161 (2020)
2010 – 2019
- 2019
- [c66]Jiaoyang Li, Pavel Surynek
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c65]Pavel Surynek:
On the Tour Towards DPLL(MAPF) and Beyond. DDC@AI*IA 2019: 74-83 - [c64]Pavel Surynek
Multi-agent Path Finding with Capacity Constraints. AI*IA 2019: 235-249 - [c63]Róbert Selvek, Pavel Surynek:
Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. KEOD 2019: 137-143 - [c62]Róbert Selvek, Pavel Surynek
Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding. IC3K 2019: 302-321 - [c61]Pavel Surynek
Multi-agent Path Finding with Generalized Conflicts: An Experimental Study. ICAART (Revised Selected Papers) 2019: 118-142 - [c60]Pavel Surynek:
Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. ICAART (2) 2019: 192-203 - [c59]Pavel Surynek
Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. IJCAI 2019: 1177-1183 - [c58]Vojtech Cahlík
On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. IJCCI 2019: 473-478 - [c57]Pavel Surynek:
Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. IROS 2019: 3282-3287 - [c56]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c55]Pavel Surynek:
Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). SOCS 2019: 200-201 - [c54]Pavel Surynek:
Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. SOCS 2019: 202-203 - [e1]Pavel Surynek, William Yeoh:
Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019. AAAI Press 2019, ISBN 978-1-57735-808-4 [contents] - [i11]Pavel Surynek:
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT). CoRR abs/1903.09820 (2019) - [i10]Pavel Surynek:
On the Tour Towards DPLL(MAPF) and Beyond. CoRR abs/1907.07631 (2019) - [i9]Pavel Surynek, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Capacity Constraints. CoRR abs/1907.12648 (2019) - 2018
- [j10]Adi Botea, Davide Bonusi, Pavel Surynek:
Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. 62: 273-314 (2018) - [c53]Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen:
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. FLAIRS 2018: 348-353 - [c52]Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama:
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) 2018: 184-191 - [c51]Pavel Surynek:
Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. ICTAI 2018: 592-599 - [c50]Adi Botea, Davide Bonusi, Pavel Surynek:
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). IJCAI 2018: 5563-5567 - [c49]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS 2018: 99-105 - [i8]Pavel Surynek:
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT. CoRR abs/1806.09487 (2018) - [i7]Pavel Surynek:
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search. CoRR abs/1809.05959 (2018) - [i6]Pavel Surynek:
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach. CoRR abs/1812.10851 (2018) - 2017
- [j9]Pavel Surynek
The joint movement of pebbles in solving the ( N2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding. Auton. Agents Multi Agent Syst. 31(3): 715-763 (2017) - [j8]Pavel Surynek
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Ann. Math. Artif. Intell. 81(3-4): 329-375 (2017) - [c48]Pavel Surynek, Petr Michalík:
Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS). AAMAS 2017: 856-857 - [c47]Pavel Surynek, Jiri Svancara
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. ICAART (2) 2017: 85-95 - [c46]Pavel Surynek
Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. ICAART (Revised Selected Papers) 2017: 116-136 - [c45]Jiri Svancara
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. ICAART (2) 2017: 451-458 - [c44]Roman Barták
Modeling and Solving the Multi-agent Pathfinding Problem in Picat. ICTAI 2017: 959-966 - [c43]Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek:
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS 2017: 29-37 - [c42]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS 2017: 169-170 - [i5]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. CoRR abs/1707.00228 (2017) - [i4]Marika Ivanová, Pavel Surynek:
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 abs/1708.07285 (2017) - [i3]Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen:
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. CoRR abs/1709.01070 (2017) - 2016
- [c41]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). AAMAS 2016: 1435-1436 - [c40]Pavel Surynek
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. ECAI 2016: 810-818 - [c39]Petra Surynková, Pavel Surynek
Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals. MMCS 2016: 296-311 - [c38]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS 2016: 145-146 - [i2]Pavel Surynek, Petr Michalík:
Improvements in Sub-optimal Solving of the (N2-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding. CoRR abs/1610.04964 (2016) - [i1]Pavel Surynek:
Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability. CoRR abs/1610.05452 (2016) - 2015
- [j7]Pavel Surynek
On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundam. Informaticae 137(4): 517-548 (2015) - [c37]Adi Botea, Pavel Surynek:
Multi-Agent Path Finding on Strongly Biconnected Digraphs. AAAI 2015: 2024-2030 - [c36]Pavel Surynek:
Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. IJCAI 2015: 1916-1922 - [c35]Pavel Surynek:
UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding. SOCS 2015: 236-237 - 2014
- [j6]Pavel Surynek
Solving Abstract Cooperative Path-Finding in Densely Populated Environments. Comput. Intell. 30(2): 402-450 (2014) - [j5]Pavel Surynek
The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems. Fundam. Informaticae 135(3): 295-308 (2014) - [j4]Pavel Surynek
Preprocessing in Propositional Satisfiability Using Bounded (2, k)-Consistency on Regions with a Locally Difficult Constraint Setup. Int. J. Artif. Intell. Tools 23(1) (2014) - [c34]Pavel Surynek, Petra Surynková:
Theoretical Challenges in Knowledge Discovery in Big Data - A Logic Reasoning and a Graph Theoretical Point of View. KEOD 2014: 327-332 - [c33]Marika Ivanová, Pavel Surynek
Adversarial Cooperative Path-Finding: Complexity and Algorithms. ICTAI 2014: 75-82 - [c32]Pavel Surynek
Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. ICTAI 2014: 875-882 - [c31]Pavel Surynek:
Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More. MICAI (2) 2014: 410-425 - [c30]Pavel Surynek:
A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well. PRICAI 2014: 827-833 - 2013
- [j3]Pavel Surynek
Redundancy Elimination in Highly Parallel solutions of Motion Coordination Problems. Int. J. Artif. Intell. Tools 22(5) (2013) - [c29]Marika Ivanová, Pavel Surynek:
Adversarial Cooperative Path-Finding: A First View. AAAI (Late-Breaking Developments) 2013 - [c28]Pavel Surynek:
A Survey of Collaborative Web Search - Through Collaboration among Search Engine Users to More Relevant Results. KEOD 2013: 331-336 - [c27]Pavel Surynek
Mutex reasoning in cooperative path finding modeled as propositional satisfiability. IROS 2013: 4326-4331 - [c26]Pavel Surynek:
Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases. SARA 2013 - 2012
- [c25]Pavel Surynek
An Alternative Eager Encoding of the All-Different Constraint over Bit-Vectors. ECAI 2012: 927-928 - [c24]Pavel Surynek
Application of propositional satisfiability to special cases of cooperative path-planning. ICMLC 2012: 507-512 - [c23]Pavel Surynek
Relocation tasks and a hierarchical subclass. ICMLC 2012: 666-669 - [c22]Pavel Surynek
On Propositional Encodings of Cooperative Path-Finding. ICTAI 2012: 524-531 - [c21]Tomás Balyo, Roman Barták
Shortening Plans by Local Re-planning. ICTAI 2012: 1022-1028 - [c20]Pavel Surynek
Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. PRICAI 2012: 564-576 - [c19]Tomás Balyo, Roman Barták, Pavel Surynek:
On Improving Plan Quality via Local Enhancements. SOCS 2012: 154-156 - [c18]Pavel Surynek:
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. SOCS 2012: 191-192 - 2011
- [j2]Pavel Surynek, Ivaná Luksová
Automated Classification of Bitmap Images using Decision Trees. Polibits 44: 11-18 (2011) - [c17]Pavel Surynek
Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems. ICTAI 2011: 701-708 - [c16]Pavel Surynek
Exploiting Global Properties in Path-Consistency Applied on SAT. SCAI 2011: 90-99 - 2010
- [j1]Roman Barták
Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. 180(1): 233-263 (2010) - [c15]Pavel Surynek:
An Optimization Variant of Multi-Robot Path Planning Is Intractable. AAAI 2010: 1261-1263
2000 – 2009
- 2009
- [c14]Pavel Surynek:
Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments. FLAIRS 2009 - [c13]Pavel Surynek
A novel approach to path planning for multiple robots in bi-connected graphs. ICRA 2009: 3613-3619 - [c12]Pavel Surynek
An Application of Pebble Motion on Graphs to Abstract Multi-robot Path Planning. ICTAI 2009: 151-158 - 2008
- [c11]Pavel Surynek:
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network. FLAIRS 2008: 561-566 - [c10]Pavel Surynek
Domain-Dependent View of Multiple Robots Path Planning. STAIRS 2008: 175-186 - 2007
- [c9]Roman Barták
Modelling Alternatives in Temporal Networks. CISched 2007: 129-136 - [c8]Pavel Surynek:
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. CSCLP 2007: 142-157 - [c7]Pavel Surynek, Roman Barták:
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS 2007: 134-139 - [c6]Pavel Surynek, Lukás Chrpa, Jirí Vyskocil:
Solving Difficult Problems by Viewing them as Structured Dense Graphs. IICAI 2007: 84-103 - [c5]Pavel Surynek:
Solving Difficult SAT Instances Using Greedy Clique Decomposition. SARA 2007: 359-374 - [c4]Lukás Chrpa, Pavel Surynek
Encoding of Planning Problems and Their Optimizations in Linear Logic. INAP/WLP 2007: 54-68 - 2005
- [c3]Pavel Surynek
Encoding HTN Planning as a Dynamic CSP. CP 2005: 868 - [c2]Roman Barták, Pavel Surynek:
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS 2005: 161-166 - 2004
- [c1]Pavel Surynek, Roman Barták:
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP 2004: 767-771
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: