Till Nierhoff

From MaRDI portal
Person:876475

Available identifiers

zbMath Open nierhoff.tillMaRDI QIDQ876475

List of research outcomes





PublicationDate of PublicationType
On the complexity of SNP block partitioning under the perfect phylogeny model2009-12-15Paper
Algorithms and Computation2009-08-07Paper
https://portal.mardi4nfdi.de/entity/Q34396872007-05-29Paper
A hard dial-a-ride problem that is easy on average2007-05-15Paper
Haplotyping with missing data via perfect path phylogenies2007-04-18Paper
A heuristic for the Stacker Crane Problem on trees which is almost surely exact2006-12-07Paper
Parameterized and Exact Computation2005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44487612004-02-18Paper
Steiner trees in uniformly quasi-bipartite graphs.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27625092002-01-09Paper
A Tight Bound on the Irregularity Strength of Graphs2000-07-20Paper

Research outcomes over time

This page was built for person: Till Nierhoff

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:876475&oldid=7681292"
Powered by MediaWiki