# Till Nierhoff

According to our database

Collaborative distances:

^{1}, Till Nierhoff authored at least 15 papers between 1997 and 2007.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2007

Haplotyping with missing data via perfect path phylogenies.

Discrete Applied Mathematics, 2007

2006

On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model.

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Optimal Flow Distribution Among Multiple Channels with Unknown Capacities .

Proceedings of the Theoretical Computer Science, 2006

2005

A Hard Dial-a-Ride Problem that is Easy on Average.

J. Scheduling, 2005

Optimal flow distribution among multiple channels with unknown capacities.

Electronic Notes in Discrete Mathematics, 2005

2004

Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

Accelerating screening of 3D protein data with a graph theoretical approach.

Bioinformatics, 2003

A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Steiner trees in uniformly quasi-bipartite graphs.

Inf. Process. Lett., 2002

2001

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

The UPS Problem.

Proceedings of the STACS 2001, 2001

2000

A Tight Bound on the Irregularity Strength of Graphs.

SIAM J. Discrete Math., 2000

1999

The k-center problem and r-independent sets: a study in probabilistic analysis.

PhD thesis, 1999

Probabilistische Analyse am Beispiel des

*k*-Zentrumsproblems.
Proceedings of the Informatik '99, 1999

1997

Greedily Approximating the r-independent Set and k-center Problems on Random Instances.

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997