| Publication | Date of Publication | Type |
|---|
| Sparsification of directed graphs via cut balance | 2026-05-12 | Paper |
| Universal algorithms for clustering problems | 2026-05-12 | Paper |
| Online algorithms for weighted paging with predictions | 2026-03-18 | Paper |
| Robust algorithms for TSP and Steiner tree | 2026-03-18 | Paper |
| Online two-dimensional load balancing | 2026-03-18 | Paper |
Deterministic minimum cut in poly-logarithmic maximum flows
Journal of the ACM | 2025-10-23 | Paper |
Vertex connectivity in poly-logarithmic max-flows
Journal of the ACM | 2025-10-23 | Paper |
| All-pairs max-flow is no harder than single-pair max-flow: Gomory-Hu trees in almost-linear time | 2025-08-15 | Paper |
| Breaking the cubic barrier for all-pairs max-flow: Gomory-Hu tree in nearly quadratic time | 2025-08-15 | Paper |
| Minimum cuts in directed graphs via partial sparsification | 2025-08-13 | Paper |
| A nearly optimal all-pairs min-cuts algorithm in simple graphs | 2025-08-13 | Paper |
| A hitting set relaxation for k-server and an extension to time-windows | 2025-08-13 | Paper |
| Deterministic min-cut in poly-logarithmic max-flows | 2025-08-12 | Paper |
| Online algorithms for covering and packing problems with convex objectives | 2025-08-06 | Paper |
| Online buy-at-bulk network design | 2025-08-05 | Paper |
| Tight bounds for online vector scheduling | 2025-08-05 | Paper |
| Online node-weighted Steiner forest and extensions via disk paintings | 2025-05-20 | Paper |
| Online matching with stochastic rewards | 2025-05-05 | Paper |
Online paging with heterogeneous cache slots
Algorithmica | 2025-01-24 | Paper |
| Efficient algorithms and hardness results for the weighted \(k\)-server problem | 2025-01-14 | Paper |
| Beyond the quadratic time barrier for network unreliability | 2024-11-28 | Paper |
| Poly-logarithmic competitiveness for the \(k\)-taxi problem | 2024-11-28 | Paper |
| A general framework for learning-augmented online allocation | 2024-11-14 | Paper |
| Online paging with heterogeneous cache slots | 2024-10-08 | Paper |
Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows
SIAM Journal on Computing | 2024-08-27 | Paper |
| Online graph algorithms with predictions | 2024-07-19 | Paper |
| Augmenting edge connectivity via isolating cuts | 2024-07-19 | Paper |
| Near-linear time approximations for cut problems via fair cuts | 2024-05-14 | Paper |
| Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788408 (Why is no real title available?) | 2024-01-15 | Paper |
Edge connectivity augmentation in near-linear time
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Vertex connectivity in poly-logarithmic max-flows
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximate Gomory–Hu tree is faster than <i>n</i> – 1 max-flows
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Online Algorithms for Weighted Paging with Predictions
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Minimum Cut and Minimum <i>k</i> -Cut in Hypergraphs via Branching Contractions
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Robust Algorithms for TSP and Steiner Tree
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Universal Algorithms for Clustering Problems
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Caching with time windows and delays
SIAM Journal on Computing | 2022-07-22 | Paper |
Retracting Graphs to Cycles
(available as arXiv preprint) | 2022-07-21 | Paper |
Online service with delay
ACM Transactions on Algorithms | 2022-02-16 | Paper |
| Symmetric interdiction for matching problems | 2021-07-28 | Paper |
Caching with time windows
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Timing matters: online dynamics in broadcast games
(available as arXiv preprint) | 2020-06-18 | Paper |
| Profit sharing and efficiency in utility games | 2020-05-27 | Paper |
Dynamic set cover: improved algorithms and lower bounds
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Minimum cut and minimum k-cut in hypergraphs via branching contractions
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Elastic Caching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Multi-unit supply-monotone auctions with Bayesian valuations
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A general framework for graph sparsification
SIAM Journal on Computing | 2019-09-02 | Paper |
Online load balancing on related machines
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Online Mixed Packing and Covering
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| A near-linear time algorithm for constructing a cactus representation of minimum cuts | 2019-05-06 | Paper |
Tight bounds for online vector scheduling
SIAM Journal on Computing | 2019-02-08 | Paper |
Faster algorithms for the geometric transportation problem
(available as arXiv preprint) | 2018-08-13 | Paper |
Online Buy-at-Bulk Network Design
SIAM Journal on Computing | 2018-08-03 | Paper |
Random contractions and sampling for hypergraph and hedge connectivity
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Randomized algorithms for online vector load balancing | 2018-03-15 | Paper |
| Survivable network design problems in wireless networks | 2017-09-29 | Paper |
Online and dynamic algorithms for set cover
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Online service with delay
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
SIAM Journal on Computing | 2017-05-30 | Paper |
| scientific article; zbMATH DE number 6696496 (Why is no real title available?) | 2017-03-22 | Paper |
On the price of stability of undirected multicast games
Web and Internet Economics | 2017-02-10 | Paper |
| Efficient algorithms for computing all low s-t edge connectivities and related problems | 2014-12-18 | Paper |
Online node-weighted Steiner tree and related problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Near-optimal online algorithms for prize-collecting Steiner problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Precedence-constrained scheduling of malleable jobs with preemption
Automata, Languages, and Programming | 2014-07-01 | Paper |
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| The semi-stochastic ski-rental problem | 2012-08-31 | Paper |
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science | 2011-06-07 | Paper |
| scientific article; zbMATH DE number 5764893 (Why is no real title available?) | 2010-08-06 | Paper |
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Automata, Languages and Programming | 2009-07-14 | Paper |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
