Search for persons
X
?
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) ,
1
A Deterministic Almost-Linear Time Algorithm for Minimum-Co..:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
3
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
4
Deterministic Decremental SSSP and Approximate Min-Cost Flo..:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
5
New techniques and fine-grained hardness for dynamic near-a..:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
6
New Techniques and Fine-Grained Hardness for Dynamic Near-A..:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
8
Decremental sssp in weighted digraphs : faster and again..:
, In:
?
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ,
9
Near-Optimal Decremental SSSP in Dense Weighted Digraphs:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
10
Fully-dynamic all-pairs shortest paths : improved worst-..:
, In:
?
Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms ,
11
Deterministic algorithms for decremental approximate shorte..:
, In:
?
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ,
12
Deterministic Decremental Reachability, SCC, and Shortest P..:
, In:
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
13
Almost-Linear Time Algorithms for Incremental Graphs: Cycle..:
, In:
?
Proceedings of the 56th Annual ACM Symposium on Theory of Computing ,
14
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Spa..:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
15