Tim A. Hartmann

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 22

Top Topics

Facility Location

Singly Connected

Top Venues

Publications

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica 86 (7) (2024)
Tim A. Hartmann, Komal Muluk
Make a graph singly connected by edge orientations. CoRR (2023)
Tim A. Hartmann, Komal Muluk
Make a Graph Singly Connected by Edge Orientations. IWOCA (2023)
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS (2023)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous facility location on graphs. Math. Program. 192 (1) (2022)
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR (2022)
Tim A. Hartmann, Stefan Lendl
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. CoRR (2022)
Tim A. Hartmann, Stefan Lendl
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. MFCS (2022)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. IPEC (2021)
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA (2021)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83 (6) (2021)
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. CoRR (2021)
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
Recognizing Proper Tree-Graphs. CoRR (2020)
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Continuous Facility Location on Graphs. IPCO (2020)
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
Recognizing Proper Tree-Graphs. IPEC (2020)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
An Investigation of the Recoverable Robust Assignment Problem. CoRR (2020)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. CoRR (2019)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing Obnoxious Facilities on a Graph. STACS (2019)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. IPEC (2019)
Tim A. Hartmann
Target Set Selection Parameterized by Clique-Width and Maximum Threshold. SOFSEM (2018)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Dispersing obnoxious facilities on a graph. CoRR (2018)
Tim A. Hartmann
Target Set Selection Parameterized by Clique-Width and Maximum Threshold. CoRR (2017)