2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2009
An algorithm for computing cutpoints in finite metric spaces
A. Dress, K. T. Huber, J. Koolen +2
The theory of the tight span, a cell complex that can be associated to every metric , offers a unifying view on existing approaches for analyzing distance data, in particular fo…
math.CO2009★ 2 cited
There are only finitely many distance-regular graphs of fixed valency greater than two
S. Bang, A. Dubickas, J. H. Koolen +1
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
q-bio.PE2009
Species, Clusters and the 'Tree of Life': A graph-theoretic perspective
Andreas Dress, Vincent Moulton, Mike Steel +1
A hierarchical structure describing the inter-relationships of species has long been a fundamental concept in systematic biology, from Linnean classification through to the more re…