Searching for authors named "Till Nierhoff" – sorted by Relevance.
-
Perfect path phylogeny haplotyping with missing data is fixed-parameter tractable
- with Missing Data is Fixed-Parameter Tractable Jens Gramm ⋆ , Till Nierhoff ⋆ , and Till Tantau ⋆ International
- Cited by 5 (2 self) – Add To MetaCart
-
Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics
- -Schickard Institut für Informatik, Universität Tübingen, Germany Abstract Till Nierhoff 2 International Computer
- Cited by 3 (3 self) – Add To MetaCart
-
A hard dial-a-ride problem that is easy on average
- ⋆ ⋆ ⋆ , and Till Nierhoff 1 Humboldt-Universität zu Berlin, Institut für Informatik Unter den Linden 6, 10099
- Cited by 1 (1 self) – Add To MetaCart
-
A heuristic for the stacker crane problem on trees which is almost surely exact
- ⋆ , Sven O. Krumke2⋆⋆ 1⋆ ⋆ ⋆ , and Till Nierhoff 1 Humboldt-Universität zu Berlin, Institut für Informatik
- Cited by 1 (1 self) – Add To MetaCart
-
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model
- , Tzvika Hartman 2 , Till Nierhoff 3 , Roded Sharan 4 , and Till Tantau 5 1 Wilhelm-Schickard-Institut für
- Cited by 2 (2 self) – Add To MetaCart
-
Abstract Average Case Analysis of a Hard Dial-a-Ride Problem
- † Till Nierhoff ‡ In the dial-a-ride-problem (DARP) objects have to be moved between given sources
- Cited by 1 (0 self) – Add To MetaCart
-
Lower bounds for approximation algorithms for the Steiner tree problem
- Hougardy, Till Nierhoff, and Hans Jürgen Prömel Humboldt-Universität zu Berlin Institut für Informatik
- Cited by 4 (2 self) – Add To MetaCart
-
Approximation Algorithms for the Steiner Tree Problem in Graphs
- , Till Nierho, Hans Jrgen Prmel Institut fr Informatik Humboldt-Universitt zu Berlin, 10099 Berlin E
- Add To MetaCart
-
Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids
- , Stefan Hougardy, Till Nierhoff ? , and Hans Jurgen Promel ?? Institut fur Informatik, Humboldt
- Cited by 2 (2 self) – Add To MetaCart

