| Publication | Date of Publication | Type |
|---|
| Adaptive sparsification for matroid intersection | 2026-01-14 | Paper |
| Minimum cuts in directed graphs via partial sparsification | 2025-08-13 | Paper |
| Approximating the Held-Karp bound for metric TSP in nearly-linear time | 2025-08-06 | Paper |
| Independent sets in elimination graphs with a submodular objective | 2025-01-14 | Paper |
| Convergence to lexicographically optimal base in a (contra)polymatroid and applications to densest subgraph and tree packing | 2025-01-06 | Paper |
| Faster exact and approximation algorithms for packing and covering matroids via push-relabel | 2024-11-28 | Paper |
| Adaptive out-orientations with applications | 2024-11-28 | Paper |
| Quotient sparsification for submodular functions | 2024-11-28 | Paper |
| Approximating optimal transport with linear programs | 2024-08-26 | Paper |
| LP relaxation and tree packing for minimum \(k\)-cuts | 2024-08-26 | Paper |
| Densest subgraph: supermodularity, iterative peeling, and flow | 2024-07-19 | Paper |
| Nearly linear time approximations for mixed packing and covering problems without data structures or randomization | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788425 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7768369 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Online Directed Spanners and Steiner Forests.
(available as arXiv preprint) | 2023-11-20 | Paper |
| Fast and Deterministic Approximations for k-Cut. | 2023-02-03 | Paper |
Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
Fast and deterministic approximations for \(k\)-cut
Theory of Computing | 2022-05-18 | Paper |
Fast LP-based Approximations for Geometric Packing and Covering Problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Computing Circle Packing Representations of Planar Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
\(\ell_1\)-sparsity approximation bounds for packing integer programs
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
LP relaxation and tree packing for minimum \(k\)-cut
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
\(\ell_1\)-sparsity approximation bounds for packing integer programs
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Parallelizing greedy for submodular set function maximization in matroids and beyond
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Submodular function maximization in parallel via the multilinear relaxation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On approximating (sparse) covering integer programs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Near-linear time approximation schemes for some implicit fractional packing problems
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A Fast Approximation for Maximum Weight Matroid Intersection
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Randomized MWU for positive LPs | 2018-03-15 | Paper |
Approximation algorithms for polynomial-expansion and low-density graphs
SIAM Journal on Computing | 2017-11-22 | Paper |
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Streaming algorithms for submodular function maximization
Automata, Languages, and Programming | 2015-10-27 | Paper |
