Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. - Stefan Edelkamp; Malte Helmert (ECP, 1999)

MIPS: The Model-Checking Integrated Planning System. - Stefan Edelkamp; Malte Helmert (AI Mag., 2001)

Decidability and Undecidability Results for Planning with Numerical State Variables. - Malte Helmert (PuK, 2002)

Complexity results for standard benchmark domains in planning. - Malte Helmert (Artif. Intell., 2003)

A Planning Heuristic Based on Causal Graph Analysis. - Malte Helmert (ICAPS, 2004)

New Complexity Results for Classical Planning Benchmarks. - Malte Helmert (ICAPS, 2006)

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

A Skat Player Based on Monte-Carlo Simulation. - Sebastian Kupferschmid; Malte Helmert (Computers and Games, 2006)

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

The Fast Downward Planning System. - Malte Helmert (J. Artif. Intell. Res., 2006)

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. - Patrik Haslum; Adi Botea; Malte Helmert; Blai Bonet; Sven Koenig (AAAI, 2007)

Flexible Abstraction Heuristics for Optimal Sequential Planning. - Malte Helmert; Patrik Haslum; Jörg Hoffmann 001 (ICAPS, 2007)

A Stochastic Local Search Approach to Vertex Cover. - Silvia Richter; Malte Helmert; Charles Gretton (KI, 2007)

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition. - Malte Helmert (Springer, 2008)

Explicit-State Abstraction: A New Method for Generating Heuristic Functions. - Malte Helmert; Patrik Haslum; Jörg Hoffmann 001 (AAAI, 2008)

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

How Good is Almost Perfect?. - Malte Helmert; Gabriele Röger (AAAI, 2008)

Landmarks Revisited. - Silvia Richter; Malte Helmert; Matthias Westphal (AAAI, 2008)

Unifying the Causal Graph and Additive Heuristics. - Malte Helmert; Hector Geffner (ICAPS, 2008)

On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. - Gabriele Röger; Malte Helmert; Bernhard Nebel (KR, 2008)

Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. - Dunbo Cai; Jörg Hoffmann 001; Malte Helmert (ICAPS, 2009)

Preferred Operators and Deferred Evaluation in Satisficing Planning. - Silvia Richter; Malte Helmert (ICAPS, 2009)

Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? - Malte Helmert; Carmel Domshlak (Graph Search Engineering, 2009)

Planning with h + in Theory and Practice. - Christoph Betz; Malte Helmert (KI, 2009)

The Causal Graph Revisited for Directed Model Checking. - Martin Wehrle; Malte Helmert (SAS, 2009)

Concise finite-domain representations for PDDL planning tasks. - Malte Helmert (Artif. Intell., 2009)

Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. - Jörg Hoffmann 001; Piergiorgio Bertoli; Malte Helmert; Marco Pistore (J. Artif. Intell. Res., 2009)

High-Quality Policies for the Canadian Traveler's Problem. - Patrick Eyerich; Thomas Keller 001; Malte Helmert (AAAI, 2010)

The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. - Malte Helmert; Hauke Lasinger (ICAPS, 2010)

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

The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. - Gabriele Röger; Malte Helmert (ICAPS, 2010)

Strengthening Landmark Heuristics via Hitting Sets. - Blai Bonet; Malte Helmert (ECAI, 2010)

Relative-Order Abstractions for the Pancake Problem. - Malte Helmert; Gabriele Röger (ECAI, 2010)

Sound and Complete Landmarks for And/Or Graphs. - Emil Keyder; Silvia Richter; Malte Helmert (ECAI, 2010)

Landmark Heuristics for the Pancake Problem. - Malte Helmert (SOCS, 2010)

Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. - Raz Nissim; Jörg Hoffmann 001; Malte Helmert (IJCAI, 2011)

Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984). - Gabriele Röger; Malte Helmert (MAPF@AAAI, 2012)

How to Relax a Bisimulation? - Michael Katz 001; Jörg Hoffmann 001; Malte Helmert (ICAPS, 2012)

Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. - Florian Pommerening; Malte Helmert (ICAPS, 2012)

Learning Portfolios of Automatically Tuned Planners. - Jendrik Seipp; Manuel Braun; Johannes Garimort; Malte Helmert (ICAPS, 2012)

About Partial Order Reduction in Planning and Computer Aided Verification. - Martin Wehrle; Malte Helmert (ICAPS, 2012)

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

Efficient Implementation of Pattern Database Heuristics for Classical Planning. - Silvan Sievers; Manuela Ortlieb; Malte Helmert (SOCS, 2012)

Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. - Jordan Tyler Thayer; J. Benton 001; Malte Helmert (SOCS, 2012)

Additive Counterexample-Guided Cartesian Abstraction Refinement. - Jendrik Seipp; Malte Helmert (AAAI (Late-Breaking Developments), 2013)

Trial-Based Heuristic Tree Search for Finite Horizon MDPs. - Thomas Keller 001; Malte Helmert (ICAPS, 2013)

Stronger Abstraction Heuristics Through Perimeter Search. - Patrick Eyerich; Malte Helmert (ICAPS, 2013)

Safe, Strong, and Tractable Relevance Analysis for Planning. - Patrik Haslum; Malte Helmert; Anders Jonsson 001 (ICAPS, 2013)

Incremental LM-Cut. - Florian Pommerening; Malte Helmert (ICAPS, 2013)

Counterexample-Guided Cartesian Abstraction Refinement. - Jendrik Seipp; Malte Helmert (ICAPS, 2013)

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

Getting the Most Out of Pattern Databases for Classical Planning. - Florian Pommerening; Gabriele Röger; Malte Helmert (IJCAI, 2013)

SoCS 2013 Organization. - Malte Helmert; Gabriele Röger (SOCS, 2013)

Preface. - Malte Helmert; Gabriele Röger (SOCS, 2013)

Automating the evaluation of planning systems. - Carlos Linares López; Sergio Jiménez Celorrio; Malte Helmert (AI Commun., 2013)

Generalized Label Reduction for Merge-and-Shrink Heuristics. - Silvan Sievers; Martin Wehrle; Malte Helmert (AAAI, 2014)

Under-Approximation Refinement for Classical Planning. - Manuel Heusner; Martin Wehrle; Florian Pommerening; Malte Helmert (ICAPS, 2014)

LP-Based Heuristics for Cost-Optimal Planning. - Florian Pommerening; Gabriele Röger; Malte Helmert; Blai Bonet (ICAPS, 2014)

Diverse and Additive Cartesian Abstraction Heuristics. - Jendrik Seipp; Malte Helmert (ICAPS, 2014)

Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. - Martin Wehrle; Malte Helmert (ICAPS, 2014)

Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. - Gabriele Röger; Florian Pommerening; Malte Helmert (ECAI, 2014)

Bounded Intention Planning Revisited. - Silvan Sievers; Martin Wehrle; Malte Helmert (ECAI, 2014)

Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. - Nathan R. Sturtevant; Ariel Felner; Malte Helmert (SOCS, 2014)

Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces. - Malte Helmert; Patrik Haslum; Jörg Hoffmann 001; Raz Nissim (J. ACM, 2014)

From Non-Negative to General Operator Cost Partitioning. - Florian Pommerening; Malte Helmert; Gabriele Röger; Jendrik Seipp (AAAI, 2015)

Automatic Configuration of Sequential Planning Portfolios. - Jendrik Seipp; Silvan Sievers; Malte Helmert; Frank Hutter (AAAI, 2015)

Heuristics and Symmetries in Classical Planning. - Alexander Shleyfman; Michael Katz 001; Malte Helmert; Silvan Sievers; Martin Wehrle (AAAI, 2015)

Factored Symmetries for Merge-and-Shrink Abstractions. - Silvan Sievers; Martin Wehrle; Malte Helmert; Alexander Shleyfman; Michael Katz 001 (AAAI, 2015)

On the Expressive Power of Non-Linear Merge-and-Shrink Representations. - Malte Helmert; Gabriele Röger; Silvan Sievers (ICAPS, 2015)

A Normal Form for Classical Planning Tasks. - Florian Pommerening; Malte Helmert (ICAPS, 2015)

New Optimization Functions for Potential Heuristics. - Jendrik Seipp; Florian Pommerening; Malte Helmert (ICAPS, 2015)

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. - Florian Pommerening; Gabriele Röger; Malte Helmert; Blai Bonet (IJCAI, 2015)

Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. - Martin Wehrle; Malte Helmert; Alexander Shleyfman; Michael Katz 001 (IJCAI, 2015)

A Doppelkopf Player Based on UCT. - Silvan Sievers; Malte Helmert (KI, 2015)

An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. - Silvan Sievers; Martin Wehrle; Malte Helmert; Michael Katz 001 (KI, 2015)

An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. - Silvan Sievers; Martin Wehrle; Malte Helmert (ICAPS, 2016)

Correlation Complexity of Classical Planning Domains. - Jendrik Seipp; Florian Pommerening; Gabriele Röger; Malte Helmert (IJCAI, 2016)

Graph-Based Factorization of Classical Planning Problems. - Martin Wehrle; Silvan Sievers; Malte Helmert (IJCAI, 2016)

Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. - Gerald Paul; Malte Helmert (SOCS, 2016)

Higher-Dimensional Potential Heuristics for Optimal Classical Planning. - Florian Pommerening; Malte Helmert; Blai Bonet (AAAI, 2017)

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (AAAI, 2017)

Value Compression of Pattern Databases. - Nathan R. Sturtevant; Ariel Felner; Malte Helmert (AAAI, 2017)

Unsolvability Certificates for Classical Planning. - Salomé Eriksson; Gabriele Röger; Malte Helmert (ICAPS, 2017)

Abstraction Heuristics, Cost Partitioning and Network Flows. - Florian Pommerening; Malte Helmert; Blai Bonet (ICAPS, 2017)

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (ICAPS, 2017)

On Variable Dependencies and Compressed Pattern Databases. - Malte Helmert; Nathan R. Sturtevant; Ariel Felner (SOCS, 2017)

Understanding the Search Behaviour of Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (SOCS, 2017)

Optimal Solutions to Large Logistics Planning Domain Problems. - Gerald Paul; Gabriele Röger; Thomas Keller 001; Malte Helmert (SOCS, 2017)

Strengthening Canonical Pattern Databases with Structural Symmetries. - Silvan Sievers; Martin Wehrle; Malte Helmert; Michael Katz 001 (SOCS, 2017)

A Proof System for Unsolvable Planning Tasks. - Salomé Eriksson; Gabriele Röger; Malte Helmert (ICAPS, 2018)

Inductive Certificates of Unsolvability for Domain-Independent Planning. - Salomé Eriksson; Gabriele Röger; Malte Helmert (IJCAI, 2018)

Best-Case and Worst-Case Behavior of Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (IJCAI, 2018)

Search Progress and Potentially Expanded States in Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (IJCAI, 2018)

Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. - Jendrik Seipp; Malte Helmert (J. Artif. Intell. Res., 2018)

Lagrangian Decomposition for Optimal Cost Partitioning. - Florian Pommerening; Gabriele Röger; Malte Helmert; Hadrien Cambazard; Louis-Martin Rousseau; Domenico Salvagnin (ICAPS, 2019)

Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. - Alexander Rovner; Silvan Sievers; Malte Helmert (ICAPS, 2019)

Subset-Saturated Cost Partitioning for Optimal Classical Planning. - Jendrik Seipp; Malte Helmert (ICAPS, 2019)

Iterative Budgeted Exponential Search. - Malte Helmert; Tor Lattimore; Levi H. S. Lelis; Laurent Orseau; Nathan R. Sturtevant (IJCAI, 2019)

Exponential-Binary State-Space Search. - Nathan R. Sturtevant; Malte Helmert (CoRR, 2019)

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

Lifted Successor Generation Using Query Optimization Techniques. - Augusto B. Corrêa; Florian Pommerening; Malte Helmert; Guillem Francès (ICAPS, 2020)

Certified Unsolvability for SAT Planning with Property Directed Reachability. - Salomé Eriksson; Malte Helmert (ICAPS, 2020)

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. - Jendrik Seipp; Samuel von Allmen; Malte Helmert (ICAPS, 2020)

Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. - Patrick Ferber; Malte Helmert; Jörg Hoffmann 001 (ECAI, 2020)

Lagrangian Decomposition for Classical Planning (Extended Abstract). - Florian Pommerening; Gabriele Röger; Malte Helmert; Hadrien Cambazard; Louis-Martin Rousseau; Domenico Salvagnin (IJCAI, 2020)

Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. - Silvan Sievers; Florian Pommerening; Thomas Keller 001; Malte Helmert (IJCAI, 2020)

An Atom-Centric Perspective on Stubborn Sets. - Gabriele Röger; Malte Helmert; Jendrik Seipp; Silvan Sievers (SOCS, 2020)

A Guide to Budgeted Tree Search. - Nathan R. Sturtevant; Malte Helmert (SOCS, 2020)

Saturated Cost Partitioning for Optimal Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (J. Artif. Intell. Res., 2020)

Saturated Post-hoc Optimization for Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (AAAI, 2021)

Exploiting Cyclic Dependencies in Landmark Heuristics. - Clemens Büchner; Thomas Keller 001; Malte Helmert (ICAPS, 2021)

Delete-Relaxation Heuristics for Lifted Classical Planning. - Augusto B. Corrêa; Guillem Francès; Florian Pommerening; Malte Helmert (ICAPS, 2021)

Dantzig-Wolfe Decomposition for Cost Partitioning. - Florian Pommerening; Thomas Keller 001; Valentina Halasi; Jendrik Seipp; Silvan Sievers; Malte Helmert (ICAPS, 2021)

Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. - Silvan Sievers; Malte Helmert (J. Artif. Intell. Res., 2021)

The FF Heuristic for Lifted Classical Planning. - Augusto B. Corrêa; Florian Pommerening; Malte Helmert; Guillem Francès (AAAI, 2022)

Detecting Unsolvability Based on Separating Functions. - Remo Christen; Salomé Eriksson; Florian Pommerening; Malte Helmert (ICAPS, 2022)

Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. - Patrick Ferber; Florian Geißer; Felipe W. Trevizan; Malte Helmert; Jörg Hoffmann 001 (ICAPS, 2022)

On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. - Malte Helmert; Silvan Sievers; Alexander Rovner; Augusto B. Corrêa (ICAPS, 2022)

On Producing Shortest Cost-Optimal Plans. - Michael Katz 001; Gabriele Röger; Malte Helmert (SOCS, 2022)

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

Landmark Progression in Heuristic Search. - Clemens Büchner; Thomas Keller 001; Salomé Eriksson; Malte Helmert (ICAPS, 2023)

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. - Augusto B. Corrêa; Markus Hecher; Malte Helmert; Davide Mario Longo; Florian Pommerening; Stefan Woltran (ICAPS, 2023)

Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. - Raphael Kreft; Clemens Büchner; Silvan Sievers; Malte Helmert (ICAPS, 2023)

Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning. - Simon Dold 001; Malte Helmert (AAAI, 2024)

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. - Songtuan Lin; Conny Olz; Malte Helmert; Pascal Bercher (AAAI, 2024)

Abstraction Heuristics for Factored Tasks. - Clemens Büchner; Patrick Ferber; Jendrik Seipp; Malte Helmert (ICAPS, 2024)

Planning with Object Creation. - Augusto B. Corrêa; Giuseppe De Giacomo; Malte Helmert; Sasha Rubin (ICAPS, 2024)

Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. - Simon Dold 001; Malte Helmert (ICAPS, 2024)

Formal Representations of Classical Planning Domains. - Claudia Grundke; Gabriele Röger; Malte Helmert (ICAPS, 2024)

Improving Reproducibility in AI Research: Four Mechanisms Adopted by JAIR. - Odd Erik Gundersen; Malte Helmert; Holger H. Hoos (J. Artif. Intell. Res., 2024)

Pseudo-Boolean Proof Logging for Optimal Classical Planning. - Simon Dold 001; Malte Helmert; Jakob Nordström; Gabriele Röger; Tanja Schindler (CoRR, 2025)

A Formalism for Optimal Search with Dynamic Heuristics. - Remo Christen; Florian Pommerening; Clemens Büchner; Malte Helmert (CoRR, 2025)