Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space Search. - Daniel Gnad 001; Jörg Hoffmann 001 (ICAPS, 2015)

Red-Black Planning: A New Tractability Analysis and Heuristic Function. - Daniel Gnad 001; Jörg Hoffmann 001 (SOCS, 2015)

From Fork Decoupling to Star-Topology Decoupling. - Daniel Gnad 001; Jörg Hoffmann 001; Carmel Domshlak (SOCS, 2015)

Decoupled Strong Stubborn Sets. - Daniel Gnad 001; Martin Wehrle; Jörg Hoffmann 001 (IJCAI, 2016)

On State-Dominance Criteria in Fork-Decoupled Search. - Álvaro Torralba; Daniel Gnad 001; Patrick Dubbert; Jörg Hoffmann 001 (IJCAI, 2016)

Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. - Daniel Gnad 001; Marcel Steinmetz; Mathäus Jany; Jörg Hoffmann 001; Ivan Serina; Alfonso Gerevini (SOCS, 2016)

Symmetry Breaking in Star-Topology Decoupled Search. - Daniel Gnad 001; Álvaro Torralba; Alexander Shleyfman; Jörg Hoffmann 001 (ICAPS, 2017)

Beyond Red-Black Planning: Limited-Memory State Variables. - Patrick Speicher; Marcel Steinmetz; Daniel Gnad 001; Jörg Hoffmann 001; Alfonso Gerevini (ICAPS, 2017)

Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search. - Daniel Gnad 001; Valerie Poser; Jörg Hoffmann 001 (IJCAI, 2017)

Symbolic Leaf Representation in Decoupled Search. - Daniel Gnad 001; Álvaro Torralba; Jörg Hoffmann 001 (SOCS, 2017)

Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. - Maximilian Fickert; Daniel Gnad 001; Jörg Hoffmann 001 (IJCAI, 2018)

Star-Topology Decoupling in SPIN. - Daniel Gnad 001; Patrick Dubbert; Alberto Lluch-Lafuente; Jörg Hoffmann 001 (SPIN, 2018)

Star-topology decoupled state space search. - Daniel Gnad 001; Jörg Hoffmann 001 (Artif. Intell., 2018)

Learning How to Ground a Plan - Partial Grounding in Classical Planning. - Daniel Gnad 001; Álvaro Torralba; Martín Ariel Domínguez; Carlos Areces; Facundo Bustos (AAAI, 2019)

On the Relation between Star-Topology Decoupling and Petri Net Unfolding. - Daniel Gnad 001; Jörg Hoffmann 001 (ICAPS, 2019)

Advanced Factoring Strategies for Decoupled Search Using Linear Programming. - Frederik Schmitt; Daniel Gnad 001; Jörg Hoffmann 001 (ICAPS, 2019)

Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search. - Daniel Gnad 001; Jörg Hoffmann 001; Martin Wehrle (J. Artif. Intell. Res., 2019)

Planen. - Jörg Hoffmann 001; Malte Helmert; Daniel Gnad 001; Florian Pommerening (Handbuch der Künstlichen Intelligenz, 2020)

Revisiting Dominance Pruning in Decoupled Search. - Daniel Gnad 001 (AAAI, 2021)

Model Checking ømega-Regular Properties with Decoupled Search. - Daniel Gnad 001; Jan Eisenhut; Alberto Lluch-Lafuente; Jörg Hoffmann 001 (CAV (2), 2021)

Custom-Design of FDR Encodings: The Case of Red-Black Planning. - Daniel Fiser; Daniel Gnad 001; Michael Katz 001; Jörg Hoffmann 001 (IJCAI, 2021)

Star-topology decoupled state-space search in AI planning and model checking. - Daniel Gnad 001 (2021)

Stern-Topologie Entkoppelte Zustandsraumsuche. - Daniel Gnad 001 (Ausgezeichnete Informatikdissertationen, 2021)

Beyond Stars - Generalized Topologies for Decoupled Search. - Daniel Gnad 001; Álvaro Torralba; Daniel Fiser (ICAPS, 2022)

Additive Pattern Databases for Decoupled Search. - Silvan Sievers; Daniel Gnad 001; Álvaro Torralba (SOCS, 2022)

Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. - Alexander Shleyfman; Daniel Gnad 001; Peter Jonsson (AAAI, 2023)

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

Planning over Integers: Compilations and Undecidability. - Daniel Gnad 001; Malte Helmert; Peter Jonsson; Alexander Shleyfman (ICAPS, 2023)

Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases. - Daniel Gnad 001; Silvan Sievers; Álvaro Torralba (ICAPS, 2023)

Cost Partitioning for Multiple Sequence Alignment. - Mika Skjelnes; Daniel Gnad 001; Jendrik Seipp (ECAI, 2024)

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

PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning. - Daniel Gnad 001; Lee-or Alon; Eyal Weiss 001; Alexander Shleyfman (AAAI, 2025)

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)