- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| j8 |      | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the complexity of SNP block partitioning under the perfect phylogeny model. Discrete Mathematics 309(18): 5610-5617 (2009) |
| 2007 | ||
| j7 | | Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau: Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics 155(6-7): 788-805 (2007) |
| 2006 | ||
| j6 | | 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): 1-19 (2006) |
| c8 | | Richard M. Karp, Till Nierhoff, Till Tantau: Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Essays in Memory of Shimon Even 2006: 111-128 |
| c7 | | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. WABI 2006: 92-102 |
| 2005 | ||
| j5 | | Richard M. Karp, Till Nierhoff, Till Tantau: Optimal flow distribution among multiple channels with unknown capacities. Electronic Notes in Discrete Mathematics 19: 225-231 (2005) |
| j4 | | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff: A Hard Dial-a-Ride Problem that is Easy on Average. J. Scheduling 8(3): 197-210 (2005) |
| 2004 | ||
| c6 | | Jens Gramm, Till Nierhoff, Till Tantau: Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186 |
| 2003 | ||
| j3 | | 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. Bioinformatics 19(18): 2442-2447 (2003) |
| c5 | | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff: A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. ISAAC 2003: 605-614 |
| 2002 | ||
| j2 | | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel: Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) |
| 2001 | ||
| c4 | | |
| c3 | | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel: Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228 |
| 2000 | ||
| j1 | | Till Nierhoff: A Tight Bound on the Irregularity Strength of Graphs. SIAM J. Discrete Math. 13(3): 313-323 (2000) |
| 1999 | ||
| c2 |  | Till Nierhoff: Probabilistische Analyse am Beispiel des k-Zentrumsproblems. GI Jahrestagung 1999: 257-264 |
| 1997 | ||
| c1 | | Bernd Kreuter, Till Nierhoff: Greedily Approximating the r-independent Set and k-center Problems on Random Instances. RANDOM 1997: 43-53 |
Colors in the list of coauthors
Last update Wed May 22 10:01:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page