Selective Approaches for Solving Weak Games. - Malte Helmert; Robert Mattmüller; Sven Schewe (ATVA, 2006)

Aproximation Properties of Planning Benchmarks. - Malte Helmert; Robert Mattmüller; Gabriele Röger (ECAI, 2006)

Planning for Temporally Extended Goals as Propositional Satisfiability. - Robert Mattmüller; Jussi Rintanen (IJCAI, 2007)

Accuracy of Admissible Heuristic Functions in Selected Planning Domains. - Malte Helmert; Robert Mattmüller (AAAI, 2008)

A Planning Graph Heuristic for Forward-Chaining Adversarial Planning. - Pascal Bercher; Robert Mattmüller (ECAI, 2008)

Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning. - Patrick Eyerich; Robert Mattmüller; Gabriele Röger (ICAPS, 2009)

Solving Non-deterministic Planning Problems with Pattern Database Heuristics. - Pascal Bercher; Robert Mattmüller (KI, 2009)

Component-Based Abstraction Refinement for Timed Controller Synthesis. - Hans-Jörg Peter; Robert Mattmüller (RTSS, 2009)

G-Value Plateaus: A Challenge for Planning. - J. Benton 001; Kartik Talamadupula; Patrick Eyerich; Robert Mattmüller; Subbarao Kambhampati (ICAPS, 2010)

Pattern Database Heuristics for Fully Observable Nondeterministic Planning. - Robert Mattmüller; Manuela Ortlieb; Malte Helmert; Pascal Bercher (ICAPS, 2010)

Combining Symbolic Representations for Solving Timed Games. - Rüdiger Ehlers; Robert Mattmüller; Hans-Jörg Peter (FORMATS, 2010)

Synthia: Verification and Synthesis for Timed Automata. - Hans-Jörg Peter; Rüdiger Ehlers; Robert Mattmüller (CAV, 2011)

A Stubborn Set Algorithm for Optimal Planning. - Yusra Alkhazraji; Martin Wehrle; Robert Mattmüller; Malte Helmert (ECAI, 2012)

Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning. - Patrick Eyerich; Robert Mattmüller; Gabriele Röger (Towards Service Robots for Everyday Environments, 2012)

The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. - Martin Wehrle; Malte Helmert; Yusra Alkhazraji; Robert Mattmüller (ICAPS, 2013)

Pattern-Database Heuristics for Partially Observable Nondeterministic Planning. - Manuela Ortlieb; Robert Mattmüller (KI, 2013)

Informed progression search for fully observable nondeterministic planning = Informierte Vorwärtssuche für nichtdeterministisches Planen unter vollständiger Beobachtbarkeit. - Robert Mattmüller (2013)

Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (ECAI, 2014)

An Experimental Comparison of Classical, FOND and Probabilistic Planning. - Andreas Hertle; Christian Dornhege; Thomas Keller 001; Robert Mattmüller; Manuela Ortlieb; Bernhard Nebel (KI, 2014)

Minimizing Necessary Observations for Nondeterministic Planning. - Robert Mattmüller; Manuela Ortlieb; Erik Wacker (KI, 2014)

Delete Relaxations for Planning with State-Dependent Action Costs. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (IJCAI, 2015)

Complexity of Interval Relaxed Numeric Planning. - Johannes Aldinger; Robert Mattmüller; Moritz Göbelbecker (KI, 2015)

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

Abstractions for Planning with State-Dependent Action Costs. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (ICAPS, 2016)

State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. - Thomas Keller 001; Florian Pommerening; Jendrik Seipp; Florian Geißer; Robert Mattmüller (IJCAI, 2016)

Cooperative Epistemic Multi-Agent Planning for Implicit Coordination. - Thorsten Engesser; Thomas Bolander; Robert Mattmüller; Bernhard Nebel (M4M@ICLA, 2017)

On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning. - Robert Mattmüller; Florian Geißer; Benedict Wright; Bernhard Nebel (AAAI, 2018)

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

Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination. - Thomas Bolander; Thorsten Engesser; Robert Mattmüller; Bernhard Nebel (KR, 2018)

Compiling Away Soft Trajectory Constraints in Planning. - Benedict Wright; Robert Mattmüller; Bernhard Nebel (KR, 2018)

Moral Permissibility of Action Plans. - Felix Lindner 001; Robert Mattmüller; Bernhard Nebel (AAAI, 2019)

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

Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract). - Bernhard Nebel; Thomas Bolander; Thorsten Engesser; Robert Mattmüller (IJCAI, 2019)

The Dynamic Logic of Policies and Contingent Planning. - Thomas Bolander; Thorsten Engesser; Andreas Herzig; Robert Mattmüller; Bernhard Nebel (JELIA, 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)

Epistemic Multi-agent Planning Using Monte-Carlo Tree Search. - Daniel Reifsteck; Thorsten Engesser; Robert Mattmüller; Bernhard Nebel (KI, 2019)

Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity. - Bernhard Nebel; Thomas Bolander; Thorsten Engesser; Robert Mattmüller (J. Artif. Intell. Res., 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)

Token-based Execution Semantics for Multi-Agent Epistemic Planning. - Thorsten Engesser; Robert Mattmüller; Bernhard Nebel; Felicitas Ritter (KR, 2020)

Evaluation of the moral permissibility of action plans. - Felix Lindner 001; Robert Mattmüller; Bernhard Nebel (Artif. Intell., 2020)

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)

Game description language and dynamic epistemic logic compared. - Thorsten Engesser; Robert Mattmüller; Bernhard Nebel; Michael Thielscher (Artif. Intell., 2021)

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