Obserwuj
Zihan Tan
Zihan Tan
Zweryfikowany adres z uchicago.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Robust influence maximization
W Chen, T Lin, Z Tan, M Zhao, X Zhou
Proceedings of the 22nd ACM SIGKDD international conference on Knowledge …, 2016
1902016
Towards tight (er) bounds for the excluded grid theorem
J Chuzhoy, Z Tan
Journal of Combinatorial Theory, Series B 146, 219-265, 2021
69*2021
The expander hierarchy and its applications to dynamic graph algorithms
G Goranci, H Räcke, T Saranurak, Z Tan
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
422021
Comments on cut-set bounds on network function computation
C Huang, Z Tan, S Yang, X Guang
IEEE Transactions on Information Theory 64 (9), 6454-6459, 2018
23*2018
Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship
I Caragiannis, A Filos-Ratsikas, SKS Frederiksen, KA Hansen, Z Tan
Mathematical Programming, 1-30, 2022
192022
Towards better approximation of graph crossing number
J Chuzhoy, S Mahabadi, Z Tan
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2020
92020
On packing low-diameter spanning trees
J Chuzhoy, M Parter, Z Tan
arXiv preprint arXiv:2006.07486, 2020
82020
On the inequalities of projected volumes and the constructible region
Z Tan, L Zeng
SIAM Journal on Discrete Mathematics 33 (2), 694-711, 2019
6*2019
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs
J Chuzhoy, Z Tan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
52022
Sublinear algorithms and lower bounds for estimating mst and tsp cost in general metrics
Y Chen, S Khanna, Z Tan
arXiv preprint arXiv:2203.14798, 2022
32022
Near-Linear -Emulators for Planar Graphs
HC Chang, R Krauthgamer, Z Tan
arXiv preprint arXiv:2206.10681, 2022
1*2022
On the meeting time for two random walks on a regular graph
Y Zhang, Z Tan, B Krishnamachari
arXiv preprint arXiv:1408.2005, 2014
12014
A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems
J Chuzhoy, M Dalirrooyfard, V Grinberg, Z Tan
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
2023
Query Complexity of the Metric Steiner Tree Problem
Y Chen, S Khanna, Z Tan
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest -Subgraph and Other Problems
J Chuzhoy, M Dalirrooyfard, V Grinberg, Z Tan
arXiv preprint arXiv:2211.05906, 2022
2022
From Graph Theory to Graph Algorithms, and Back
Z Tan
The University of Chicago, 2022
2022
Worst-Case Welfare of Item Pricing in the Tollbooth Problem
Z Tan, Y Teng, M Zhao
arXiv preprint arXiv:2107.05690, 2021
2021
Erratum for “On the Inequalities of Projected Volumes and the Constructible Region''
Z Tan, L Zeng
SIAM Journal on Discrete Mathematics 34 (1), 1000-1000, 2020
2020
On the computational complexity of bridgecard
Z Tan
Journal of Combinatorial Optimization 31, 196-217, 2016
2016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–19