The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Katharina T. Huber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Barbara Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton
    Imputing Supertrees and Supernetworks from Quartets. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:162- [Conf]
  2. Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Connectivity calculus. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:3, pp:395-399 [Journal]
  3. Katharina T. Huber, Vincent Moulton, Charles Semple, Mike A. Steel
    Recovering a phylogenetic tree using pairwise closure operations. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2005, v:18, n:3, pp:361-366 [Journal]
  4. Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton
    Quasi-median graphs from sets of partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:23-35 [Journal]
  5. Andreas W. M. Dress, Barbara Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff
    Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:51-73 [Journal]
  6. Katharina T. Huber, Vincent Moulton, Charles Semple
    Replacing cliques by stars in quasi-median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:194-203 [Journal]
  7. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Affine Maps That Induce Polyhedral Complex Isomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:49-60 [Journal]
  8. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:4, pp:567-586 [Journal]
  9. Magnus Bordewich, Katharina T. Huber, Charles Semple
    Identifying phylogenetic trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:30-43 [Journal]
  10. Katharina T. Huber
    Recovering trees from well-separated multi-state characters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:151-164 [Journal]
  11. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    The tight span of an antipodal metric space - Part I: : Combinatorial properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:65-79 [Journal]
  12. Katharina T. Huber, Vincent Moulton
    The relation graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:153-166 [Journal]
  13. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    Six Points Suffice: How to Check for Metric Consistency. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:4, pp:465-474 [Journal]
  14. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Antipodal Metrics and Split Systems. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:2, pp:187-200 [Journal]
  15. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    On the structure of the tight-span of a totally split-decomposable metric. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:3, pp:461-479 [Journal]
  16. Katharina T. Huber, Vincent Moulton, Michael Anthony Steel
    Four Characters Suffice to Convexly Define a Phylogenetic Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:835-843 [Journal]
  17. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:4-10 [Conf]

  18. Cut points in metric spaces. [Citation Graph (, )][DBLP]


  19. Block realizations of finite metrics and the tight-span construction I: The embedding theorem. [Citation Graph (, )][DBLP]


  20. A graph-theoretical invariant of topological spaces. [Citation Graph (, )][DBLP]


  21. PADRE: a package for analyzing and displaying reticulate evolution. [Citation Graph (, )][DBLP]


  22. An algorithm for computing cutpoints in finite metric spaces [Citation Graph (, )][DBLP]


  23. Counting vertices and cubes in median graphs of circular split systems. [Citation Graph (, )][DBLP]


  24. Compatible decompositions and block realizations of finite metrics. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002