default search action
Torsten Tholey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j5]Frank Kammer, Torsten Tholey:
Approximate tree decompositions of planar graphs in linear time. Theor. Comput. Sci. 645: 60-90 (2016) - 2014
- [j4]Frank Kammer, Torsten Tholey:
Approximation Algorithms for Intersection Graphs. Algorithmica 68(2): 312-336 (2014) - 2012
- [j3]Frank Kammer, Torsten Tholey:
The complexity of minimum convex coloring. Discret. Appl. Math. 160(6): 810-833 (2012) - [j2]Torsten Tholey:
Linear time algorithms for two disjoint paths problems on directed acyclic graphs. Theor. Comput. Sci. 465: 35-48 (2012) - [c9]Frank Kammer, Torsten Tholey:
Approximate tree decompositions of planar graphs in linear time. SODA 2012: 683-698 - 2011
- [i1]Frank Kammer, Torsten Tholey:
Approximate Tree Decompositions of Planar Graphs in Linear Time. CoRR abs/1104.2275 (2011) - 2010
- [c8]Frank Kammer, Torsten Tholey, Heiko Voepel:
Approximation Algorithms for Intersection Graphs. APPROX-RANDOM 2010: 260-273
2000 – 2009
- 2009
- [c7]Torsten Tholey:
Improved Algorithms for the 2-Vertex Disjoint Paths Problem. SOFSEM 2009: 546-557 - [c6]Frank Kammer, Torsten Tholey:
The k-Disjoint Paths Problem on Chordal Graphs. WG 2009: 190-201 - 2008
- [c5]Frank Kammer, Torsten Tholey:
The Complexity of Minimum Convex Coloring. ISAAC 2008: 16-27 - 2007
- [b1]Torsten Tholey:
Effiziente Algorithmen und Datenstrukturen zur Berechnung zweier disjunkter Pfade. University of Augsburg, 2007, ISBN 978-3-86624-303-3, pp. 1-232 - 2006
- [j1]Torsten Tholey:
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. Theory Comput. Syst. 39(1): 51-78 (2006) - 2005
- [c4]Torsten Tholey:
Finding Disjoint Paths on Directed Acyclic Graphs. WG 2005: 319-330 - 2004
- [c3]Torsten Tholey:
Solving the 2-Disjoint Paths Problem in Nearly Linear Time. STACS 2004: 350-361 - 2003
- [c2]Torsten Tholey:
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. ISAAC 2003: 565-574 - 2001
- [c1]Torben Hagerup, Torsten Tholey:
Efficient Minimal Perfect Hashing in Nearly Minimal Space. STACS 2001: 317-326
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-04-25 05:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint