Scholar
Ta-Wei Tu
Google Scholar ID: Ob6i95kAAAAJ
Stanford University
Citations & Impact
Citations
40
H-index
4
i10-index
1
Publications
7
Co-authors
0
Contact
Publications
Resume (English only)
Academic Achievements
- 1. 'Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs', with Aaron Bernstein, Joakim Blikstad, Jason Li, and Thatchaphol Saranurak, to appear in FOCS 2025
- 2. 'Efficient Matroid Intersection via a Batch-Update Auction Algorithm', with Joakim Blikstad, SOSA 2025
- 3. 'Matching Composition and Efficient Weight Reduction in Dynamic Matching', with Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, and Aaron Sidford, SODA 2025
- 4. 'Entropy Regularization and Faster Decremental Matching in General Graphs', with Jiale Chen and Aaron Sidford, SODA 2025
- 5. 'Maximum Flow by Augmenting Paths in n^2 + o(1) Time', with Aaron Bernstein, Joakim Blikstad, and Thatchaphol Saranurak, FOCS 2024
- 6. 'Fast Algorithms via Dynamic-Oracle Matroids', with Joakim Blikstad, Sagnik Mukhopadhyay, and Danupon Nanongkai, STOC 2023
- 7. 'Subquadratic Weighted Matroid Intersection Under Rank Oracles', ISAAC 2022
Research Experience
- 1. Ph.D. student in the theory group at Stanford University
- 2. Intern at Max Planck Institute for Informatics (MPI-INF), mentored by Professor Danupon Nanongkai
Education
- 1. Ph.D. student in Computer Science at Stanford University, advised by Professor Aaron Sidford (Ongoing)
- 2. B.Sc. in Computer Science from National Taiwan University (2022)
Background
- Research Interests: Theoretical computer science, with a focus on the design of algorithms and data structures for graph problems and combinatorial optimization.
Miscellany
- Website source code credited to Dr. Jon Barron
Co-authors