Steffen Borgwardt

Orcid: 0000-0002-8069-5046

Affiliations:
  • University of Colorado, Denver, CO, USA
  • University of California, Davis, CA, USA
  • TU Munich, Germany


According to our database1, Steffen Borgwardt authored at least 28 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Combinatorial Diameters of Parallel and Series Connections.
SIAM J. Discret. Math., March, 2024

2023
An Algorithm for the Separation-Preserving Transition of Clusterings.
INFORMS J. Optim., January, 2023

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

Circuit walks in integral polyhedra.
Discret. Optim., 2022

A column generation approach to the discrete barycenter problem.
Discret. Optim., 2022

A polyhedral model for enumeration and optimization over the set of circuits.
Discret. Appl. Math., 2022

2021
Constructing Clustering Transformations.
SIAM J. Discret. Math., 2021

A note on the approximability of deepest-descent circuit steps.
Oper. Res. Lett., 2021

On the computational complexity of finding a sparse Wasserstein barycenter.
J. Comb. Optim., 2021

2020
Improved Linear Programs for Discrete Barycenters.
INFORMS J. Optim., January, 2020

An implementation of steepest-descent augmentation for linear programs.
Oper. Res. Lett., 2020

2019
Power Diagram Detection with Applications to Information Elicitation.
J. Optim. Theory Appl., 2019

Good Clusterings Have Large Volume.
Oper. Res., 2019

2018
The diameters of network-flow polytopes satisfy the Hirsch conjecture.
Math. Program., 2018

On the Circuit Diameter Conjecture.
Discret. Comput. Geom., 2018

The hierarchy of circuit diameters and transportation polytopes.
Discret. Appl. Math., 2018

2017
An LP-based k-means algorithm for balancing weighted point sets.
Eur. J. Oper. Res., 2017

Reachability in Binary Multithreaded Programs Is Polynomial.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Quadratic diameter bounds for dual network flow polyhedra.
Math. Program., 2016

Discrete Wasserstein barycenters: optimal transport for discrete data.
Math. Methods Oper. Res., 2016

Efficient solutions for weight-balanced partitioning problems.
Discret. Optim., 2016

2015
Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie)
PhD thesis, 2015

On the Circuit Diameter of Dual Transportation Polyhedra.
SIAM J. Discret. Math., 2015

On Soft Power Diagrams.
J. Math. Model. Algorithms Oper. Res., 2015

2014
Threshold-based preprocessing for approximating the weighted dense k-subgraph problem.
Eur. J. Oper. Res., 2014

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

A balanced k-means algorithm for weighted point sets.
CoRR, 2013

2011
Constrained Minimum-<i>k</i>-Star Clustering and its application to the consolidation of farmland.
Oper. Res., 2011


  Loading...