Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Borgwardt
Person information
- affiliation: University of Colorado, Denver, CO, USA
- affiliation: University of California, Davis, CA, USA
- affiliation: TU Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Steffen Borgwardt:
Data Analysis through Polyhedral Theory (Datenanalyse durch Polyedrische Theorie). Technical University of Munich, Germany, 2015
Journal Articles
- 2024
- [j25]Steffen Borgwardt
, Weston Grewe, Jon Lee:
On the Combinatorial Diameters of Parallel and Series Connections. SIAM J. Discret. Math. 38(1): 485-503 (2024) - 2023
- [j24]Steffen Borgwardt, Felix Happach, Stetson Zirkelbach:
An Algorithm for the Separation-Preserving Transition of Clusterings. INFORMS J. Optim. 5(1): 1-26 (2023) - 2022
- [j23]Steffen Borgwardt, Charles Viss:
A polyhedral model for enumeration and optimization over the set of circuits. Discret. Appl. Math. 308: 68-83 (2022) - [j22]Steffen Borgwardt, Stephan Patterson:
A column generation approach to the discrete barycenter problem. Discret. Optim. 43: 100674 (2022) - [j21]Steffen Borgwardt, Charles Viss:
Circuit walks in integral polyhedra. Discret. Optim. 44(Part): 100566 (2022) - [j20]Steffen Borgwardt:
An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters. Oper. Res. 22(2): 1511-1551 (2022) - 2021
- [j19]Steffen Borgwardt, Stephan Patterson:
On the computational complexity of finding a sparse Wasserstein barycenter. J. Comb. Optim. 41(3): 736-761 (2021) - [j18]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A note on the approximability of deepest-descent circuit steps. Oper. Res. Lett. 49(3): 310-315 (2021) - [j17]Steffen Borgwardt, Charles Viss:
Constructing Clustering Transformations. SIAM J. Discret. Math. 35(1): 152-178 (2021) - 2020
- [j16]Steffen Borgwardt, Stephan Patterson:
Improved Linear Programs for Discrete Barycenters. INFORMS J. Optim. 2(1): 14-33 (2020) - [j15]Steffen Borgwardt, Charles Viss:
An implementation of steepest-descent augmentation for linear programs. Oper. Res. Lett. 48(3): 323-328 (2020) - 2019
- [j14]Steffen Borgwardt, Felix Happach:
Good Clusterings Have Large Volume. Oper. Res. 67(1): 215-231 (2019) - [j13]Steffen Borgwardt, Rafael M. Frongillo:
Power Diagram Detection with Applications to Information Elicitation. J. Optim. Theory Appl. 181(1): 184-196 (2019) - 2018
- [j12]Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold, Jacob Miller:
The hierarchy of circuit diameters and transportation polytopes. Discret. Appl. Math. 240: 8-24 (2018) - [j11]Steffen Borgwardt, Tamon Stephen, Timothy Yusun:
On the Circuit Diameter Conjecture. Discret. Comput. Geom. 60(3): 558-587 (2018) - [j10]Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold:
The diameters of network-flow polytopes satisfy the Hirsch conjecture. Math. Program. 171(1-2): 283-309 (2018) - 2017
- [j9]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
An LP-based k-means algorithm for balancing weighted point sets. Eur. J. Oper. Res. 263(2): 349-355 (2017) - 2016
- [j8]Steffen Borgwardt, Shmuel Onn:
Efficient solutions for weight-balanced partitioning problems. Discret. Optim. 21: 71-84 (2016) - [j7]Ethan B. Anderes, Steffen Borgwardt, Jacob Miller:
Discrete Wasserstein barycenters: optimal transport for discrete data. Math. Methods Oper. Res. 84(2): 389-409 (2016) - [j6]Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:
Quadratic diameter bounds for dual network flow polyhedra. Math. Program. 159(1-2): 237-251 (2016) - 2015
- [j5]Steffen Borgwardt:
On Soft Power Diagrams. J. Math. Model. Algorithms Oper. Res. 14(2): 173-196 (2015) - [j4]Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:
On the Circuit Diameter of Dual Transportation Polyhedra. SIAM J. Discret. Math. 29(1): 113-121 (2015) - 2014
- [j3]Steffen Borgwardt, Felix Schmiedl:
Threshold-based preprocessing for approximating the weighted dense k-subgraph problem. Eur. J. Oper. Res. 234(3): 631-640 (2014) - 2013
- [j2]Steffen Borgwardt:
On the diameter of partition polytopes and vertex-disjoint cycle cover. Math. Program. 141(1-2): 1-20 (2013) - 2011
- [j1]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland. Oper. Res. 11(1): 1-17 (2011)
Conference and Workshop Papers
- 2017
- [c1]Alexander Malkis, Steffen Borgwardt:
Reachability in Binary Multithreaded Programs Is Polynomial. ICDCS 2017: 2083-2088
Informal and Other Publications
- 2020
- [i5]Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký:
A Note on the Approximability of Deepest-Descent Circuit Steps. CoRR abs/2010.10809 (2020) - 2019
- [i4]Steffen Borgwardt, Charles Viss:
Constructing Clustering Transformations. CoRR abs/1904.05406 (2019) - [i3]Steffen Borgwardt, Stephan Patterson:
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter. CoRR abs/1910.07568 (2019) - 2013
- [i2]Steffen Borgwardt:
On Soft Power Diagrams. CoRR abs/1307.3949 (2013) - [i1]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
A balanced k-means algorithm for weighted point sets. CoRR abs/1308.4004 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-24 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
