| Publication | Date of Publication | Type |
|---|
| Hedgegraph polymatroids | 2026-09-16 | Paper |
| Streaming algorithms for network design | 2026-09-11 | Paper |
| Covering a few submodular constraints and applications | 2026-09-11 | Paper |
| On deleting vertices to reduce density in graphs and supermodular functions | 2026-09-10 | Paper |
| Online disjoint spanning trees and polymatroid bases | 2026-09-10 | Paper |
| Edge-disjoint paths in planar graphs | 2026-05-29 | Paper |
| Approximation algorithms for non-uniform buy-at-bulk network design | 2026-05-29 | Paper |
| Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing | 2026-05-26 | Paper |
| From directed Steiner tree to directed polymatroid Steiner tree in planar graphs | 2026-05-26 | Paper |
| Revisiting priority k-center: fairness and outliers | 2026-05-12 | Paper |
| Faster algorithms for rooted connectivity in directed graphs | 2026-05-12 | Paper |
| Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity | 2026-05-12 | Paper |
| Approximation schemes for minimizing average weighted completion time with release dates | 2026-05-06 | Paper |
Polyhedral aspects of feedback vertex set and pseudoforest deletion set
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
| Approximating a finite metric by a small number of tree metrics | 2025-10-29 | Paper |
| On the generalized mean densest subgraph problem: complexity and algorithms | 2025-10-06 | Paper |
| Hypergraph k-cut for fixed k in deterministic polynomial time | 2025-08-12 | Paper |
| Approximating the Held-Karp bound for metric TSP in nearly-linear time | 2025-08-06 | Paper |
| Approximation algorithms for Euler genus and related problems | 2025-05-20 | Paper |
| Dependent randomized rounding via exchange properties of combinatorial structures | 2025-04-29 | Paper |
| Bicriteria approximation algorithms for priority matroid median | 2025-01-14 | 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 |
| Adaptive out-orientations with applications | 2024-11-28 | Paper |
| Approximation algorithms for network design in non-uniform fault models | 2024-11-14 | Paper |
On submodular prophet inequalities and correlation gap
Theoretical Computer Science | 2024-11-06 | Paper |
| Approximate representation of symmetric submodular functions via hypergraph cut functions | 2024-09-12 | 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 |
| Contention resolution for the -fold union of a matroid via the correlation gap | 2024-05-29 | Paper |
| scientific article; zbMATH DE number 7788402 (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 |
Min-max partitioning of hypergraphs and symmetric submodular functions
Combinatorica | 2023-10-04 | Paper |
Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time
Mathematics of Operations Research | 2023-01-09 | Paper |
Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks
Theory of Computing | 2022-07-26 | Paper |
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
ACM Transactions on Algorithms | 2022-02-16 | Paper |
scientific article; zbMATH DE number 7378621 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | 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 |
On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem
Theory of Computing | 2020-12-17 | Paper |
Hypergraph k-cut for fixed k in deterministic polynomial time
(available as arXiv preprint) | 2020-09-25 | 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 |
Submodular function maximization via the multilinear relaxation and contention resolution schemes
SIAM Journal on Computing | 2020-05-31 | Paper |
_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 |
| A note on iterated rounding for the survivable network design problem | 2019-10-25 | Paper |
| Congestion minimization for multipath routing via multiroute flows | 2019-10-25 | 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 |
Poly-logarithmic approximation for maximum node disjoint paths with constant congestion
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7051282 (Why is no real title available?) | 2019-05-06 | Paper |
Minimum cuts and sparsification in hypergraphs
SIAM Journal on Computing | 2018-12-05 | Paper |
Edge-disjoint paths revisited
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Constant congestion routing of symmetric demands in planar directed graphs
SIAM Journal on Discrete Mathematics | 2018-08-22 | Paper |
Approximation algorithms for Euler genus and related problems
SIAM Journal on Computing | 2018-08-21 | Paper |
Polynomial bounds for the grid-minor theorem
Journal of the ACM | 2018-08-02 | 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 |
Simple and fast rounding algorithms for directed and node-weighted multiway cut
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Constant factor approximation for subset feedback set problems via a new LP relaxation
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | 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 |
Approximating multicut and the demand graph
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computing minimum cuts in hypergraphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Randomized MWU for positive LPs | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6820196 (Why is no real title available?) | 2017-12-19 | Paper |
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Degree-3 treewidth sparsifiers
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Degree-3 treewidth sparsifiers
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| scientific article; zbMATH DE number 6783450 (Why is no real title available?) | 2017-09-29 | Paper |
| Multi-budgeted matchings and matroid intersection via dependent rounding | 2017-09-29 | Paper |
On multiplicative weight updates for concave and submodular function maximization
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Performance guarantees for the TSP with a parameterized triangle inequality
Information Processing Letters | 2016-06-16 | Paper |
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Centrality of trees for capacitated \(k\)-center
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
On element-connectivity preserving graph simplification
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Streaming algorithms for submodular function maximization
Automata, Languages, and Programming | 2015-10-27 | Paper |
| scientific article; zbMATH DE number 6472607 (Why is no real title available?) | 2015-08-14 | Paper |
Multicommodity flows and cuts in polymatroidal networks
SIAM Journal on Computing | 2015-08-03 | Paper |
Approximability of capacitated network design
Algorithmica | 2015-07-10 | Paper |
Approximability of capacitated network design
Algorithmica | 2015-07-10 | Paper |
Polynomial bounds for the grid-minor theorem
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Algorithms for minimizing weighted flow time
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Approximation algorithms for node-weighted buy-at-bulk network design | 2014-12-18 | Paper |
On the set multicover problem in geometric settings
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Edge-disjoint paths in planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A graph reduction step preserving element-connectivity and packing Steiner trees and forests
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Large-treewidth graph decompositions and applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Approximation Algorithms for Submodular Multiway Partition
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | 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 |
Centrality of trees for capacitated \(k\)-center
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Flow-cut gaps for integer and fractional multiflows
(available as arXiv preprint) | 2014-05-22 | Paper |
The all-or-nothing multicommodity flow problem
SIAM Journal on Computing | 2013-11-14 | Paper |
Node-weighted network design in planar and minor-closed families of graphs
Automata, Languages, and Programming | 2013-08-12 | Paper |
Maximum edge-disjoint paths in k-sums of graphs
Automata, Languages, and Programming | 2013-08-06 | Paper |
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
Prize-collecting survivable network design in node-weighted graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Pruning 2-connected graphs | 2012-10-19 | Paper |
| Single-sink network design with vertex connectivity requirements | 2012-10-19 | Paper |
