Zihan Tan
University of Chicago
H-index: 7
North America-United States
Top articles of Zihan Tan
New Structures and Algorithms for Length-Constrained Expander Decompositions
arXiv preprint arXiv:2404.13446
2024/4/20
Lower Bounds on -Extension with Steiner Nodes
arXiv preprint arXiv:2401.09585
2024/1/17
Yu Chen
H-Index: 3
Zihan Tan
H-Index: 5
Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship
Mathematical Programming
2024/1
Towards the characterization of terminal cut functions: a condition for laminar families
arXiv preprint arXiv:2310.11367
2023/10/17
Yu Chen
H-Index: 3
Zihan Tan
H-Index: 5
Worst-Case Welfare of Item Pricing in the Tollbooth Problem
2023/4/30
Zihan Tan
H-Index: 5
Mingfei Zhao
H-Index: 4
Parallel greedy spanners
arXiv preprint arXiv:2304.08892
2023/4/18
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems
Leibniz international proceedings in informatics
2023/1
Julia Chuzhoy
H-Index: 22
Zihan Tan
H-Index: 5
Query Complexity of the Metric Steiner Tree Problem
2023
Near-linear ϵ-emulators for planar graphs
2022/6/21
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs
2022/6/9
Julia Chuzhoy
H-Index: 22
Zihan Tan
H-Index: 5
Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics
arXiv preprint arXiv:2203.14798
2022/3/28
From Graph Theory to Graph Algorithms, and Back
2022
Zihan Tan
H-Index: 5
The expander hierarchy and its applications to dynamic graph algorithms
2021
Towards tight (er) bounds for the excluded grid theorem
Journal of Combinatorial Theory, Series B
2021/1/1
Julia Chuzhoy
H-Index: 22
Zihan Tan
H-Index: 5
Towards better approximation of graph crossing number
2020/11/16
On packing low-diameter spanning trees
arXiv preprint arXiv:2006.07486
2020/6/12
Co-Authors
