Till Nierhoff

17 papers A 1B 2C 1Journal 8Unranked 4
YearRankTypeTitle / Venue / Authors
2009 J jnl
On the complexity of SNP block partitioning under the perfect phylogeny model.
Discret. Math.
Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
2007 J jnl
Haplotyping with missing data via perfect path phylogenies.
Discret. Appl. Math.
Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau
2006 J jnl
A heuristic for the Stacker Crane Problem on trees which is almost surely exact.
J. Algorithms
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
2006 C conf
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model.
WABI
Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
2006 — conf
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities .
Essays in Memory of Shimon Even
Richard M. Karp, Till Nierhoff, Till Tantau
2005 J jnl
A Hard Dial-a-Ride Problem that is Easy on Average.
J. Sched.
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
2005 J jnl
Optimal flow distribution among multiple channels with unknown capacities.
Electron. Notes Discret. Math.
Richard M. Karp, Till Nierhoff, Till Tantau
2004 — conf
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.
IWPEC
Jens Gramm, Till Nierhoff, Till Tantau
2003 B conf
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.
ISAAC
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
2003 J jnl
Accelerating screening of 3D protein data with a graph theoretical approach.
Bioinform.
Cornelius Frömmel, Christoph Gille, Andrean Goede, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner, Martin Thimm
2002 J jnl
Steiner trees in uniformly quasi-bipartite graphs.
Inf. Process. Lett.
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
2001 B conf
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
WG
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
2001 A conf
The UPS Problem.
STACS
Cristina G. Fernandes, Till Nierhoff
2000 J jnl
A Tight Bound on the Irregularity Strength of Graphs.
SIAM J. Discret. Math.
Till Nierhoff
1999 — conf
Probabilistische Analyse am Beispiel des
GI Jahrestagung
Till Nierhoff
1999 — —
The k-center problem and r-independent sets: a study in probabilistic analysis.
Till Nierhoff
1997 — conf
Greedily Approximating the r-independent Set and k-center Problems on Random Instances.
RANDOM
Bernd Kreuter, Till Nierhoff