Ta-Wei Tu

According to our database, Ta-Wei Tu authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Matching Composition and Efficient Weight Reduction in Dynamic Matching.

Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Entropy Regularization and Faster Decremental Matching in General Graphs.

Jiale Chen, Aaron Sidford, Ta-Wei Tu

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Efficient Matroid Intersection via a Batch-Update Auction Algorithm.

Joakim Blikstad, Ta-Wei Tu

CoRR, 2024

Maximum Flow by Augmenting Paths in n^2+o(1) Time.

Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Fast Algorithms via Dynamic-Oracle Matroids.

Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Subquadratic Weighted Matroid Intersection Under Rank Oracles.

Ta-Wei Tu

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022