2026 Malte Helmert: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	47	6477	6288	127	127	167	9198

Research.com Recognitions

2021 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to the theory and practice of automated planning and combinatorial search.

Overview

Malte Helmert is affiliated with the University of Basel in Switzerland and has a research focus situated within the broad domain of computer science, with a particular emphasis on artificial intelligence and automated planning. Their scholarly output comprises 135 publications, many concentrating on the subfields of Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, Computational Theory and Mathematics, and Software.

Their research commonly addresses topics such as AI-based problem solving and planning, logic, reasoning, and knowledge, constraint satisfaction and optimization, logic, programming, and type systems, semantic web and ontologies, robotic path planning algorithms, and formal methods in verification.

Recent publications by Malte Helmert include the following:

"Pattern Database Heuristics for Fully Observable Nondeterministic Planning" (2021, Proceedings of the International Conference on Automated Planning and Scheduling)
"Efficient Implementation of Pattern Database Heuristics for Classical Planning" (2021, Proceedings of the International Symposium on Combinatorial Search)
"Lifted Successor Generation Using Query Optimization Techniques" (2020, Proceedings of the International Conference on Automated Planning and Scheduling)
"Saturated Cost Partitioning for Optimal Classical Planning" (2020, Journal of Artificial Intelligence Research)
"Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984)" (2021, Proceedings of the International Symposium on Combinatorial Search)

Helmert's frequent coauthors include:

Jendrik Seipp
Silvan Sievers
Florian Pommerening
Gabriele Röger
Augusto B. Corrêa

The primary venues where Helmert has published are:

Proceedings of the International Conference on Automated Planning and Scheduling
Zenodo (CERN European Organization for Nuclear Research)
Proceedings of the International Symposium on Combinatorial Search
Proceedings of the AAAI Conference on Artificial Intelligence
Journal of Artificial Intelligence Research

In 2021, Malte Helmert was awarded the title of Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) for contributions specifically recognized in the theory and practice of automated planning and combinatorial search.

Best Publications

The fast downward planning system

Malte Helmert

2007
Citations
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?

Malte Helmert;Carmel Domshlak

589
Citations
Concise finite-domain representations for PDDL planning tasks

Malte Helmert

357
Citations
Flexible abstraction heuristics for optimal sequential planning

Malte Helmert;Patrik Haslum;Jorg Hoffmann

336
Citations
A planning heuristic based on causal graph analysis

Malte Helmert

314
Citations
Landmarks revisited

Silvia Richter;Malte Helmert;Matthias Westphal

300
Citations
Domain-independent construction of pattern database heuristics for cost-optimal planning

Patrik Haslum;Adi Botea;Malte Helmert;Blai Bonet

276
Citations
Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces

Malte Helmert;Patrik Haslum;Jörg Hoffmann;Raz Nissim

178
Citations
Complexity results for standard benchmark domains in planning

Malte Helmert

172
Citations
High-Quality Policies for the Canadian Traveler's Problem

Patrick Eyerich;Thomas Keller;Malte Helmert

166
Citations
Unifying the causal graph and additive heuristics

Malte Helmert;Héctor Geffner

162
Citations
How good is almost perfect

Malte Helmert;Gabriele Röger

152
Citations
MIPS: The Model-Checking Integrated Planning System

Stefan Edelkamp;Malte Helmert

141
Citations
Trial-based Heuristic tree search for finite horizon MDPs

Thomas Keller;Malte Helmert

136
Citations
Preferred operators and deferred evaluation in satisficing planning

Silvia Richter;Malte Helmert

136
Citations
Decidability and undecidability results for planning with numerical state variables

Malte Helmert

132
Citations
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length

Stefan Edelkamp;Malte Helmert

132
Citations
Sound and Complete Landmarks for And/Or Graphs

Emil Keyder;Silvia Richter;Malte Helmert

118
Citations
The more, the merrier: combining heuristic estimators for satisficing planning

Gabriele Röger;Malte Helmert

115
Citations
The Model Checking Integrated Planning System (MIPS)

Stefan Edelkamp;Malte Helmert

114
Citations
Principles of Knowledge Representation and Reasoning

Bernhard Nebel;Malte Helmert

14
Citations

Frequent Co-Authors

Jörg Hoffmann Saarland University

Blai Bonet Simón Bolívar University

Nathan R. Sturtevant University of Alberta

Bernhard Nebel University of Freiburg

Carmel Domshlak Technion – Israel Institute of Technology

Stefan Edelkamp Charles University

Ariel Felner Ben-Gurion University of the Negev

Frank Hutter University of Freiburg

Marco Pistore Fondazione Bruno Kessler

Louis-Martin Rousseau Polytechnique Montréal

External Links

Personal website of Malte Helmert Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

If you’re considering studying Computer Science in the USA, exploring related online degrees and career pathways can open new opportunities. Many students look for programs that not only fit their interests but also provide real-world value and flexible learning formats.

For those interested in expanding their expertise or switching career tracks, it’s wise to review the most useful degrees available today. Picking a well-regarded field can lead to enhanced job prospects and higher earning potential.

If balancing work and study is a priority, you may want to consider the easiest master degree to get online. These programs tend to offer streamlined curriculums and flexible coursework, making them accessible for busy professionals.

For advanced learners, affordability is crucial. Explore the cheap doctoral programs in various fields to find cost-effective paths to the highest academic credentials. If you’re interested in leadership, the cheapest online doctorate in educational leadership is an excellent choice for those aiming for fast-track advancement in academic or administrative roles.