1 citations · 1 across the 1 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2004★ 1 cited
Computing Optimal Morse Matchings
Michael Joswig, Marc E. Pfetsch
Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming…
math.CO2002
Some Algorithmic Problems in Polytope Theory
Volker Kaibel, Marc E. Pfetsch
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege…
math.CO2000
Vertex-Facet Incidences of Unbounded Polyhedra
Michael Joswig, Volker Kaibel, Marc E. Pfetsch +1
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one c…