Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland. - Steffen Borgwardt; Andreas Brieden; Peter Gritzmann (Oper. Res., 2011)

A balanced k-means algorithm for weighted point sets. - Steffen Borgwardt; Andreas Brieden; Peter Gritzmann (CoRR, 2013)

On the diameter of partition polytopes and vertex-disjoint cycle cover. - Steffen Borgwardt (Math. Program., 2013)

Threshold-based preprocessing for approximating the weighted dense k-subgraph problem. - Steffen Borgwardt; Felix Schmiedl (Eur. J. Oper. Res., 2014)

On Soft Power Diagrams. - Steffen Borgwardt (J. Math. Model. Algorithms Oper. Res., 2015)

On the Circuit Diameter of Dual Transportation Polyhedra. - Steffen Borgwardt; Elisabeth Finhold; Raymond Hemmecke (SIAM J. Discret. Math., 2015)

Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie) - Steffen Borgwardt (2015)

Efficient solutions for weight-balanced partitioning problems. - Steffen Borgwardt; Shmuel Onn (Discret. Optim., 2016)

Discrete Wasserstein barycenters: optimal transport for discrete data. - Ethan B. Anderes; Steffen Borgwardt; Jacob Miller 002 (Math. Methods Oper. Res., 2016)

Quadratic diameter bounds for dual network flow polyhedra. - Steffen Borgwardt; Elisabeth Finhold; Raymond Hemmecke (Math. Program., 2016)

Reachability in Binary Multithreaded Programs Is Polynomial. - Alexander Malkis; Steffen Borgwardt (ICDCS, 2017)

An LP-based k-means algorithm for balancing weighted point sets. - Steffen Borgwardt; Andreas Brieden; Peter Gritzmann (Eur. J. Oper. Res., 2017)

The hierarchy of circuit diameters and transportation polytopes. - Steffen Borgwardt; Jesús A. De Loera; Elisabeth Finhold; Jacob Miller 002 (Discret. Appl. Math., 2018)

On the Circuit Diameter Conjecture. - Steffen Borgwardt; Tamon Stephen; Timothy Yusun (Discret. Comput. Geom., 2018)

The diameters of network-flow polytopes satisfy the Hirsch conjecture. - Steffen Borgwardt; Jesús A. De Loera; Elisabeth Finhold (Math. Program., 2018)

Good Clusterings Have Large Volume. - Steffen Borgwardt; Felix Happach (Oper. Res., 2019)

Power Diagram Detection with Applications to Information Elicitation. - Steffen Borgwardt; Rafael M. Frongillo (J. Optim. Theory Appl., 2019)

An implementation of steepest-descent augmentation for linear programs. - Steffen Borgwardt; Charles Viss (Oper. Res. Lett., 2020)

Improved Linear Programs for Discrete Barycenters. - Steffen Borgwardt; Stephan Patterson (INFORMS J. Optim., 2020)

On the computational complexity of finding a sparse Wasserstein barycenter. - Steffen Borgwardt; Stephan Patterson (J. Comb. Optim., 2021)

A note on the approximability of deepest-descent circuit steps. - Steffen Borgwardt; Cornelius Brand; Andreas Emil Feldmann; Martin Koutecký (Oper. Res. Lett., 2021)

Constructing Clustering Transformations. - Steffen Borgwardt; Charles Viss (SIAM J. Discret. Math., 2021)

A polyhedral model for enumeration and optimization over the set of circuits. - Steffen Borgwardt; Charles Viss (Discret. Appl. Math., 2022)

A column generation approach to the discrete barycenter problem. - Steffen Borgwardt; Stephan Patterson (Discret. Optim., 2022)

Circuit walks in integral polyhedra. - Steffen Borgwardt; Charles Viss (Discret. Optim., 2022)

An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters. - Steffen Borgwardt (Oper. Res., 2022)

An Algorithm for the Separation-Preserving Transition of Clusterings. - Steffen Borgwardt; Felix Happach; Stetson Zirkelbach (INFORMS J. Optim., 2023)

Circuits in extended formulations. - Steffen Borgwardt; Matthias Brugger (Discret. Optim., 2024)

An Integer Program for Pricing Support Points of Exact Barycenters. - Steffen Borgwardt; Stephan Patterson (INFORMS J. Optim., 2024)

On the Combinatorial Diameters of Parallel and Series Connections. - Steffen Borgwardt; Weston Grewe; Jon Lee 001 (SIAM J. Discret. Math., 2024)

On the hardness of short and sign-compatible circuit walks. - Steffen Borgwardt; Weston Grewe; Sean Kafer; Jon Lee 001; Laura Sanità (Discret. Appl. Math., 2025)

On combinatorial network flows algorithms and circuit augmentation for pseudoflows. - Steffen Borgwardt; Angela Morrison (J. Comb. Optim., 2025)

On the diameter of a 2-sum of polyhedra. - Steffen Borgwardt; Weston Grewe; Jon Lee 001 (Optim. Lett., 2025)