Untangling near minimum cuts with applications in network design
Nathan Klein
University of Washington
March 30, 2023
Approximating Weighted Connectivity Augmentation Below Factor 2
Rico Zenklusen
ETH Zurich
March 29, 2023
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity
Ola Svensson
EPFL
March 29, 2023
Degree Sequence Optimization and Sparse Integer Programming
Shmuel Onn
Technion - Israel Institute of Technology
March 29, 2023
Arc connectivity and submodular flows in digraphs
Ahmad Abdi
London School of Economics
March 28, 2023
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
Stefan Weltge
Technical University of Munich
March 28, 2023