On the Inequalities of Projected Volumes and the Constructible Region. - Zihan Tan; Liwei Zeng; Jian Li (CoRR, 2014)

On the Meeting Time for Two Random Walks on a Regular Graph. - Yizhen Zhang; Zihan Tan; Bhaskar Krishnamachari (CoRR, 2014)

Upper bound on function computation in directed acyclic networks. - Cupjin Huang; Zihan Tan; Shenghao Yang 001 (ITW, 2015)

Robust Influence Maximization. - Wei Chen 013; Tian Lin; Zihan Tan; Mingfei Zhao; Xuren Zhou (KDD, 2016)

On the computational complexity of bridgecard. - Zihan Tan (J. Comb. Optim., 2016)

Comments on Cut-Set Bounds on Network Function Computation. - Cupjin Huang; Zihan Tan; Shenghao Yang 001; Xuan Guang (IEEE Trans. Inf. Theory, 2018)

Towards Automatic Engagement Recognition of Autistic Children in a Machine Learning Approach. - Zihan Tan; Anjia Zhou; Xiaojun Hei; Yayu Gao; Chengwei Zhang 002 (TALE, 2019)

On the Inequalities of Projected Volumes and the Constructible Region. - Zihan Tan; Liwei Zeng (SIAM J. Discret. Math., 2019)

Towards Better Approximation of Graph Crossing Number. - Julia Chuzhoy; Sepideh Mahabadi; Zihan Tan (FOCS, 2020)

On Packing Low-Diameter Spanning Trees. - Julia Chuzhoy; Merav Parter; Zihan Tan (ICALP, 2020)

Erratum for "On the Inequalities of Projected Volumes and the Constructible Region". - Zihan Tan; Liwei Zeng (SIAM J. Discret. Math., 2020)

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. - Gramoz Goranci; Harald Räcke; Thatchaphol Saranurak; Zihan Tan (SODA, 2021)

Towards tight(er) bounds for the Excluded Grid Theorem. - Julia Chuzhoy; Zihan Tan (J. Comb. Theory B, 2021)

Almost-linear ε-emulators for planar graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (STOC, 2022)

A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. - Julia Chuzhoy; Zihan Tan (STOC, 2022)

Near-Linear ε-Emulators for Planar Graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (CoRR, 2022)

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (CoRR, 2022)

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. - Yu Chen 039; Sanjeev Khanna; Zihan Tan (ICALP, 2023)

A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (ITCS, 2023)

Query Complexity of the Metric Steiner Tree Problem. - Yu Chen 039; Sanjeev Khanna; Zihan Tan (SODA, 2023)

Almost-Optimal Sublinear Additive Spanners. - Zihan Tan; Tianyi Zhang 008 (STOC, 2023)

Worst-Case Welfare of Item Pricing in the Tollbooth Problem. - Zihan Tan; Yifeng Teng; Mingfei Zhao (WWW, 2023)

Parallel Greedy Spanners. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (CoRR, 2023)

On (1+ε)-Approximate Flow Sparsifiers. - Yu Chen 039; Zihan Tan (CoRR, 2023)

An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal. - Yu Chen 039; Zihan Tan (CoRR, 2023)

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families. - Yu Chen 039; Zihan Tan (CoRR, 2023)

New Structures and Algorithms for Length-Constrained Expander Decompositions. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (FOCS, 2024)

Lower Bounds on 0-Extension with Steiner Nodes. - Yu Chen 039; Zihan Tan (ICALP, 2024)

FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference. - Zihan Tan; Guancheng Wan; Wenke Huang; Mang Ye (NeurIPS, 2024)

An Ω (√log|T|) Lower Bound for Steiner Point Removal. - Yu Chen 039; Zihan Tan (SODA, 2024)

On (1 + ɛ)-Approximate Flow Sparsifiers. - Yu Chen 039; Zihan Tan (SODA, 2024)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances. - Yu Chen 039; Zihan Tan (CoRR, 2024)

Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. - Ioannis Caragiannis; Aris Filos-Ratsikas; Søren Kristoffer Stiil Frederiksen; Kristoffer Arnsfelt Hansen; Zihan Tan (Math. Program., 2024)

FedSPA: Generalizable Federated Graph Learning under Homophily Heterogeneity. - Zihan Tan; Guancheng Wan; Wenke Huang; He Li; Guibin Zhang; Carl Yang 001; Mang Ye (CVPR, 2025)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs. - Yu Chen 039; Zihan Tan (ICALP, 2025)

Metric Distortion for Tournament Voting and Beyond. - Moses Charikar; Prasanna Ramakrishnan; Zihan Tan; Kangning Wang 001 (EC, 2025)

Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances. - Yu Chen 039; Zihan Tan (SODA, 2025)

Multiplicative Spanners in Minor-Free Graphs. - Greg Bodwin; Gary Hoppenworth; Zihan Tan (CoRR, 2025)

S2FGL: Spatial Spectral Federated Graph Learning. - Zihan Tan; Suyuan Huang; Guancheng Wan; Wenke Huang; He Li; Mang Ye (CoRR, 2025)

Paths and Intersections: Exact Emulators for Planar Graphs. - George Z. Li; Zihan Tan; Tianyi Zhang (CoRR, 2025)

Lower Bounds on Tree Covers. - Yu Chen; Zihan Tan; Hangyu Xu (CoRR, 2025)