Tim A. Hartmann

Orcid: 0000-0002-1028-6351

According to our database1, Tim A. Hartmann authored at least 11 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Recognizing H-Graphs - Beyond Circular-Arc Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Make a Graph Singly Connected by Edge Orientations.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022
Continuous facility location on graphs.
Math. Program., 2022

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs.
CoRR, 2022

Dispersing Obnoxious Facilities on Graphs by Rounding Distances.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
Dispersing Obnoxious Facilities on a Graph.
Algorithmica, 2021

An Investigation of the Recoverable Robust Assignment Problem.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Recognizing Proper Tree-Graphs.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
The Complexity of Packing Edge-Disjoint Paths.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018
Target Set Selection Parameterized by Clique-Width and Maximum Threshold.
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


  Loading...