Tianyi Zhang
Institute for Interdisciplinary Information Sciences
I am a fifth-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 graph algorithms.
Papers
Deterministic Maximum Flows in Simple Graphs
Tianyi Zhang
International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Incremental Single Source Shortest Paths in Sparse Digraphs
Shiri Chechik, Tianyi Zhang
ACM SIAM Symposium on Discrete Algorithms (SODA 2021)
A Scaling Algorithm for Weighted f-Factors in General Graphs
Ran Duan, Haoqing He, Tianyi Zhang
International Colloquium on Automata, Languages, and Programming (ICALP 2020)
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 Algorithms for Maintaining DFS Tree in Undirected Graphs
Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang
In the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
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
Incremental Single Source Shortest Paths in Sparse Digraphs
SODA, January 2021, Online
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
