| Publication | Date of Publication | Type |
|---|
Maximal \(k\)-edge-connected subgraphs in almost-linear time for small \(k\)
| 2025-01-06 | Paper |
Cactus representations in polylogarithmic max-flow via maximal isolating mincuts
| 2024-11-28 | Paper |
Cactus representation of minimum cuts: derandomize and speed up
| 2024-11-28 | Paper |
Fully-dynamic graph sparsifiers against an adaptive adversary
| 2024-06-24 | Paper |
Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver
| 2024-06-24 | Paper |
Dynamic algorithms for packing-covering LPs via multiplicative weight updates
| 2024-05-14 | Paper |
Fully dynamic exact edge connectivity in sublinear time
| 2024-05-14 | Paper |
Dynamic matching with better-than-2 approximation in polylogarithmic update time
| 2024-05-14 | Paper |
Maximal \(k\)-edge-connected subgraphs in weighted graphs via local random contraction
| 2024-05-14 | Paper |
Near-linear time approximations for cut problems via fair cuts
| 2024-05-14 | Paper |
A simple deterministic algorithm for edge connectivity
| 2024-05-14 | Paper |
Sublinear algorithms for \((1.5+\epsilon)\)-approximate matching
| 2024-05-08 | Paper |
Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast
| 2024-05-08 | Paper |
Tight conditional lower bounds for vertex connectivity problems
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7789148 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788470 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788485 (Why is no real title available?)
| 2024-01-15 | Paper |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Optimal vertex connectivity oracles
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 |
scientific article; zbMATH DE number 7758335 (Why is no real title available?)
| 2023-10-31 | Paper |
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
Journal of the ACM | 2022-12-08 | Paper |
Multi-Finger Binary Search Trees
| 2022-07-21 | Paper |
Coarse-Grained Complexity for Dynamic Algorithms
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Improved distributed expander decomposition and nearly optimal triangle enumeration
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Smooth heaps and a dual view of self-adjusting data structures
SIAM Journal on Computing | 2020-10-29 | Paper |
Distributed edge connectivity in sublinear time
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Breaking quadratic time for small vertex connectivity and an approximation scheme
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Smooth heaps and a dual view of self-adjusting data structures
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and \(O(n^{1/2-\epsilon})\)-time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Binary search trees and rectangulations
| 2016-03-26 | Paper |
Self-adjusting binary search trees: what makes them tick?
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Greedy is an almost optimal deque
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Pattern-avoiding access in binary search trees
| 2015-07-24 | Paper |
