Target Set Selection Parameterized by Clique-Width and Maximum Threshold. - Tim A. Hartmann (SOFSEM, 2018)

The Complexity of Packing Edge-Disjoint Paths. - Jan Dreier; Janosch Fuchs; Tim A. Hartmann; Philipp Kuinke; Peter Rossmanith; Bjoern Tauer; Hung-Lung Wang (IPEC, 2019)

Recognizing Proper Tree-Graphs. - Steven Chaplick; Petr A. Golovach; Tim A. Hartmann; Dusan Knop (IPEC, 2020)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (IWOCA, 2021)

An Investigation of the Recoverable Robust Assignment Problem. - Dennis Fischer 001; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (IPEC, 2021)

Dispersing Obnoxious Facilities on a Graph. - Alexander Grigoriev; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (Algorithmica, 2021)

Dispersing Obnoxious Facilities on Graphs by Rounding Distances. - Tim A. Hartmann; Stefan Lendl (MFCS, 2022)

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (CoRR, 2022)

Continuous facility location on graphs. - Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger (Math. Program., 2022)

Make a Graph Singly Connected by Edge Orientations. - Tim A. Hartmann; Komal Muluk (IWOCA, 2023)

Recognizing H-Graphs - Beyond Circular-Arc Graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (MFCS, 2023)

From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. - Fabian Frei; Ahmed Ghazy; Tim A. Hartmann; Florian Hörsch; Dániel Marx (ISAAC, 2024)

Approximating δ-Covering. - Tim A. Hartmann; Tom Janßen (WAOA, 2024)

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Hung P. Hoang 001; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (Algorithmica, 2024)

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances. - Tim A. Hartmann; Dániel Marx (STACS, 2025)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity. - Fabian Frei; Ahmed Ghazy; Tim A. Hartmann; Florian Hörsch; Dániel Marx (CoRR, 2025)