Necessary Observations in Nondeterministic Planning. - David Speck 001; Manuela Ortlieb; Robert Mattmüller (KI, 2015)

Shakey 2016 - How Much Does it Take to Redo Shakey the Robot? - David Speck 001; Christian Dornhege; Wolfram Burgard (IEEE Robotics Autom. Lett., 2017)

Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams. - David Speck 001; Florian Geißer; Robert Mattmüller (ICAPS, 2018)

Symbolic Planning with Axioms. - David Speck 001; Florian Geißer; Robert Mattmüller; Álvaro Torralba (ICAPS, 2019)

An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning. - Sumitra Corraya; Florian Geißer; David Speck 001; Robert Mattmüller (KI, 2019)

Symbolic Top-k Planning. - David Speck 001; Robert Mattmüller; Bernhard Nebel (AAAI, 2020)

When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search. - David Speck 001; Florian Geißer; Robert Mattmüller (ICAPS, 2020)

Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. - Florian Geißer; David Speck 001; Thomas Keller 001 (SOCS, 2020)

Symbolic Search for Oversubscription Planning. - David Speck 001; Michael Katz 001 (AAAI, 2021)

Symbolic Search for Optimal Total-Order HTN Planning. - Gregor Behnke; David Speck 001 (AAAI, 2021)

Learning Heuristic Selection with Dynamic Algorithm Configuration. - David Speck 001; André Biedenkapp; Frank Hutter; Robert Mattmüller; Marius Lindauer (ICAPS, 2021)

On the Compilability and Expressive Power of State-Dependent Action Costs. - David Speck 001; David Borukhson; Robert Mattmüller; Bernhard Nebel (ICAPS, 2021)

Subset-Saturated Transition Cost Partitioning. - Dominik Drexler; Jendrik Seipp; David Speck 001 (ICAPS, 2021)

New Refinement Strategies for Cartesian Abstractions. - David Speck 001; Jendrik Seipp (ICAPS, 2022)

Loopless Top-K Planning. - Julian von Tschammer; Robert Mattmüller; David Speck 001 (ICAPS, 2022)

On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE. - Kilian Hu; David Speck 001 (SOCS, 2022)

Symbolic Search for Optimal Planning with Expressive Extensions. - David Speck 001 (CoRR, 2022)

Symbolic search for optimal planning with expressive extensions - David Speck 001 (2022)

Finding Matrix Multiplication Algorithms with Classical Planning. - David Speck 001; Paul Höft; Daniel Gnad 001; Jendrik Seipp (ICAPS, 2023)

On Partial Satisfaction Planning with Total-Order HTNs. - Gregor Behnke; David Speck 001; Michael Katz 001; Shirin Sohrabi (ICAPS, 2023)

PARIS: Planning Algorithms for Reconfiguring Independent Sets. - Remo Christen; Salomé Eriksson; Michael Katz 001; Christian Muise; Alice Petrov; Florian Pommerening; Jendrik Seipp; Silvan Sievers; David Speck 001 (ECAI, 2023)

Sensitivity Analysis for Saturated Post-Hoc Optimization in Classical Planning. - Paul Höft; David Speck 001; Jendrik Seipp (ECAI, 2023)

Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning. - David Speck 001; Daniel Gnad 001 (ICAPS, 2024)

Versatile Cost Partitioning with Exact Sensitivity Analysis. - Paul Höft; David Speck 001; Florian Pommerening; Jendrik Seipp (ICAPS, 2024)

Counting and Reasoning with Plans. - David Speck 001; Markus Hecher; Daniel Gnad 001; Johannes Klaus Fichte; Augusto B. Corrêa (AAAI, 2025)

AxSAT - Bringing Axioms to SAT Planning. - Gregor Behnke; David Speck 001; Daniel Gnad 001 (JELIA (2), 2025)

Symbolic Search for Cost-Optimal Planning with Expressive Model Extensions. - David Speck 001; Jendrik Seipp; Álvaro Torralba (J. Artif. Intell. Res., 2025)