Papers and Publications
Following the convention in theoretical computer science, unless stated otherwise, author names are ordered alphabetically.
|
Efficient Matroid Intersection via a Batch-Update Auction Algorithm
with Joakim Blikstad
To appear in Proceedings of the 2025 Symposium on Simplicity in Algorithms (SOSA 2025)
[arXiv]
|
Matching Composition and Efficient Weight Reduction in Dynamic Matching
with Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, and Aaron Sidford
To appear in Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
[arXiv]
|
Entropy Regularization and Faster Decremental Matching in General Graphs
with Jiale Chen and Aaron Sidford
To appear in Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
[arXiv]
|
Maximum Flow by Augmenting Paths in \(n^{2+o(1)}\) Time
with Aaron Bernstein, Joakim Blikstad, and Thatchaphol Saranurak
To appear in Proceedings of the 65th IEEE Symposium on Foundations of Computer Science (FOCS 2024)
Invited to SICOMP Special Issue
[arXiv]
[proceedings]
[video]
|
Fast Algorithms via Dynamic-Oracle Matroids
with Joakim Blikstad, Sagnik Mukhopadhyay, and Danupon Nanongkai
In Proceedings of the 55th ACM Symposium on Theory of Computing (STOC 2023)
[arXiv]
[proceedings]
[video]
|
Subquadratic Weighted Matroid Intersection Under Rank Oracles
In Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
[arXiv]
[proceedings]
|
|