Tim A. Hartmann

MaRDI QIDQ2032348zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Recognizing \(H\)-graphs -- beyond circular-arc graphs	2024-12-03	Paper
Dispersing obnoxious facilities on graphs by rounding distances	2024-08-06	Paper
Conflict-free coloring: graphs of bounded clique-width and intersection graphs Algorithmica	2024-08-02	Paper
scientific article; zbMATH DE number 7803597 (Why is no real title available?) (available as arXiv preprint)	2024-02-12	Paper
Make a graph singly connected by edge orientations Lecture Notes in Computer Science	2023-12-22	Paper
Recognizing Proper Tree-Graphs (available as arXiv preprint)	2023-11-13	Paper
The complexity of packing edge-disjoint paths (available as arXiv preprint)	2023-02-03	Paper
Continuous facility location on graphs Integer Programming and Combinatorial Optimization	2022-10-14	Paper
Dispersing Obnoxious Facilities on a Graph	2022-07-18	Paper
Conflict-free coloring: graphs of bounded clique width and intersection graphs (available as arXiv preprint)	2022-03-22	Paper
Continuous facility location on graphs Mathematical Programming. Series A. Series B	2022-03-22	Paper
Dispersing obnoxious facilities on a graph Algorithmica	2021-06-11	Paper
Target set selection parameterized by clique-width and maximum threshold SOFSEM 2018: Theory and Practice of Computer Science	2020-10-21	Paper

Research outcomes over time

This page was built for person: Tim A. Hartmann