Tim A. Hartmann

According to our database, Tim A. Hartmann authored at least 16 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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, February, 2025

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances.

Tim A. Hartmann, Dániel Marx

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Algorithmica, July, 2024

Approximating δ-Covering.

Tim A. Hartmann, Tom Janßen

Proceedings of the Approximation and Online Algorithms - 22nd International Workshop, 2024

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

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

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

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Make a Graph Singly Connected by Edge Orientations.

Tim A. Hartmann, Komal Muluk

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Continuous facility location on graphs.

Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

Math. Program., 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

CoRR, 2022

Dispersing Obnoxious Facilities on Graphs by Rounding Distances.

Tim A. Hartmann, Stefan Lendl

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Dispersing Obnoxious Facilities on a Graph.

Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

Algorithmica, 2021

An Investigation of the Recoverable Robust Assignment Problem.

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Recognizing Proper Tree-Graphs.

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

The Complexity of Packing Edge-Disjoint Paths.

Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Target Set Selection Parameterized by Clique-Width and Maximum Threshold.

Tim A. Hartmann

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018