47 citations · 211 across the 38 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DM2015★ 10 cited
Extended Formulations for Independence Polytopes of Regular Matroids
Volker Kaibel, Jon Lee, Matthias Walter +1
The ancillary file Corrigendum.pdf contains an explanation why our proof does not work.
math.OC2015
The Unimodular Intersection Problem
Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles
We show that finding minimally intersecting paths from to in a directed graph or perfect matchings in a bipartite graph can be done in polynomial time. This holds m…
cs.DM2015
Subgraph Polytopes and Independence Polytopes of Count Matroids
Michele Conforti, Volker Kaibel, Matthias Walter +1
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset…