| 2011 | A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems. | Morteza Keshtkaran, Roohollah Taghizadeh, Koorush Ziarati |
| 2011 | A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. | Tatsuya Imai, Akihiro Kishimoto |
| 2011 | Optimal Packing of High-Precision Rectangles. | Eric Huang, Richard E. Korf |
| 2011 | Real-Time Adaptive A* with Depression Avoidance. | Carlos Hernndez, Jorge A. Baier |
| 2011 | Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces. | Juan Pablo Gonzalez, Maxim Likhachev |
| 2011 | The Compressed Differential Heuristic. | Meir Goldenberg, Nathan R. Sturtevant, Ariel Felner, Jonathan Schaeffer |
| 2011 | Path Planning with Adaptive Dimensionality. | Kalin Gochev, Benjamin J. Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev |
| 2011 | Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. | Ariel Felner |
| 2011 | Evolving Solvers for FreeCell and the Sliding-Tile Puzzle. | Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, Moshe Sipper |
| 2011 | Deadline-Aware Search Using On-Line Measures of Behavior. | Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml |
| 2011 | Automatic Move Pruning in General Single-Player Games. | Neil Burch, Robert C. Holte |
| 2011 | Repeated-Task Canadian Traveler Problem. | Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony |
| 2011 | Degrees of Separation in Social Networks. | Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer |
| 2011 | All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. | Christer Bckstrm, Peter Jonsson |
| 2011 | Adapting a Rapidly-Exploring Random Tree for Automated Planning. | Vidal Alczar, Manuela M. Veloso, Daniel Borrajo |
| 2010 | Edge Partitioning in Parallel Structured Duplicate Detection. | Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun |
| 2010 | Preface. | |
| 2010 | SoCS 2010 Organization. | |
| 2010 | A Comparison of Greedy Search Algorithms. | Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml |
| 2010 | Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. | Vincent Vidal, Lucas Bordeaux, Youssef Hamadi |
| 2010 | Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. | Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto |
| 2010 | Anytime Heuristic Search: Frameworks and Algorithms. | Jordan Tyler Thayer, Wheeler Ruml |
| 2010 | Finding Acceptable Solutions Faster Using Inadmissible Information. | Jordan Tyler Thayer, Wheeler Ruml |
| 2010 | Directed Plateau Search for MAX-k-SAT. | Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley |
| 2010 | Potential Search: A New Greedy Anytime Heuristic Search. | Roni Tzvi Stern, Rami Puzis, Ariel Felner |