Till Nierhoff

According to our database, Till Nierhoff authored at least 14 papers between 1997 and 2007.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2007

Haplotyping with missing data via perfect path phylogenies.

Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau

Discret. Appl. Math., 2007

2006

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

Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau

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

Optimal Flow Distribution Among Multiple Channels with Unknown Capacities .

Richard M. Karp, Till Nierhoff, Till Tantau

Proceedings of the Theoretical Computer Science, 2006

2005

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

Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff

J. Sched., 2005

2004

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

Jens Gramm, Till Nierhoff, Till Tantau

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

2003

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

Cornelius Frömmel, Christoph Gille, Andrean Goede, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner, Martin Thimm

Bioinform., 2003

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

Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff

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

2002

Steiner trees in uniformly quasi-bipartite graphs.

Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel

Inf. Process. Lett., 2002

2001

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.

Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel

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

The UPS Problem.

Cristina G. Fernandes, Till Nierhoff

Proceedings of the STACS 2001, 2001

2000

A Tight Bound on the Irregularity Strength of Graphs.

Till Nierhoff

SIAM J. Discret. Math., 2000

1999

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

Till Nierhoff

PhD thesis, 1999

Probabilistische Analyse am Beispiel des <i>k</i>-Zentrumsproblems.

Till Nierhoff

Proceedings of the Informatik '99, 1999

1997

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

Bernd Kreuter, Till Nierhoff

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