Zihan Tan

According to our database, Zihan Tan authored at least 41 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Lower Bounds on Tree Covers.

Yu Chen, Zihan Tan, Hangyu Xu

CoRR, August, 2025

Paths and Intersections: Exact Emulators for Planar Graphs.

George Z. Li, Zihan Tan, Tianyi Zhang

CoRR, July, 2025

S2FGL: Spatial Spectral Federated Graph Learning.

Zihan Tan, Suyuan Huang, Guancheng Wan, Wenke Huang, He Li, Mang Ye

CoRR, July, 2025

Multiplicative Spanners in Minor-Free Graphs.

Greg Bodwin, Gary Hoppenworth, Zihan Tan

CoRR, April, 2025

Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances.

Yu Chen, Zihan Tan

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Metric Distortion for Tournament Voting and Beyond.

Moses Charikar, Prasanna Ramakrishnan, Zihan Tan, Kangning Wang

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-Bipartite Graphs.

Yu Chen, Zihan Tan

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

FedSPA: Generalizable Federated Graph Learning under Homophily Heterogeneity.

Zihan Tan, Guancheng Wan, Wenke Huang, He Li, Guibin Zhang, Carl Yang, Mang Ye

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2025

2024

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances.

Yu Chen, Zihan Tan

CoRR, 2024

On (1 + ɛ)-Approximate Flow Sparsifiers.

Yu Chen, Zihan Tan

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An <i>Ω~(√log|T|)</i> Lower Bound for Steiner Point Removal.

Yu Chen, Zihan Tan

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference.

Zihan Tan, Guancheng Wan, Wenke Huang, Mang Ye

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Lower Bounds on 0-Extension with Steiner Nodes.

Yu Chen, Zihan Tan

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

New Structures and Algorithms for Length-Constrained Expander Decompositions.

Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families.

Yu Chen, Zihan Tan

CoRR, 2023

An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal.

Yu Chen, Zihan Tan

CoRR, 2023

On (1+ε)-Approximate Flow Sparsifiers.

Yu Chen, Zihan Tan

CoRR, 2023

Parallel Greedy Spanners.

Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan

CoRR, 2023

Worst-Case Welfare of Item Pricing in the Tollbooth Problem.

Zihan Tan, Yifeng Teng, Mingfei Zhao

Proceedings of the ACM Web Conference 2023, 2023

Almost-Optimal Sublinear Additive Spanners.

Zihan Tan, Tianyi Zhang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Query Complexity of the Metric Steiner Tree Problem.

Yu Chen, Sanjeev Khanna, Zihan Tan

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.

Yu Chen, Sanjeev Khanna, Zihan Tan

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

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

Near-Linear ε-Emulators for Planar Graphs.

Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan

CoRR, 2022

A subpolynomial approximation algorithm for graph crossing number in low-degree graphs.

Julia Chuzhoy, Zihan Tan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Almost-linear <i>ε</i>-emulators for planar graphs.

Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.

Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Erratum for "On the Inequalities of Projected Volumes and the Constructible Region".

Zihan Tan, Liwei Zeng

SIAM J. Discret. Math., 2020

On Packing Low-Diameter Spanning Trees.

Julia Chuzhoy, Merav Parter, Zihan Tan

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Towards Better Approximation of Graph Crossing Number.

Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

On the Inequalities of Projected Volumes and the Constructible Region.

Zihan Tan, Liwei Zeng

SIAM J. Discret. Math., 2019

Towards Automatic Engagement Recognition of Autistic Children in a Machine Learning Approach.

Zihan Tan, Anjia Zhou, Xiaojun Hei, Yayu Gao, Chengwei Zhang

Proceedings of the IEEE International Conference on Engineering, Technology and Education, 2019

Towards Tight(er) Bounds for the Excluded Grid Theorem.

Julia Chuzhoy, Zihan Tan

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Comments on Cut-Set Bounds on Network Function Computation.

Cupjin Huang, Zihan Tan, Shenghao Yang, Xuan Guang

IEEE Trans. Inf. Theory, 2018

2016

On the computational complexity of bridgecard.

Zihan Tan

J. Comb. Optim., 2016

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

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Robust Influence Maximization.

Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2015

Upper bound on function computation in directed acyclic networks.

Cupjin Huang, Zihan Tan, Shenghao Yang

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014

On the Meeting Time for Two Random Walks on a Regular Graph.

Yizhen Zhang, Zihan Tan, Bhaskar Krishnamachari

CoRR, 2014

On the Inequalities of Projected Volumes and the Constructible Region.

Zihan Tan, Liwei Zeng, Jian Li

CoRR, 2014