| Publication | Date of Publication | Type |
|---|
| Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tails | 2023-04-03 | Paper |
| High Probability Convergence of Clipped-SGD Under Heavy-tailed Noise | 2023-02-10 | Paper |
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Approximation algorithms for stochastic \(k\)-TSP
(available as arXiv preprint) | 2020-11-25 | Paper |
Local distribution and the symmetry gap: approximability of multiway partitioning problems
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-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 |
Submodular unsplittable flow on trees
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Constant congestion routing of symmetric demands in planar directed graphs
SIAM Journal on Discrete Mathematics | 2018-08-22 | Paper |
Online Buy-at-Bulk Network Design
SIAM Journal on Computing | 2018-08-03 | Paper |
| scientific article; zbMATH DE number 6820196 (Why is no real title available?) | 2017-12-19 | Paper |
Geometric Packing under Nonuniform Constraints
SIAM Journal on Computing | 2017-11-22 | Paper |
On routing disjoint paths in bounded treewidth graphs
(available as arXiv preprint) | 2017-10-17 | Paper |
| scientific article; zbMATH DE number 6783450 (Why is no real title available?) | 2017-09-29 | Paper |
Routing under balance
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture | 2017-03-22 | Paper |
Submodular unsplittable flow on trees
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
From graph to hypergraph multiway partition: is the single threshold the only route?
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Approximation Algorithms for Submodular Multiway Partition
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Approximation algorithms and hardness of integral concurrent flow
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Node-weighted network design in planar and minor-closed families of graphs
Automata, Languages, and Programming | 2013-08-12 | Paper |
Prize-collecting survivable network design in node-weighted graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Submodular Cost Allocation Problem and Applications
Automata, Languages and Programming | 2011-07-06 | Paper |
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
