|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 16 publication records. Showing 16 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau |
On the complexity of SNP block partitioning under the perfect phylogeny model.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau |
Haplotyping with missing data via perfect path phylogenies. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau |
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. |
WABI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard M. Karp, Till Nierhoff, Till Tantau |
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . |
Essays in Memory of Shimon Even |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard M. Karp, Till Nierhoff, Till Tantau |
Optimal flow distribution among multiple channels with unknown capacities. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Hard Dial-a-Ride Problem that is Easy on Average. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-hard, average-case analysis |
| 1 | Jens Gramm, Till Nierhoff, Till Tantau |
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel |
Steiner trees in uniformly quasi-bipartite graphs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel |
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Till Nierhoff |
The UPS Problem. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Till Nierhoff |
A Tight Bound on the Irregularity Strength of Graphs. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Till Nierhoff |
Probabilistische Analyse am Beispiel des k-Zentrumsproblems. |
GI Jahrestagung |
1999 |
DBLP BibTeX RDF |
|
| 1 | Bernd Kreuter, Till Nierhoff |
Greedily Approximating the r-independent Set and k-center Problems on Random Instances. |
RANDOM |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")