| Publication | Date of Publication | Type |
|---|
Ghost Value Augmentation for k-Edge-Connectivity
(available as arXiv preprint) | N/A | Paper |
| On the complexity of the odd-red bipartite perfect matching polytope | 2026-09-16 | Paper |
| Approximation schemes for planar graph connectivity problems | 2026-09-16 | Paper |
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
SIAM Journal on Computing | 2026-09-02 | Paper |
Streaming submodular maximization under matroid constraints (edit)
Mathematics of Operations Research | 2026-03-20 | Paper |
| A better-than-2 approximation for weighted tree augmentation | 2025-08-13 | Paper |
| An O(1)-approximation for minimum spanning tree interdiction | 2025-08-05 | Paper |
| The submodular secretary problem goes linear | 2025-08-05 | Paper |
Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
Journal of the ACM | 2025-06-27 | Paper |
| Submodular maximization subject to matroid intersection on the fly | 2025-06-19 | Paper |
| Techniques for generalized colorful k-center problems | 2025-06-19 | Paper |
| Dependent randomized rounding via exchange properties of combinatorial structures | 2025-04-29 | Paper |
Constant-competitiveness for random assignment matroid secretary without knowing the matroid
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Advances on strictly -modular IPs
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
The one-way communication complexity of submodular maximization with applications to streaming and robustness
Journal of the ACM | 2025-02-05 | Paper |
A new dynamic programming approach for spanning trees with chain constraints and beyond
Mathematics of Operations Research | 2025-01-28 | Paper |
| Single-source unsplittable flows in planar graphs | 2024-11-28 | Paper |
Congruency-constrained TU problems beyond the bimodular case
Mathematics of Operations Research | 2024-11-07 | Paper |
Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
| Congruency-constrained TU problems beyond the bimodular case | 2024-07-19 | Paper |
| Local search for weighted tree augmentation and Steiner tree | 2024-07-19 | Paper |
| Streaming submodular maximization under matroid constraints | 2024-06-24 | Paper |
| A (1.5+)-approximation algorithm for weighted connectivity augmentation | 2024-05-08 | Paper |
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Advances on strictly \(\varDelta \)-modular IPs
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Constant-competitiveness for random assignment matroid secretary without knowing the matroid
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
| Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information | 2022-11-28 | Paper |
| A Simple Combinatorial Algorithm for Robust Matroid Center | 2022-11-07 | Paper |
A technique for obtaining true approximations for k-center with covering constraints
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
A Framework for the Secretary Problem on the Intersection of Matroids
SIAM Journal on Computing | 2022-07-08 | Paper |
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
A technique for obtaining true approximations for \(k\)-center with covering constraints
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Reducing Path TSP to TSP
SIAM Journal on Computing | 2021-11-19 | Paper |
Online contention resolution schemes with applications to Bayesian selection problems
SIAM Journal on Computing | 2021-03-24 | Paper |
Reducing path TSP to TSP
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The one-way communication complexity of submodular maximization with applications to streaming and robustness
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the F\"uredi, Kahn, and Seymour Conjecture | 2020-09-01 | Paper |
Approximate multi-matroid intersection via iterative refinement
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
A new contraction technique with applications to congruency-constrained cuts
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Submodular function maximization via the multilinear relaxation and contention resolution schemes
SIAM Journal on Computing | 2020-05-31 | Paper |
Submodular Maximization Through the Lens of Linear Programming
Mathematics of Operations Research | 2020-04-30 | Paper |
An improved analysis of local search for max-sum diversification
Mathematics of Operations Research | 2020-04-30 | Paper |
A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
Mathematics of Operations Research | 2020-03-12 | Paper |
Submodular minimization under congruency constraints
Combinatorica | 2020-02-26 | Paper |
Approximate multi-matroid intersection via iterative refinement
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Approximate multi-matroid intersection via iterative refinement
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
A new contraction technique with applications to congruency-constrained cuts
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
A 1.5-approximation for path TSP
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A new dynamic programming approach for spanning trees with chain constraints and beyond
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Improved approximation for tree augmentation: saving by rewiring
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Matroidal degree-bounded minimum spanning trees
(available as arXiv preprint) | 2019-05-10 | Paper |
| Matroidal degree-bounded minimum spanning trees | 2019-05-10 | Paper |
Firefighting on trees beyond integrality gaps
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Refuting a conjecture of goemans on bounded degree spanning trees
Operations Research Letters | 2019-01-15 | Paper |
\(k\)-trails: recognition, complexity, and approximations
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Connectivity interdiction
Operations Research Letters | 2018-09-28 | Paper |
Congestion games viewed from M-convexity
Operations Research Letters | 2018-09-28 | Paper |
On the number of distinct rows of a matrix with bounded subdeterminants
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Online contention resolution schemes
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Local Search for Max-Sum Diversification
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Extension complexity lower bounds for mixed-integer extended formulations
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Firefighting on trees beyond integrality gaps
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
Hardness and approximation for network flow interdiction
Networks | 2018-04-27 | Paper |
The submodular secretary problem goes linear
SIAM Journal on Computing | 2018-04-24 | Paper |
A framework for the secretary problem on the intersection of matroids
(available as arXiv preprint) | 2018-03-15 | Paper |
| A framework for the secretary problem on the intersection of matroids | 2018-03-15 | Paper |
Lifting linear extension complexity bounds to the mixed-integer setting
(available as arXiv preprint) | 2018-03-15 | Paper |
| Lifting linear extension complexity bounds to the mixed-integer setting | 2018-03-15 | Paper |
| Submodular minimization under congruency constraints | 2018-03-15 | Paper |
Chain-constrained spanning trees
Mathematical Programming. Series A. Series B | 2018-02-28 | Paper |
Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem
SIAM Journal on Discrete Mathematics | 2018-02-07 | Paper |
Max-sum diversity via convex programming
(available as arXiv preprint) | 2018-01-30 | Paper |
A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Multi-budgeted matchings and matroid intersection via dependent rounding | 2017-09-29 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
Matroids are immune to Braess' paradox
Mathematics of Operations Research | 2017-09-22 | Paper |
Extension complexities of Cartesian products involving a pyramid
Information Processing Letters | 2017-09-19 | Paper |
A strongly polynomial algorithm for bimodular integer linear programming
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Interdicting structured combinatorial optimization problems with {0,1}-objectives
Mathematics of Operations Research | 2017-04-13 | Paper |
\(k\)-trails: recognition, complexity, and approximations
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Approximate dynamic programming for stochastic linear control problems on compact state spaces
European Journal of Operational Research | 2016-06-23 | Paper |
Bulk-robust combinatorial optimization
Mathematical Programming. Series A. Series B | 2015-02-09 | Paper |
New approaches to multi-objective optimization
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Time-expanded packings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Network design with a discrete set of traffic matrices
Operations Research Letters | 2014-05-14 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
An adaptive routing approach for personal rapid transit
Mathematical Methods of Operations Research | 2013-08-02 | Paper |
Stable routing and unique-max coloring on trees
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Advances on matroid secretary problems: free order model and laminar case
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Chain-constrained spanning trees
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Bisections above Tight Lower Bounds
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
A flow model based on polylinking system
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
A note on chromatic properties of threshold graphs
Discrete Mathematics | 2012-05-30 | Paper |
Approximation Algorithms for Conflict-Free Vehicle Routing
Algorithms – ESA 2011 | 2011-09-16 | Paper |
High-confidence estimation of small s-t reliabilities in directed acyclic networks
Networks | 2011-08-16 | Paper |
Stochastic convergence of random search methods to fixed size Pareto front approximations
European Journal of Operational Research | 2011-06-22 | Paper |
An s-t connection problem with adaptability
Discrete Applied Mathematics | 2011-05-17 | Paper |
A 2-approximation for the maximum satisfying bisection problem
European Journal of Operational Research | 2011-04-29 | Paper |
A simple proof for a characterization of sign-central matrices using linear duality
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Matching interdiction
Discrete Applied Mathematics | 2010-11-05 | Paper |
Approximation Schemes for Multi-Budgeted Independence Systems
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Network flow interdiction on planar graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
