| 2013 | Multi-Agent Path Finding for Self Interested Agents. | Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto |
| 2013 | Invited Speakers. | J. Christopher Beck, Gene Cooperman |
| 2013 | Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). | Hannah Bast, Sabine Storandt |
| 2013 | Fast Detection of Unsolvable Planning Instances Using Local Consistency. | Christer Bckstrm, Peter Jonsson, Simon Sthlberg |
| 2013 | Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. | Alejandro Arbelaez, Luis Quesada |
| 2013 | An Analysis Framework for Examination Timetabling. | Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim |
| 2013 | Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract). | Faten Aljalaud, Nathan R. Sturtevant |
| 2013 | Anytime Truncated D* : Anytime Replanning with Truncation. | Sandip Aine, Maxim Likhachev |
| 2012 | Adaptive Parallelization for Constraint Satisfaction Search. | Xi Yun, Susan L. Epstein |
| 2012 | When Does Weighted A* Fail? | Christopher Makoto Wilt, Wheeler Ruml |
| 2012 | Subdimensional Expansion and Optimal Task Reassignment. | Glenn Wagner, Howie Choset, Nora Ayanian |
| 2012 | Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract. | Paul Vernaza, Venkatraman Narayanan, Maxim Likhachev |
| 2012 | Alternative Forms of Bounded Suboptimal Search. | Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern |
| 2012 | Subgoal Graphs for Eight-Neighbor Gridworlds. | Tansel Uras, Sven Koenig, Carlos Hernndez |
| 2012 | MCTS Based on Simple Rerget. | David Tolpin, Solomon Eyal Shimony |
| 2012 | Are We There Yet? - Estimating Search Progress. | Jordan Tyler Thayer, Roni Stern, Levi H. S. Lelis |
| 2012 | Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. | Jordan Tyler Thayer, J. Benton, Malte Helmert |
| 2012 | A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints. | Pavel Surynek |
| 2012 | Search-Aware Conditions for Probably Approximately Correct Heuristic Search. | Roni Tzvi Stern, Ariel Felner, Robert C. Holte |
| 2012 | Efficient Implementation of Pattern Database Heuristics for Classical Planning. | Silvan Sievers, Manuela Ortlieb, Malte Helmert |
| 2012 | Conflict-Based Search for Optimal Multi-Agent Path Finding. | Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant |
| 2012 | Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. | Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant |
| 2012 | Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives. | Qandeel Sajid, Ryan Luna, Kostas E. Bekris |
| 2012 | Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). | Gabriele Rger, Malte Helmert |
| 2012 | Bidirectional A* Search with Additive Approximation Bounds. | Michael N. Rice, Vassilis J. Tsotras |