清华大学交叉信息研究院

张天翼
Email:


I am a fourth-year PhD student in Computer Science at Tsinghua University, advised by Ran Duan. I did my undergraduate study at Tsinghua University.

I am interested in combinatorial graph algorithms.

Papers

Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees
Ran Duan, Haoqing He, Tianyi Zhang
Latin American Theoratical Informatics Symposium (LATIN 2020) ArXiv

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
Shiri Chechik, Tianyi Zhang
ACM SIAM Symposium on Discrete Algorithms (SODA 2020)

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
Shiri Chechik, Tianyi Zhang
IEEE Symposium on Foundations of Computer Science (FOCS 2019) ArXiv

Dynamic Edge Coloring with Improved Approximation
Ran Duan, Haoqing He, Tianyi Zhang
ACM SIAM Symposium on Discrete Algorithms (SODA 2019)

Improved Distance Sensitivity Oracles via Tree Partitioning
Ran Duan, Tianyi Zhang
Algorithms and Data Structures Symposium (WADS 2017) ArXiv

Purely Combinatorial Algorithms for Approximate Directed Minimum Degree Spanning Trees
Ran Duan, Tianyi Zhang
ArXiv

Talks

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
SODA, January 2020, Salt Lake City, USA

Fully Dynamic Maximal Independent Set in Expected Poly-Log Time 
FOCS, November 2019, Baltimore, USA

Dynamic Edge Coloring with Improved Approximation
SODA, January 2019, San Diego, USA

Improved Distance Sensitivity Oracles via Tree Partitioning
WADS, July 2017, St. John's, Canada