Till Nierhoff

Publication Activity (10 Years)

Years Active: 1997-2009
Publications (10 Years): 0

Humboldt University of Berlin, Germany (PHD)

Education History

Humboldt University of Berlin, Germany

PHD

Publications

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) (2009)
Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau
Haplotyping with missing data via perfect path phylogenies. Discret. Appl. Math. 155 (6-7) (2007)
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) (2006)
Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. WABI (2006)
Richard M. Karp, Till Nierhoff, Till Tantau
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Essays in Memory of Shimon Even (2006)
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
A Hard Dial-a-Ride Problem that is Easy on Average. J. Sched. 8 (3) (2005)
Richard M. Karp, Till Nierhoff, Till Tantau
Optimal flow distribution among multiple channels with unknown capacities. Electron. Notes Discret. Math. 19 (2005)
Jens Gramm, Till Nierhoff, Till Tantau
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC (2004)
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. ISAAC (2003)
Cornelius Frömmel, Christoph Gille, Andrean Goede, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner, Martin Thimm
Accelerating screening of 3D protein data with a graph theoretical approach. Bioinform. 19 (18) (2003)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83 (4) (2002)
Cristina G. Fernandes, Till Nierhoff
The UPS Problem. STACS (2001)
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG (2001)
Till Nierhoff
A Tight Bound on the Irregularity Strength of Graphs. SIAM J. Discret. Math. 13 (3) (2000)
Till Nierhoff
-Zentrumsproblems. GI Jahrestagung (1999)
Bernd Kreuter, Till Nierhoff
Greedily Approximating the r-independent Set and k-center Problems on Random Instances. RANDOM (1997)

Till Nierhoff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Till Nierhoff