Steffen Borgwardt

39 papers A 1Journal 37
YearRankTypeTitle / Venue / Authors
2026 J jnl
Path odd-covers of graphs.
Discret. Math.
Steffen Borgwardt, Calum Buchanan, Eric Culver, Bryce Frederickson, Puck Rombach, Youngho Yoo
2025 J jnl
On combinatorial network flows algorithms and circuit augmentation for pseudoflows.
J. Comb. Optim.
Steffen Borgwardt, Angela Morrison
2025 J jnl
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture.
Discret. Optim.
Alexander E. Black, Steffen Borgwardt, Matthias Brugger
2025 J jnl
On the diameter of a 2-sum of polyhedra.
Optim. Lett.
Steffen Borgwardt, Weston Grewe, Jon Lee
2025 J jnl
On the hardness of short and sign-compatible circuit walks.
Discret. Appl. Math.
Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità
2024 J jnl
An Integer Program for Pricing Support Points of Exact Barycenters.
INFORMS J. Optim.
Steffen Borgwardt, Stephan Patterson
2024 J jnl
Circuits in extended formulations.
Discret. Optim.
Steffen Borgwardt, Matthias Brugger
2024 J jnl
On the Combinatorial Diameters of Parallel and Series Connections.
SIAM J. Discret. Math.
Steffen Borgwardt, Weston Grewe, Jon Lee
2023 J jnl
An Algorithm for the Separation-Preserving Transition of Clusterings.
INFORMS J. Optim.
Steffen Borgwardt, Felix Happach, Stetson Zirkelbach
2022 J jnl
A column generation approach to the discrete barycenter problem.
Discret. Optim.
Steffen Borgwardt, Stephan Patterson
2022 J jnl
A polyhedral model for enumeration and optimization over the set of circuits.
Discret. Appl. Math.
Steffen Borgwardt, Charles Viss
2022 J jnl
An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters.
Oper. Res.
Steffen Borgwardt
2022 J jnl
Circuit walks in integral polyhedra.
Discret. Optim.
Steffen Borgwardt, Charles Viss
2021 J jnl
A note on the approximability of deepest-descent circuit steps.
Oper. Res. Lett.
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2021 J jnl
Constructing Clustering Transformations.
SIAM J. Discret. Math.
Steffen Borgwardt, Charles Viss
2021 J jnl
On the computational complexity of finding a sparse Wasserstein barycenter.
J. Comb. Optim.
Steffen Borgwardt, Stephan Patterson
2020 J jnl
A Note on the Approximability of Deepest-Descent Circuit Steps.
CoRR
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký
2020 J jnl
An implementation of steepest-descent augmentation for linear programs.
Oper. Res. Lett.
Steffen Borgwardt, Charles Viss
2020 J jnl
Improved Linear Programs for Discrete Barycenters.
INFORMS J. Optim.
Steffen Borgwardt, Stephan Patterson
2019 J jnl
Constructing Clustering Transformations.
CoRR
Steffen Borgwardt, Charles Viss
2019 J jnl
Good Clusterings Have Large Volume.
Oper. Res.
Steffen Borgwardt, Felix Happach
2019 J jnl
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter.
CoRR
Steffen Borgwardt, Stephan Patterson
2019 J jnl
Power Diagram Detection with Applications to Information Elicitation.
J. Optim. Theory Appl.
Steffen Borgwardt, Rafael M. Frongillo
2018 J jnl
On the Circuit Diameter Conjecture.
Discret. Comput. Geom.
Steffen Borgwardt, Tamon Stephen, Timothy Yusun
2018 J jnl
The diameters of network-flow polytopes satisfy the Hirsch conjecture.
Math. Program.
Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold
2018 J jnl
The hierarchy of circuit diameters and transportation polytopes.
Discret. Appl. Math.
Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold, Jacob Miller
2017 J jnl
An LP-based k-means algorithm for balancing weighted point sets.
Eur. J. Oper. Res.
Steffen Borgwardt, Andreas Brieden, Peter Gritzmann
2017 A conf
Reachability in Binary Multithreaded Programs Is Polynomial.
ICDCS
Alexander Malkis, Steffen Borgwardt
2016 J jnl
Discrete Wasserstein barycenters: optimal transport for discrete data.
Math. Methods Oper. Res.
Ethan B. Anderes, Steffen Borgwardt, Jacob Miller
2016 J jnl
Efficient solutions for weight-balanced partitioning problems.
Discret. Optim.
Steffen Borgwardt, Shmuel Onn
2016 J jnl
Quadratic diameter bounds for dual network flow polyhedra.
Math. Program.
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
2015 — —
Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie)
Steffen Borgwardt
2015 J jnl
On Soft Power Diagrams.
J. Math. Model. Algorithms Oper. Res.
Steffen Borgwardt
2015 J jnl
On the Circuit Diameter of Dual Transportation Polyhedra.
SIAM J. Discret. Math.
Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke
2014 J jnl
Threshold-based preprocessing for approximating the weighted dense k-subgraph problem.
Eur. J. Oper. Res.
Steffen Borgwardt, Felix Schmiedl
2013 J jnl
A balanced k-means algorithm for weighted point sets.
CoRR
Steffen Borgwardt, Andreas Brieden, Peter Gritzmann
2013 J jnl
On Soft Power Diagrams.
CoRR
Steffen Borgwardt
2013 J jnl
On the diameter of partition polytopes and vertex-disjoint cycle cover.
Math. Program.
Steffen Borgwardt
2011 J jnl
Constrained Minimum-
Oper. Res.
Steffen Borgwardt, Andreas Brieden, Peter Gritzmann