A tight bound on the irregularity strength of graphs von NIERHOFFT, T

Volltext

Haplotyping with missing data via perfect path phylogenies von Gramm, Jens, Nierhoff, Till, Sharan, Roded, Tantau, Till

Volltext

On the complexity of SNP block partitioning under the perfect phylogeny model von Gramm, Jens, Hartman, Tzvika, Nierhoff, Till, Sharan, Roded, Tantau, Till

Volltext

Optimal Flow Distribution Among Multiple Channels with Unknown Capacities von KARP, Richard, NIERHOFF, Till, TANTAU, Till

Volltext

On the complexity of SNP block partitioning under the perfect phylogeny model: Combinatorics 2006, A Meeting in Celebration of Pavol Hell's 60th Birthday (May 1-5, 2006) von GRAMM, Jens, HARTMAN, Tzvika, NIERHOFF, Till, SHARAN, Roded, TANTAU, Till

Volltext

Haplotyping with missing data via perfect path phylogenies: Computational molecular biology series, issue V von GRAMM, Jens, NIERHOFF, Till, SHARA, Roded, TANTAU, Till

Volltext

Optimal flow distribution among multiple channels with unknown capacities von Karp, Richard, Nierhoff, Till, Tantau, Till

Volltext

Optimal Flow Distribution Among Multiple Channels with Unknown Capacities von Karp, Richard, Nierhoff, Till, Tantau, Till

Volltext

Accelerating screening of 3D protein data with a graph theoretical approach von Frömmel, Cornelius, Gille, Christoph, Goede, Andrean, Gröpl, Clemens, Hougardy, Stefan, Nierhoff, Till, Preißner, Robert, Thimm, Martin

Volltext

A Hard Dial-a-Ride Problem that is Easy on Average von Coja-Oghlan, Amin, Krumke, Sven O., Nierhoff, Till

Volltext

On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model von Gramm, Jens, Hartman, Tzvika, Nierhoff, Till, Sharan, Roded, Tantau, Till

Volltext

A heuristic for the Stacker Crane Problem on trees which is almost surely exact von Coja-Oghlan, Amin, Krumke, Sven O., Nierhoff, Till

Volltext

Steiner trees in uniformly quasi-bipartite graphs von Gröpl, Clemens, Hougardy, Stefan, Nierhoff, Till, Prömel, Hans Jürgen

Volltext

A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact von Coja-Oghlan, Amin, Krumke, Sven O., Nierhoff, Till

Volltext

Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable von Gramm, Jens, Nierhoff, Till, Tantau, Till

Volltext

Greedily approximating the r-independent set and k-center problems on random instances von KREUTER, B, NIERHOFF, T

Volltext

Lower bounds for approximation algorithms for the Steiner tree problem von GRÖPL, Clemens, HOUGARDY, Stefan, NIERHOFF, Till, PRÖMEL, Hans Jürgen

Volltext

Greedily approximating the r-independent set and k-center problems on random instances: Extended abstract von Kreuter, Bernd, Nierhoff, Till

Volltext

The UPS Problem von Fernandes, Cristina G., Nierho, Till

Volltext

Lower Bounds for Algorithms for the Steiner Tree Problem von Gröpl, Clemens, Hougardy, Stefan, Nierhoff, Till, Prömel, Hans Jürgen

Volltext