Combinatorics of Generalized Parking-Function Polytopes.

Steffen Borgwardt https://scholar.google.com/citations=en=XOfs7h4AAAAJ https://clas.ucdenver.edu/steffen-borgwardt/ https://orcid.org/0000-0002-8069-5046 University of Colorado, Denver, CO, USA University of California, Davis, CA, USA TU Munich, Germany

Margaret M. Bayer Steffen Borgwardt Teressa Chambers Spencer Daugherty Aleyah Dawkins Danai Deligeorgaki Hsin-Chieh Liao Tyrrell McAllister Angela Morrison Garrett Nelson Andrés R. Vindas-Meléndez Combinatorics of Generalized Parking-Function Polytopes. 2026 July 339-377 76 Discret. Comput. Geom. 1 https://doi.org/10.1007/s00454-025-00770-1 db/journals/dcg/dcg76.html#BayerBCDDDLMMNV26 streams/journals/dcg

Steffen Borgwardt Calum Buchanan Eric Culver Bryce Frederickson Puck Rombach Youngho Yoo Path odd-covers of graphs. 2026 115078 349 Discret. Math. 8 https://doi.org/10.1016/j.disc.2026.115078 db/journals/dm/dm349.html#BorgwardtBCFRY26 streams/journals/dm

Steffen Borgwardt Weston Grewe Sean Kafer Jon Lee 0001 Laura Sanità On the hardness of short and sign-compatible circuit walks. 129-149 2025 367 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2025.02.009 db/journals/dam/dam367.html#BorgwardtGKLS25 streams/journals/dam

Alexander E. Black Steffen Borgwardt Matthias Brugger On the circuit diameter conjecture for counterexamples to the Hirsch conjecture. 100910 2025 58 Discret. Optim. https://doi.org/10.1016/j.disopt.2025.100910 db/journals/disopt/disopt58.html#BlackBB25 streams/journals/disopt

Steffen Borgwardt Angela Morrison On combinatorial network flows algorithms and circuit augmentation for pseudoflows. 73 2025 July 49 J. Comb. Optim. 5 https://doi.org/10.1007/s10878-025-01313-3 db/journals/jco/jco49.html#BorgwardtM25 streams/journals/jco

Steffen Borgwardt Weston Grewe Jon Lee 0001 On the diameter of a 2-sum of polyhedra. 1053-1074 2025 July 19 Optim. Lett. 6 https://doi.org/10.1007/s11590-025-02198-1 db/journals/ol/ol19.html#BorgwardtGL25 streams/journals/ol

Steffen Borgwardt Matthias Brugger Circuits in extended formulations. 100825 2024 52 Discret. Optim. https://doi.org/10.1016/j.disopt.2024.100825 db/journals/disopt/disopt52.html#BorgwardtB24 streams/journals/disopt

Steffen Borgwardt Stephan Patterson An Integer Program for Pricing Support Points of Exact Barycenters. 137-153 2024 6 INFORMS J. Optim. 2 https://doi.org/10.1287/ijoo.2022.0028 db/journals/informsjop/informsjop6.html#BorgwardtP24

Steffen Borgwardt Weston Grewe Jon Lee 0001 On the Combinatorial Diameters of Parallel and Series Connections. 485-503 2024 March 38 SIAM J. Discret. Math. 1 https://doi.org/10.1137/22m1490508 https://www.wikidata.org/entity/Q129631860 db/journals/siamdm/siamdm38.html#BorgwardtGL24

Steffen Borgwardt Felix Happach Stetson Zirkelbach An Algorithm for the Separation-Preserving Transition of Clusterings. 1-26 2023 January 5 INFORMS J. Optim. 1 https://doi.org/10.1287/ijoo.2022.0074 db/journals/informsjop/informsjop5.html#BorgwardtHZ23

Steffen Borgwardt Charles Viss A polyhedral model for enumeration and optimization over the set of circuits. 68-83 2022 308 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2019.07.025 https://www.wikidata.org/entity/Q127357409 db/journals/dam/dam308.html#BorgwardtV22

Steffen Borgwardt Stephan Patterson A column generation approach to the discrete barycenter problem. 100674 2022 43 Discret. Optim. https://doi.org/10.1016/j.disopt.2021.100674 db/journals/disopt/disopt43.html#BorgwardtP22

Steffen Borgwardt Charles Viss Circuit walks in integral polyhedra. 100566 2022 44 Discret. Optim. Part https://doi.org/10.1016/j.disopt.2019.100566 https://www.wikidata.org/entity/Q126342304 db/journals/disopt/disopt44.html#BorgwardtV22

Steffen Borgwardt An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters. 1511-1551 2022 22 Oper. Res. 2 https://doi.org/10.1007/s12351-020-00589-z db/journals/or/or22.html#Borgwardt22

Steffen Borgwardt Stephan Patterson On the computational complexity of finding a sparse Wasserstein barycenter. 736-761 2021 41 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-021-00713-5 db/journals/jco/jco41.html#BorgwardtP21

Steffen Borgwardt Cornelius Brand Andreas Emil Feldmann Martin Koutecký A note on the approximability of deepest-descent circuit steps. 310-315 2021 49 Oper. Res. Lett. 3 https://doi.org/10.1016/j.orl.2021.02.003 db/journals/orl/orl49.html#BorgwardtBFK21

Steffen Borgwardt Charles Viss Constructing Clustering Transformations. 152-178 2021 35 SIAM J. Discret. Math. 1 https://doi.org/10.1137/20M1330658 db/journals/siamdm/siamdm35.html#BorgwardtV21

Steffen Borgwardt Stephan Patterson Improved Linear Programs for Discrete Barycenters. 14-33 2020 January 2 INFORMS J. Optim. 1 https://doi.org/10.1287/ijoo.2019.0020 db/journals/informsjop/informsjop2.html#BorgwardtP20

Steffen Borgwardt Charles Viss An implementation of steepest-descent augmentation for linear programs. 323-328 2020 48 Oper. Res. Lett. 3 https://doi.org/10.1016/j.orl.2020.04.004 db/journals/orl/orl48.html#BorgwardtV20

Steffen Borgwardt Cornelius Brand Andreas Emil Feldmann Martin Koutecký A Note on the Approximability of Deepest-Descent Circuit Steps. 2020 abs/2010.10809 CoRR https://arxiv.org/abs/2010.10809 db/journals/corr/corr2010.html#abs-2010-10809

Steffen Borgwardt Felix Happach Good Clusterings Have Large Volume. 215-231 2019 67 Oper. Res. 1 https://doi.org/10.1287/opre.2018.1779 db/journals/ior/ior67.html#BorgwardtH19

Steffen Borgwardt Rafael M. Frongillo Power Diagram Detection with Applications to Information Elicitation. 184-196 2019 181 J. Optim. Theory Appl. 1 https://doi.org/10.1007/s10957-018-1442-y https://www.wikidata.org/entity/Q128883780 db/journals/jota/jota181.html#BorgwardtF19

Steffen Borgwardt Charles Viss Constructing Clustering Transformations. 2019 abs/1904.05406 CoRR http://arxiv.org/abs/1904.05406 db/journals/corr/corr1904.html#abs-1904-05406

Steffen Borgwardt Stephan Patterson On the Computational Complexity of Finding a Sparse Wasserstein Barycenter. 2019 abs/1910.07568 CoRR http://arxiv.org/abs/1910.07568 db/journals/corr/corr1910.html#abs-1910-07568

Steffen Borgwardt Jesús A. De Loera Elisabeth Finhold Jacob Miller 0002 The hierarchy of circuit diameters and transportation polytopes. 8-24 2018 240 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.10.017 https://www.wikidata.org/entity/Q60242755 db/journals/dam/dam240.html#BorgwardtLFM18

Steffen Borgwardt Tamon Stephen Timothy Yusun On the Circuit Diameter Conjecture. 558-587 2018 60 Discret. Comput. Geom. 3 https://doi.org/10.1007/s00454-018-9995-y https://www.wikidata.org/entity/Q123009327 db/journals/dcg/dcg60.html#BorgwardtSY18

Steffen Borgwardt Jesús A. De Loera Elisabeth Finhold The diameters of network-flow polytopes satisfy the Hirsch conjecture. 283-309 2018 171 Math. Program. 1-2 https://doi.org/10.1007/s10107-017-1176-x https://www.wikidata.org/entity/Q122904010 db/journals/mp/mp171.html#BorgwardtLF18

Steffen Borgwardt Andreas Brieden Peter Gritzmann An LP-based k-means algorithm for balancing weighted point sets. 349-355 2017 263 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2017.04.054 https://www.wikidata.org/entity/Q60242757 db/journals/eor/eor263.html#BorgwardtBG17

Alexander Malkis Steffen Borgwardt Reachability in Binary Multithreaded Programs Is Polynomial. 2083-2088 2017 ICDCS https://doi.org/10.1109/ICDCS.2017.290 https://doi.ieeecomputersociety.org/10.1109/ICDCS.2017.290 conf/icdcs/2017 db/conf/icdcs/icdcs2017.html#MalkisB17

Steffen Borgwardt Shmuel Onn Efficient solutions for weight-balanced partitioning problems. 71-84 2016 21 Discret. Optim. https://doi.org/10.1016/j.disopt.2016.06.001 db/journals/disopt/disopt21.html#BorgwardtO16

Ethan B. Anderes Steffen Borgwardt Jacob Miller 0002 Discrete Wasserstein barycenters: optimal transport for discrete data. 389-409 2016 84 Math. Methods Oper. Res. 2 https://doi.org/10.1007/s00186-016-0549-x db/journals/mmor/mmor84.html#AnderesBM16

Steffen Borgwardt Elisabeth Finhold Raymond Hemmecke Quadratic diameter bounds for dual network flow polyhedra. 237-251 2016 159 Math. Program. 1-2 https://doi.org/10.1007/s10107-015-0956-4 db/journals/mp/mp159.html#BorgwardtFH16

Steffen Borgwardt Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie) Technical University of Munich, Germany 2015 https://mediatum.ub.tum.de/1256158 https://mediatum.ub.tum.de/doc/1256158/document.pdf https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20150618-1256158-1-8

Steffen Borgwardt On Soft Power Diagrams. 173-196 2015 14 J. Math. Model. Algorithms Oper. Res. 2 https://doi.org/10.1007/s10852-014-9263-y db/journals/jmma/jmma14.html#Borgwardt15

Steffen Borgwardt Elisabeth Finhold Raymond Hemmecke On the Circuit Diameter of Dual Transportation Polyhedra. 113-121 2015 29 SIAM J. Discret. Math. 1 https://doi.org/10.1137/140976868 db/journals/siamdm/siamdm29.html#BorgwardtFH15

Steffen Borgwardt Felix Schmiedl Threshold-based preprocessing for approximating the weighted dense k-subgraph problem. 631-640 2014 234 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2013.09.027 https://www.wikidata.org/entity/Q60242777 db/journals/eor/eor234.html#BorgwardtS14

Steffen Borgwardt On the diameter of partition polytopes and vertex-disjoint cycle cover. 1-20 2013 141 Math. Program. 1-2 https://doi.org/10.1007/s10107-011-0504-9 db/journals/mp/mp141.html#Borgwardt13

Steffen Borgwardt On Soft Power Diagrams. 2013 CoRR http://arxiv.org/abs/1307.3949 abs/1307.3949 db/journals/corr/corr1307.html#Borgwardt13

Steffen Borgwardt Andreas Brieden Peter Gritzmann A balanced k-means algorithm for weighted point sets. 2013 CoRR http://arxiv.org/abs/1308.4004 abs/1308.4004 db/journals/corr/corr1308.html#BorgwardtBG13

Steffen Borgwardt Andreas Brieden Peter Gritzmann Constrained Minimum-<i>k</i>-Star Clustering and its application to the consolidation of farmland. 1-17 2011 11 Oper. Res. 1 https://doi.org/10.1007/s12351-009-0041-y db/journals/or/or11.html#BorgwardtBG11

Ethan B. Anderes Margaret BayerMargaret M. Bayer Alexander E. Black Cornelius Brand Andreas Brieden Matthias Brugger Calum Buchanan Teressa Chambers Eric Culver Spencer Daugherty Aleyah Dawkins Danai Deligeorgaki Andreas Emil Feldmann Elisabeth Finhold Bryce Frederickson Rafael M. Frongillo Weston Grewe Peter Gritzmann Felix Happach Raymond Hemmecke Sean Kafer Martin Koutecký Jon Lee 0001 Hsin-Chieh Liao Jesús A. De Loera Alexander Malkis Tyrrell McAllister Jacob Miller 0002 Angela Morrison Garrett Nelson Shmuel Onn Stephan Patterson M. Puck RombachPuck Rombach Laura Sanità Felix Schmiedl Tamon Stephen Andrés R. Vindas-Meléndez Charles Viss Youngho Yoo Timothy Yusun Stetson Zirkelbach