default search action
Till Nierhoff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j8]Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau:
On the complexity of SNP block partitioning under the perfect phylogeny model. Discret. Math. 309(18): 5610-5617 (2009) - 2007
- [j7]Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau:
Haplotyping with missing data via perfect path phylogenies. Discret. Appl. Math. 155(6-7): 788-805 (2007) - 2006
- [j6]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. J. Algorithms 61(1): 1-19 (2006) - [c8]Richard M. Karp, Till Nierhoff, Till Tantau:
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Essays in Memory of Shimon Even 2006: 111-128 - [c7]Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau:
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. WABI 2006: 92-102 - 2005
- [j5]Richard M. Karp, Till Nierhoff, Till Tantau:
Optimal flow distribution among multiple channels with unknown capacities. Electron. Notes Discret. Math. 19: 225-231 (2005) - [j4]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A Hard Dial-a-Ride Problem that is Easy on Average. J. Sched. 8(3): 197-210 (2005) - 2004
- [c6]Jens Gramm, Till Nierhoff, Till Tantau:
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186 - 2003
- [j3]Cornelius Frömmel, Christoph Gille, Andrean Goede
, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner
Accelerating screening of 3D protein data with a graph theoretical approach. Bioinform. 19(18): 2442-2447 (2003) - [c5]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. ISAAC 2003: 605-614 - 2002
- [j2]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) - 2001
- [c4]Cristina G. Fernandes
The UPS Problem. STACS 2001: 238-246 - [c3]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228 - 2000
- [j1]Till Nierhoff:
A Tight Bound on the Irregularity Strength of Graphs. SIAM J. Discret. Math. 13(3): 313-323 (2000)
1990 – 1999
- 1999
- [b1]Till Nierhoff:
The k-center problem and r-independent sets: a study in probabilistic analysis. Humboldt University of Berlin, Germany, Shaker 1999, ISBN 978-3-8265-6082-8, pp. 1-54 - [c2]Till Nierhoff:
Probabilistische Analyse am Beispiel des k-Zentrumsproblems. GI Jahrestagung 1999: 257-264 - 1997
- [c1]Bernd Kreuter, Till Nierhoff:
Greedily Approximating the r-independent Set and k-center Problems on Random Instances. RANDOM 1997: 43-53
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 2025-01-09 13:05 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: