Explicit Conjunctions without Compilation: Computing hFF(PiC) in Polynomial Time. - Jörg Hoffmann 001; Maximilian Fickert (ICAPS, 2015)

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. - Ruben Becker; Maximilian Fickert; Andreas Karrenbauer (ALENEX, 2016)

Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. - Maximilian Fickert; Jörg Hoffmann 001; Marcel Steinmetz (J. Artif. Intell. Res., 2016)

Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. - Maximilian Fickert; Jörg Hoffmann 001 (ICAPS, 2017)

Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. - Maximilian Fickert; 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)

Online Refinement of Cartesian Abstraction Heuristics. - Rebecca Eifler; Maximilian Fickert (SOCS, 2018)

Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning. - Maximilian Fickert (SOCS, 2018)

Refining Abstraction Heuristics during Real-Time Planning. - Rebecca Eifler; Maximilian Fickert; Jörg Hoffmann 001; Wheeler Ruml (AAAI, 2019)

Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search. - Maximilian Fickert; Tianyi Gu 001; Leonhard Staut; Wheeler Ruml; Jörg Hoffmann 001; Marek Petrik (AAAI, 2020)

Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning. - Joschka Gross; Álvaro Torralba; Maximilian Fickert (AAAI, 2020)

A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search. - Maximilian Fickert (ICAPS, 2020)

Choosing the Initial State for Online Replanning. - Maximilian Fickert; Ivan Gavran; Ivan Fedotov; Jörg Hoffmann 001; Rupak Majumdar; Wheeler Ruml (AAAI, 2021)

Bounded-cost Search Using Estimates of Uncertainty. - Maximilian Fickert; Tianyi Gu 001; Wheeler Ruml (IJCAI, 2021)

New Results in Bounded-Suboptimal Search. - Maximilian Fickert; Tianyi Gu 001; Wheeler Ruml (AAAI, 2022)

Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning. - Maximilian Fickert; Jörg Hoffmann 001 (J. Artif. Intell. Res., 2022)

Adaptive search techniques in AI planning and heuristic search. - Maximilian Fickert (2022)