Tianyi Zhang

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 15

Top Topics

Improved Algorithm

Provide An Upper Bound

Top Venues

Publications

Shiri Chechik, Tianyi Zhang
Faster Algorithms for Dual-Failure Replacement Paths. CoRR (2024)
Shiri Chechik, Doron Mukhtar, Tianyi Zhang
Streaming Edge Coloring with Subquadratic Palette Size. ICALP (2024)
Shiri Chechik, Tianyi Zhang
Nearly Optimal Approximate Dual-Failure Replacement Paths. SODA (2024)
Shiri Chechik, Tianyi Zhang
Faster Algorithms for Dual-Failure Replacement Paths. ICALP (2024)
Shiri Chechik, Tianyi Zhang
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. ICALP (2024)
Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang
Faster Min-Plus Product for Monotone Instances. CoRR (2022)
Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang
Faster min-plus product for monotone instances. STOC (2022)
Ran Duan, Haoqing He, Tianyi Zhang
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. LATIN (2020)
Ran Duan, Haoqing He, Tianyi Zhang
A Scaling Algorithm for Weighted f-Factors in General Graphs. ICALP (2020)
Ran Duan, Haoqing He, Tianyi Zhang
A Scaling Algorithm for Weighted f-Factors in General Graphs. CoRR (2020)
Ran Duan, Haoqing He, Tianyi Zhang
Dynamic Edge Coloring with Improved Approximation. SODA (2019)
Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. SWAT (2018)
Ran Duan, Tianyi Zhang
Improved Distance Sensitivity Oracles via Tree Partitioning. WADS (2017)
Ran Duan, Haoqing He, Tianyi Zhang
Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. CoRR (2017)
Ran Duan, Tianyi Zhang
Improved distance sensitivity oracles via tree partitioning. CoRR (2016)