Greedily Approximating the r-independent Set and k-center Problems on Random Instances. - Bernd Kreuter; Till Nierhoff (RANDOM, 1997)

Probabilistische Analyse am Beispiel des k-Zentrumsproblems. - Till Nierhoff (GI Jahrestagung, 1999)

The k-center problem and r-independent sets: a study in probabilistic analysis. - Till Nierhoff (Shaker, 1999)

A Tight Bound on the Irregularity Strength of Graphs. - Till Nierhoff (SIAM J. Discret. Math., 2000)

The UPS Problem. - Cristina G. Fernandes; Till Nierhoff (STACS, 2001)

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. - Clemens Gröpl; Stefan Hougardy; Till Nierhoff; Hans Jürgen Prömel (WG, 2001)

Steiner trees in uniformly quasi-bipartite graphs. - Clemens Gröpl; Stefan Hougardy; Till Nierhoff; Hans Jürgen Prömel (Inf. Process. Lett., 2002)

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)

Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. - Jens Gramm; Till Nierhoff; Till Tantau (IWPEC, 2004)

Optimal flow distribution among multiple channels with unknown capacities. - Richard M. Karp; Till Nierhoff; Till Tantau (Electron. Notes Discret. Math., 2005)

A Hard Dial-a-Ride Problem that is Easy on Average. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Sched., 2005)

A heuristic for the Stacker Crane Problem on trees which is almost surely exact. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Algorithms, 2006)

Haplotyping with missing data via perfect path phylogenies. - Jens Gramm; Till Nierhoff; Roded Sharan; Till Tantau (Discret. Appl. Math., 2007)

On the complexity of SNP block partitioning under the perfect phylogeny model. - Jens Gramm; Tzvika Hartman; Till Nierhoff; Roded Sharan; Till Tantau (Discret. Math., 2009)