3 papers
math.OC2026
On Circuit Diameter and Straight Line Complexity
Daniel Dadush, Stefan Kober, Zhuan Khye Koh
The circuit diameter of a polyhedron is the maximum length (number of steps) of a shortest circuit walk between any two vertices of the polyhedron. Introduced by Borgwardt, Finhold…
math.CO2025
Face covers and rooted minors in bounded genus graphs
Samuel Fiorini, Stefan Kober, Michał T. Seweryn +2
A {\em rooted graph} is a graph together with a designated vertex subset, called the {\em roots}. In this paper, we consider rooted graphs embedded in a fixed surface. A collection…
cs.DS2024
Totally -modular IPs with two non-zeros in most rows
Stefan Kober
Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve…