| Publication | Date of Publication | Type |
|---|
Circuits in extended formulations
Discrete Optimization | 2024-06-28 | Paper |
| On Combinatorial Network Flows Algorithms and Circuit Augmentation for Pseudoflows | 2023-12-19 | Paper |
| Path Odd-Covers of Graphs | 2023-06-10 | Paper |
A column generation approach to the discrete barycenter problem
Discrete Optimization | 2023-03-29 | Paper |
| An Integer Program for Pricing Support Points of Exact Barycenters | 2022-10-25 | Paper |
| Circuits in Extended Formulations | 2022-08-10 | Paper |
Circuit walks in integral polyhedra
Discrete Optimization | 2022-06-09 | Paper |
A polyhedral model for enumeration and optimization over the set of circuits
Discrete Applied Mathematics | 2022-01-05 | Paper |
A note on the approximability of deepest-descent circuit steps
Operations Research Letters | 2021-12-13 | Paper |
On the computational complexity of finding a sparse Wasserstein barycenter
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Constructing Clustering Transformations
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
| An Algorithm for the Separation-Preserving Transition of Clusterings | 2020-12-10 | Paper |
A Note on the Approximability of Deepest-Descent Circuit Steps
(available as arXiv preprint) | 2020-10-21 | Paper |
Good clusterings have large volume
Operations Research | 2020-10-12 | Paper |
An implementation of steepest-descent augmentation for linear programs
Operations Research Letters | 2020-05-26 | Paper |
An implementation of steepest-descent augmentation for linear programs
(available as arXiv preprint) | 2019-11-19 | Paper |
On the Computational Complexity of Finding a Sparse Wasserstein Barycenter
(available as arXiv preprint) | 2019-10-16 | Paper |
A Column Generation Approach to the Discrete Barycenter Problem
(available as arXiv preprint) | 2019-07-02 | Paper |
Power diagram detection with applications to information elicitation
Journal of Optimization Theory and Applications | 2019-06-07 | Paper |
On the circuit diameter conjecture
Discrete & Computational Geometry | 2018-10-30 | Paper |
The diameters of network-flow polytopes satisfy the Hirsch conjecture
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Efficient solutions for weight-balanced partitioning problems
Discrete Optimization | 2018-05-24 | Paper |
The hierarchy of circuit diameters and transportation polytopes
Discrete Applied Mathematics | 2018-04-04 | Paper |
Edges versus circuits: a hierarchy of diameters in polyhedra
advg | 2018-03-29 | Paper |
| Improved Linear Programs for Discrete Barycenters | 2018-03-29 | Paper |
An LP-based \(k\)-means algorithm for balancing weighted point sets
European Journal of Operational Research | 2018-02-06 | Paper |
Circuit Walks in Integral Polyhedra
(available as arXiv preprint) | 2017-12-05 | Paper |
Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland
Operational Research. An International Journal | 2017-06-29 | Paper |
| An LP-based, Strongly-Polynomial 2-Approximation Algorithm for Sparse Wasserstein Barycenters | 2017-04-18 | Paper |
Discrete Wasserstein barycenters: optimal transport for discrete data
Mathematical Methods of Operations Research | 2016-11-29 | Paper |
Quadratic diameter bounds for dual network flow polyhedra
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
On the circuit diameter of dual transportation polyhedra
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Geometric clustering: mathematics for the consolidation of farmland
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2015-08-31 | Paper |
Geometric clustering for the consolidation of farmland and woodland
The Mathematical Intelligencer | 2014-12-17 | Paper |
On the diameter of partition polytopes and vertex-disjoint cycle cover
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
(available as arXiv preprint) | N/A | Paper |
On the Diameter of a 2-Sum of Polyhedra
(available as arXiv preprint) | N/A | Paper |
On the Hardness of Short and Sign-Compatible Circuit Walks
(available as arXiv preprint) | N/A | Paper |
Combinatorics of generalized parking-function polytopes
(available as arXiv preprint) | N/A | Paper |
