| 2018 | A Regression-Based Methodology for Online Algorithm Selection. | Hans Degroote, Patrick De Causmaecker, Bernd Bischl, Lars Kotthoff |
| 2018 | Benchmarks for Pathfinding in 3D Voxel Space. | Daniel Brewer, Nathan R. Sturtevant |
| 2018 | On the Complexity of Quantum Circuit Compilation. | Adi Botea, Akihiro Kishimoto, Radu Marinescu |
| 2018 | GBFHS: A Generalized Breadth-First Heuristic Search Algorithm. | Michael W. Barley, Patricia J. Riddle, Carlos Linares Lpez, Sean Dobson, Ira Pohl |
| 2018 | Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. | Toms Balyo, Luks Chrpa |
| 2018 | A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2018 | Bounded Suboptimal Game Tree Search. | Dor Atzmon, Roni Stern, Abdallah Saffidine |
| 2018 | Robust Multi-Agent Path Finding. | Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartk, Neng-Fa Zhou |
| 2018 | Untitled record | Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar |
| 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 |
| 2017 | A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2017 | Improving a Planner's Performance through Online Heuristic Configuration of Domain Models. | Mauro Vallati, Luks Chrpa, Thomas Leo McCluskey |
| 2017 | An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle. | Richard Anthony Valenzano, Danniel Sihui Yang |
| 2017 | Feasibility Study: Subgoal Graphs on State Lattices. | Tansel Uras, Sven Koenig |
| 2017 | Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. | Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski |
| 2017 | Shortest Path for K Goals. | Roni Tzvi Stern, Meir Goldenberg, Ariel Felner |
| 2017 | Strengthening Canonical Pattern Databases with Structural Symmetries. | Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz |
| 2017 | Better Orders for Saturated Cost Partitioning in Optimal Classical Planning. | Jendrik Seipp |
| 2017 | The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search. | Eshed Shaham, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant |
| 2017 | Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA. | Francesco Percassi, Alfonso Emilio Gerevini, Hector Geffner |
| 2017 | Optimal Solutions to Large Logistics Planning Domain Problems. | Gerald Paul, Gabriele Rger, Thomas Keller, Malte Helmert |
| 2017 | Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths. | Shunhao Oh, Hon Wai Leong |
| 2017 | Boost SAT Solver with Hybrid Branching Heuristic. | Seongsoo Moon, Mary Inaba |
| 2017 | Fast and Almost Optimal Any-Angle Pathfinding Using the 2 | Nicols Hormazbal, Antonio Daz, Carlos Hernndez, Jorge A. Baier |
| 2017 | Block-Parallel IDA* for GPUs. | Satoru Horie, Alex S. Fukunaga |