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
2022Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract).Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi
2022Portability and Explainability of Synthesized Formula-based Heuristics.Vadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis
2022Iterative-Deepening Uniform-Cost Heuristic Search.Zhaoxing Bu, Richard E. Korf
2022On Merging Agents in Multi-Agent Pathfinding Algorithms.Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig
2022Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract).Jorge A. Baier, Nicols Rivera, Carlos Hernndez Ulloa
2022Weight Constrained Path Finding with Bidirectional A.Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby
2022Scaling-Up Generalized Planning as Heuristic Search with Landmarks.Javier Segovia-Aguas, Sergio Jimnez Celorrio, Laura Sebasti, Anders Jonsson
2022On Producing Shortest Cost-Optimal Plans.Michael Katz, Gabriele Rger, Malte Helmert
2021A Hierarchical Approach to Multi-Agent Path Finding.Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig
2021Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search.Tamir Yaffe, Shawn Skyler, Ariel Felner
2021Multi-Agent Pickup and Delivery with Task Deadlines.Xiaohu Wu, Yihao Liu, Xueyan Tang, Wentong Cai, Funing Bai, Gilbert Khonstantine, Guopeng Zhao
2021Landmark Heuristics for Lifted Planning - Extended Abstract.Julia Wichlacz, Daniel Hller, Jrg Hoffmann
2021Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation.David Vainshtein, Oren Salzman
2021Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT.Pavel Surynek
2021Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories.Pavel Surynek
2021Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering.Pavel Surynek
2021How to Speed-Up the Automated Configuration of Optimization Algorithms.Marcelo de Souza
2021Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory.Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant
2021Meta-level Techniques for Planning, Search, and Scheduling.Shahaf S. Shperberg
2021Solving Sokoban with Forward-Backward Reinforcement Learning.Yaron Shoham, Gal Elidan
2021Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning.Toms Rybeck, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev
2021Linear-Space Best-First Diagnosis Search.Patrick Rodler
2021SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems.Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel
2021Learning-Based Synthesis of Social Laws in STRIPS.Ronen Nir, Alexander Shleyfman, Erez Karpas
2021Explainable Problem in clingo-dl Programs.Van Nguyen, Tran Cao Son, William Yeoh
201225 of 649← PreviousNext →

Comparable venues

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