| 2026 | ESA | Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-η Deletion. | Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann, Roohani Sharma |
| 2025 | STACS | Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances. | Tim A. Hartmann, Dniel Marx |
| 2024 | ISAAC | From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. | Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hrsch, Dniel Marx |
| 2024 | WAOA | Approximating δ-Covering. | Tim A. Hartmann, Tom Janen |
| 2023 | IWOCA | Make a Graph Singly Connected by Edge Orientations. | Tim A. Hartmann, Komal Muluk |
| 2023 | MFCS | Recognizing H-Graphs - Beyond Circular-Arc Graphs. | Deniz Agaoglu agirici, Onur agirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinen, Jan Kratochvl, Tomasz Krawczyk, Peter Zeman |
| 2022 | MFCS | Dispersing Obnoxious Facilities on Graphs by Rounding Distances. | Tim A. Hartmann, Stefan Lendl |
| 2021 | IWOCA | Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
| 2020 | IPCO | Continuous Facility Location on Graphs. | Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
| 2019 | STACS | Dispersing Obnoxious Facilities on a Graph. | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
| 2018 | SOFSEM | Target Set Selection Parameterized by Clique-Width and Maximum Threshold. | Tim A. Hartmann |