default search action
Tim A. Hartmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]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): 2250-2288 (2024) - [c11]Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx:
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. ISAAC 2024: 31:1-31:16 - [i11]Tim A. Hartmann, Tom Janßen:
Approximating δ-Covering. CoRR abs/2408.04517 (2024) - [i10]Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx:
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. CoRR abs/2410.10613 (2024) - 2023
- [c10]Tim A. Hartmann
, Komal Muluk
Make a Graph Singly Connected by Edge Orientations. IWOCA 2023: 221-232 - [c9]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: 8:1-8:14 - [i9]Tim A. Hartmann, Komal Muluk:
Make a graph singly connected by edge orientations. CoRR abs/2306.02065 (2023) - 2022
- [j2]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous facility location on graphs. Math. Program. 192(1): 207-227 (2022) - [c8]Tim A. Hartmann
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. MFCS 2022: 55:1-55:14 - [i8]Tim A. Hartmann, Stefan Lendl:
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. CoRR abs/2206.11337 (2022) - [i7]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 abs/2212.05433 (2022) - 2021
- [j1]Alexander Grigoriev
Dispersing Obnoxious Facilities on a Graph. Algorithmica 83(6): 1734-1749 (2021) - [c7]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA 2021: 92-106 - [c6]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. IPEC 2021: 19:1-19:14 - [i6]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. CoRR abs/2105.08693 (2021) - 2020
- [c5]Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Continuous Facility Location on Graphs. IPCO 2020: 171-181 - [c4]Steven Chaplick
Recognizing Proper Tree-Graphs. IPEC 2020: 8:1-8:15 - [i5]Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
An Investigation of the Recoverable Robust Assignment Problem. CoRR abs/2010.11456 (2020) - [i4]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. CoRR abs/2011.11670 (2020)
2010 – 2019
- 2019
- [c3]Jan Dreier
The Complexity of Packing Edge-Disjoint Paths. IPEC 2019: 10:1-10:16 - [c2]Alexander Grigoriev
Dispersing Obnoxious Facilities on a Graph. STACS 2019: 33:1-33:11 - [i3]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. CoRR abs/1910.00440 (2019) - 2018
- [c1]Tim A. Hartmann:
Target Set Selection Parameterized by Clique-Width and Maximum Threshold. SOFSEM 2018: 137-149 - [i2]Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
Dispersing obnoxious facilities on a graph. CoRR abs/1811.08918 (2018) - 2017
- [i1]Tim A. Hartmann:
Target Set Selection Parameterized by Clique-Width and Maximum Threshold. CoRR abs/1710.00635 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: