| 2018 | A Neural Network for Decision Making in Real-Time Heuristic Search. Franco Muñoz, Miguel Fadic, Carlos Hernández, Jorge A. Baier |
| 2018 | A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. Christer Bäckström, Peter Jonsson, Sebastian Ordyniak |
| 2018 | A Regression-Based Methodology for Online Algorithm Selection. Hans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff |
| 2018 | A Suboptimality Bound for 2 Benjamín Kramm, Nicolas Rivera, Carlos Hernández, Jorge A. Baier |
| 2018 | Benchmarks for Pathfinding in 3D Voxel Space. Daniel Brewer, Nathan R. Sturtevant |
| 2018 | Bounded Suboptimal Game Tree Search. Dor Atzmon, Roni Stern, Abdallah Saffidine |
| 2018 | Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA. Shane Kochvi, Wheeler Ruml |
| 2018 | Extended Abstract: The Heuristic Search Research Framework. Meir Goldenberg |
| 2018 | Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. Tansel Uras, Sven Koenig |
| 2018 | Fast k-Nearest Neighbor on a Navigation Mesh. Shizhe Zhao, David Taniar, Daniel Damir Harabor |
| 2018 | Focused SANA: Speeding Up Network Alignment. Ilia Leybovich, Rami Puzis, Roni Stern, Maor Reuben |
| 2018 | Forward Search in Contraction Hierarchies. Daniel Damir Harabor, Peter J. Stuckey |
| 2018 | GBFHS: A Generalized Breadth-First Heuristic Search Algorithm. Michael W. Barley, Patricia J. Riddle, Carlos Linares López, Sean Dobson, Ira Pohl |
| 2018 | Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning. Maximilian Fickert |
| 2018 | Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions. Silvan Sievers |
| 2018 | Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar |
| 2018 | Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, Jeffrey S. Rosenschein |
| 2018 | On the Complexity of Quantum Circuit Compilation. Adi Botea, Akihiro Kishimoto, Radu Marinescu |
| 2018 | Online Refinement of Cartesian Abstraction Heuristics. Rebecca Eifler, Maximilian Fickert |
| 2018 | Position Paper: Using Early Goal Test in A. Ariel Felner |
| 2018 | Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14-15 July 2018 Vadim Bulitko, Sabine Storandt |
| 2018 | Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar |
| 2018 | Robust Multi-Agent Path Finding. Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou |
| 2018 | StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential Diagnosis. Patrick Rodler, Manuel Herold |
| 2018 | Stubborn Sets Pruning for Privacy Preserving Planning. Tim Schulte |
| 2018 | Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2018 | Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. Tomás Balyo, Lukás Chrpa |