The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Till Nierhoff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard M. Karp, Till Nierhoff, Till Tantau
    Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:111-128 [Conf]
  2. Till Nierhoff
    Probabilistische Analyse am Beispiel des k-Zentrumsproblems. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1999, pp:257-264 [Conf]
  3. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:605-614 [Conf]
  4. Jens Gramm, Till Nierhoff, Till Tantau
    Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:174-186 [Conf]
  5. Bernd Kreuter, Till Nierhoff
    Greedily Approximating the r-independent Set and k-center Problems on Random Instances. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:43-53 [Conf]
  6. Cristina G. Fernandes, Till Nierhoff
    The UPS Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:238-246 [Conf]
  7. Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
    On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:92-102 [Conf]
  8. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
    Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:217-228 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:18, pp:2442-2447 [Journal]
  10. Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau
    Haplotyping with missing data via perfect path phylogenies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:788-805 [Journal]
  11. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
    Steiner trees in uniformly quasi-bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:4, pp:195-200 [Journal]
  12. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A heuristic for the Stacker Crane Problem on trees which is almost surely exact. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:61, n:1, pp:1-19 [Journal]
  13. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A Hard Dial-a-Ride Problem that is Easy on Average. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:3, pp:197-210 [Journal]
  14. Till Nierhoff
    A Tight Bound on the Irregularity Strength of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:313-323 [Journal]

  15. On the complexity of SNP block partitioning under the perfect phylogeny model. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002