Ta-Wei Tu 塗大為

I am a second-year computer science Ph.D. student in the theory group at Stanford University, advised by Professor Aaron Sidford.

Before joining Stanford, I was an intern at the Max Planck Institute for Informatics (MPI-INF), where I was mentored by Professor Danupon Nanongkai. I got my B.Sc. degree in Computer Science from National Taiwan University in 2022.

I am interested in theoretical computer science in general, with a focus on the design of algorithms and data structures for graph problems and combinatorial optimization.

My CV is available here.

Email: taweitu [at] stanford [dot] edu
Office: CoDa W224

profile photo
Papers and Publications

In all my publications, as standard in theoretical computer science, author names are ordered alphabetically.

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
with Aaron Bernstein, Joakim Blikstad, Jason Li, and Thatchaphol Saranurak
To appear in Proceedings of the 66th IEEE Symposium on Foundations of Computer Science (FOCS 2025)
Efficient Matroid Intersection via a Batch-Update Auction Algorithm
with Joakim Blikstad
In 2025 Symposium on Simplicity in Algorithms (SOSA 2025)
[arXiv] [proceedings]
Matching Composition and Efficient Weight Reduction in Dynamic Matching
with Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, and Aaron Sidford
In Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
[arXiv] [proceedings]
Entropy Regularization and Faster Decremental Matching in General Graphs
with Jiale Chen and Aaron Sidford
In Proceedings of the 2025 ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)
[arXiv] [proceedings]
Maximum Flow by Augmenting Paths in \(n^{2+o(1)}\) Time
with Aaron Bernstein, Joakim Blikstad, and Thatchaphol Saranurak
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]

Source code of this website is credited to Dr. Jon Barron.