| Publication | Date of Publication | Type |
|---|
| Single-source unsplittable flows in planar graphs | 2024-11-28 | Paper |
| Congruency-constrained TU problems beyond the bimodular case | 2024-11-07 | Paper |
| Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation | 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+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation | 2024-05-08 | Paper |
| Bridging the gap between tree and connectivity augmentation: unified and stronger approaches | 2023-11-14 | Paper |
| Advances on strictly \(\varDelta \)-modular IPs | 2023-11-09 | Paper |
| Constant-competitiveness for random assignment matroid secretary without knowing the matroid | 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 | 2022-10-14 | Paper |
| A Framework for the Secretary Problem on the Intersection of Matroids | 2022-07-08 | Paper |
| An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint | 2022-03-22 | Paper |
| A technique for obtaining true approximations for \(k\)-center with covering constraints | 2022-03-22 | Paper |
| Reducing Path TSP to TSP | 2021-11-19 | Paper |
| Online contention resolution schemes with applications to Bayesian selection problems | 2021-03-24 | Paper |
| The one-way communication complexity of submodular maximization with applications to streaming and robustness | 2021-01-19 | Paper |
| Reducing path TSP to TSP | 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 |
| A new contraction technique with applications to congruency-constrained cuts | 2020-08-28 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-08-28 | Paper |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes | 2020-05-31 | Paper |
| Submodular Maximization Through the Lens of Linear Programming | 2020-04-30 | Paper |
| An improved analysis of local search for max-sum diversification | 2020-04-30 | Paper |
| A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem | 2020-03-12 | Paper |
| Submodular minimization under congruency constraints | 2020-02-26 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-02-06 | Paper |
| A new contraction technique with applications to congruency-constrained cuts | 2020-02-06 | Paper |
| A 1.5-approximation for path TSP | 2019-10-15 | Paper |
| A new dynamic programming approach for spanning trees with chain constraints and beyond | 2019-10-15 | Paper |
| Improved approximation for tree augmentation: saving by rewiring | 2019-08-22 | Paper |
| Matroidal degree-bounded minimum spanning trees | 2019-05-10 | Paper |
| Firefighting on trees beyond integrality gaps | 2019-03-28 | Paper |
| Refuting a conjecture of goemans on bounded degree spanning trees | 2019-01-15 | Paper |
| \(k\)-trails: recognition, complexity, and approximations | 2018-10-26 | Paper |
| Connectivity interdiction | 2018-09-28 | Paper |
| Congestion games viewed from M-convexity | 2018-09-28 | Paper |
| On the number of distinct rows of a matrix with bounded subdeterminants | 2018-07-18 | Paper |
| Online contention resolution schemes | 2018-07-16 | Paper |
| Firefighting on trees beyond integrality gaps | 2018-07-16 | Paper |
| Extension complexity lower bounds for mixed-integer extended formulations | 2018-07-16 | Paper |
| Local Search for Max-Sum Diversification | 2018-07-16 | Paper |
| Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix | 2018-06-25 | Paper |
| Hardness and approximation for network flow interdiction | 2018-04-27 | Paper |
| The submodular secretary problem goes linear | 2018-04-24 | 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 | 2018-03-15 | Paper |
| Submodular minimization under congruency constraints | 2018-03-15 | Paper |
| Chain-constrained spanning trees | 2018-02-28 | Paper |
| Sublinear bounds for a quantitative Doignon-Bell-Scarf theorem | 2018-02-07 | Paper |
| Max-sum diversity via convex programming | 2018-01-30 | Paper |
| A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem | 2017-10-05 | Paper |
| Multi-budgeted matchings and matroid intersection via dependent rounding | 2017-09-29 | Paper |
| Matroids are immune to Braess' paradox | 2017-09-22 | Paper |
| Extension complexities of Cartesian products involving a pyramid | 2017-09-19 | Paper |
| A strongly polynomial algorithm for bimodular integer linear programming | 2017-08-17 | Paper |
| Interdicting structured combinatorial optimization problems with {0,1}-objectives | 2017-04-13 | Paper |
| \(k\)-trails: recognition, complexity, and approximations | 2016-08-10 | Paper |
| Approximate dynamic programming for stochastic linear control problems on compact state spaces | 2016-06-23 | Paper |
| Bulk-robust combinatorial optimization | 2015-02-09 | Paper |
| New approaches to multi-objective optimization | 2014-08-29 | Paper |
| Time-expanded packings | 2014-07-01 | Paper |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes | 2014-06-05 | Paper |
| Network design with a discrete set of traffic matrices | 2014-05-14 | Paper |
| Matroids and integrality gaps for hypergraphic Steiner tree relaxations | 2014-05-13 | Paper |
| An adaptive routing approach for personal rapid transit | 2013-08-02 | Paper |
| Stable routing and unique-max coloring on trees | 2013-06-27 | Paper |
| Advances on matroid secretary problems: free order model and laminar case | 2013-03-19 | Paper |
| Chain-constrained spanning trees | 2013-03-19 | Paper |
| Bisections above Tight Lower Bounds | 2012-11-06 | Paper |
| A flow model based on polylinking system | 2012-10-15 | Paper |
| A note on chromatic properties of threshold graphs | 2012-05-30 | Paper |
| Approximation Algorithms for Conflict-Free Vehicle Routing | 2011-09-16 | Paper |
| High-confidence estimation of small \(s-t\) reliabilities in directed acyclic networks | 2011-08-16 | Paper |
| Stochastic convergence of random search methods to fixed size Pareto front approximations | 2011-06-22 | Paper |
| An \(s\)-\(t\) connection problem with adaptability | 2011-05-17 | Paper |
| A 2-approximation for the maximum satisfying bisection problem | 2011-04-29 | Paper |
| A simple proof for a characterization of sign-central matrices using linear duality | 2011-04-07 | Paper |
| Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks | 2011-04-07 | Paper |
| Matching interdiction | 2010-11-05 | Paper |
| Approximation Schemes for Multi-Budgeted Independence Systems | 2010-09-06 | Paper |
| Network flow interdiction on planar graphs | 2010-08-13 | Paper |
| Computational complexity of impact size estimation for spreading processes on networks | 2010-06-23 | Paper |
| Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid | 2009-12-15 | Paper |
| Blockers and transversals | 2009-12-10 | Paper |
| A tight bound on the collection of edges in MSTs of induced subgraphs | 2009-03-04 | Paper |
| Ghost Value Augmentation for $k$-Edge-Connectivity | N/A | Paper |
