28 citations · 80 across the 12 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010★ 2 cited
The Split Decomposition of a k-Dissimilarity Map
Sven Herrmann, Vincent Moulton
A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also so…
math.CO2010★ 6 cited
Computing the bounded subcomplex of an unbounded polyhedron
Sven Herrmann, Michael Joswig, Marc E. Pfetsch
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss th…