Eliminating Redundant Actions in Partially Ordered Plans - A Complexity Analysis. - Conny Olz; Pascal Bercher (ICAPS, 2019)

POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization. - Pascal Bercher; Conny Olz (AAAI, 2020)

Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks - A Complexity Analysis. - Conny Olz; Susanne Biundo; Pascal Bercher (AAAI, 2021)

Step-by-Step Task Plan Explanations Beyond Causal Links. - Felix Lindner 001; Conny Olz (RO-MAN, 2022)

Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks. - Conny Olz; Pascal Bercher (ICAPS, 2023)

A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. - Conny Olz; Pascal Bercher (SOCS, 2023)

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)

A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming. - Conny Olz; Alexander Lodemann; Pascal Bercher (ECAI, 2024)

Exploring the hierarchy: extracting and exploiting state information of compound tasks in HTN planning - Conny Olz (2024)

An Extensive Empirical Evaluation of Inferring Preconditions and Effects of Compound Tasks in Ground HTN Planning Problems. - Conny Olz; Alexander Lodemann; Benedikt Jutz; Mario Schmautz; Maximilian Borowiec; Susanne Biundo; Pascal Bercher (J. Artif. Intell. Res., 2025)