Skip to content

The Symposium of Combinatorial Search

SoCS

B

CORE rank

CORE rank (raw)

B

Fields of research

Artificial Intelligence

Papers indexed

649

2010–2025

Papers per year

201060 peak2025

SoCS papers

649 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2019Probabilistic Robust Multi-Agent Path Finding.Dor Atzmon, Ariel Felner, Roni Stern
2019Multi-Train Path Finding.Dor Atzmon, Amit Diei, Daniel Rave
2019Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing.Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev
2019A Theoretical Comparison of the Bounds of MM, NBS, and GBFHS.Vidal Alczar, Mike Barley, Patricia J. Riddle
2019Optimal and Bounded-Suboptimal Multi-Agent Motion Planning.Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig
2019A Case Study on the Importance of Low-Level Algorithmic Details in Domain-Independent Heuristics.Ryo Kuroiwa, Alex Fukunaga
2019Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding.Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig
2019Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery.Hang Ma, Wolfgang Hnig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig
2018Fast k-Nearest Neighbor on a Navigation Mesh.Shizhe Zhao, David Taniar, Daniel Damir Harabor
2018Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems.Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar
2018Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs.Tansel Uras, Sven Koenig
2018Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem.Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
2018Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions.Silvan Sievers
2018Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics.Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein
2018Stubborn Sets Pruning for Privacy Preserving Planning.Tim Schulte
2018StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential Diagnosis.Patrick Rodler, Manuel Herold
2018A Neural Network for Decision Making in Real-Time Heuristic Search.Franco Muoz, Miguel Fadic, Carlos Hernndez, Jorge A. Baier
2018Focused SANA: Speeding Up Network Alignment.Ilia Leybovich, Rami Puzis, Roni Stern, Maor Reuben
2018A Suboptimality Bound for 2Benjamn Kramm, Nicolas Rivera, Carlos Hernndez, Jorge A. Baier
2018Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA.Shane Kochvi, Wheeler Ruml
2018Forward Search in Contraction Hierarchies.Daniel Damir Harabor, Peter J. Stuckey
2018Extended Abstract: The Heuristic Search Research Framework.Meir Goldenberg
2018Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning.Maximilian Fickert
2018Position Paper: Using Early Goal Test in A.Ariel Felner
2018Online Refinement of Cartesian Abstraction Heuristics.Rebecca Eifler, Maximilian Fickert
326350 of 649← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.