Tim A. Hartmann

28 papers A 2B 9C 2Journal 15
YearRankTypeTitle / Venue / Authors
2025 J jnl
From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity.
CoRR
Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2025 A conf
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances.
STACS
Tim A. Hartmann, Dániel Marx
2024 B conf
Approximating δ-Covering.
WAOA
Tim A. Hartmann, Tom Janßen
2024 J jnl
Approximating δ-Covering.
CoRR
Tim A. Hartmann, Tom Janßen
2024 J jnl
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.
Algorithmica
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2024 B conf
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges.
ISAAC
Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2024 J jnl
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges.
CoRR
Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2023 C conf
Make a Graph Singly Connected by Edge Orientations.
IWOCA
Tim A. Hartmann, Komal Muluk
2023 J jnl
Make a graph singly connected by edge orientations.
CoRR
Tim A. Hartmann, Komal Muluk
2023 B conf
Recognizing H-Graphs - Beyond Circular-Arc Graphs.
MFCS
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2022 J jnl
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs.
CoRR
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
2022 J jnl
Continuous facility location on graphs.
Math. Program.
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2022 B conf
Dispersing Obnoxious Facilities on Graphs by Rounding Distances.
MFCS
Tim A. Hartmann, Stefan Lendl
2022 J jnl
Dispersing Obnoxious Facilities on Graphs by Rounding Distances.
CoRR
Tim A. Hartmann, Stefan Lendl
2021 B conf
An Investigation of the Recoverable Robust Assignment Problem.
IPEC
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2021 C conf
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
IWOCA
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2021 J jnl
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
CoRR
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2021 J jnl
Dispersing Obnoxious Facilities on a Graph.
Algorithmica
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020 J jnl
An Investigation of the Recoverable Robust Assignment Problem.
CoRR
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020 B conf
Continuous Facility Location on Graphs.
IPCO
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2020 B conf
Recognizing Proper Tree-Graphs.
IPEC
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2020 J jnl
Recognizing Proper Tree-Graphs.
CoRR
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2019 A conf
Dispersing Obnoxious Facilities on a Graph.
STACS
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2019 B conf
The Complexity of Packing Edge-Disjoint Paths.
IPEC
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
2019 J jnl
The Complexity of Packing Edge-Disjoint Paths.
CoRR
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
2018 J jnl
Dispersing obnoxious facilities on a graph.
CoRR
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
2018 B conf
Target Set Selection Parameterized by Clique-Width and Maximum Threshold.
SOFSEM
Tim A. Hartmann
2017 J jnl
Target Set Selection Parameterized by Clique-Width and Maximum Threshold.
CoRR
Tim A. Hartmann