| 2026 | KDD | FedPRE: Robust Federated Graph Learning against Topological Corruption. | Zihan Tan, Guancheng Wan, Wenke Huang, Bin Yang, Mang Ye |
| 2026 | STOC | Cutting Planarians: Planar Emulators for String Graphs. | Hsien-Chih Chang, Jonathan Conroy, Zihan Tan, Da Wei Zheng |
| 2026 | STOC | Lower Bounds on Flow Sparsifiers with Steiner Nodes. | Yu Chen, Zihan Tan, Mingyang Yang |
| 2025 | CVPR | FedSPA: Generalizable Federated Graph Learning under Homophily Heterogeneity. | Zihan Tan, Guancheng Wan, Wenke Huang, He Li, Guibin Zhang, Carl Yang, Mang Ye |
| 2025 | FOCS | Paths and Intersections: Exact Emulators for Planar Graphs. | George Z. Li, Zihan Tan, Tianyi Zhang |
| 2025 | ICALP | Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs. | Yu Chen, Zihan Tan |
| 2025 | ICML | S2FGL: Spatial Spectral Federated Graph Learning. | Zihan Tan, Suyuan Huang, Guancheng Wan, Wenke Huang, He Li, Mang Ye |
| 2025 | SODA | Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances. | Yu Chen, Zihan Tan |
| 2024 | FOCS | New Structures and Algorithms for Length-Constrained Expander Decompositions. | Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan |
| 2024 | ICALP | Lower Bounds on 0-Extension with Steiner Nodes. | Yu Chen, Zihan Tan |
| 2024 | SODA | An | Yu Chen, Zihan Tan |
| 2024 | SODA | On (1 + ɛ)-Approximate Flow Sparsifiers. | Yu Chen, Zihan Tan |
| 2023 | ICALP | Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. | Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | WWW | Worst-Case Welfare of Item Pricing in the Tollbooth Problem. | Zihan Tan, Yifeng Teng, Mingfei Zhao |
| 2023 | SODA | Query Complexity of the Metric Steiner Tree Problem. | Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | STOC | Almost-Optimal Sublinear Additive Spanners. | Zihan Tan, Tianyi Zhang |
| 2022 | STOC | Almost-linear | Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan |
| 2022 | STOC | A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. | Julia Chuzhoy, Zihan Tan |
| 2021 | SODA | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. | Gramoz Goranci, Harald Rcke, Thatchaphol Saranurak, Zihan Tan |
| 2020 | FOCS | Towards Better Approximation of Graph Crossing Number. | Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan |
| 2020 | ICALP | On Packing Low-Diameter Spanning Trees. | Julia Chuzhoy, Merav Parter, Zihan Tan |
| 2019 | SODA | Towards Tight(er) Bounds for the Excluded Grid Theorem. | Julia Chuzhoy, Zihan Tan |
| 2016 | KDD | Robust Influence Maximization. | Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou |
| 2015 | ITW | Upper bound on function computation in directed acyclic networks. | Cupjin Huang, Zihan Tan, Shenghao Yang |