Obserwuj
Zihan Tan
Zihan Tan
DIMACS, Rutgers University
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
2302016
Towards tight (er) bounds for the excluded grid theorem
J Chuzhoy, Z Tan
Journal of Combinatorial Theory, Series B 146, 219-265, 2021
742021
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
632021
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 203 (1), 901-930, 2024
29*2024
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
29*2018
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
112020
Near-linear ϵ-emulators for planar graphs
HC Chang, R Krauthgamer, Z Tan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022
10*2022
On packing low-diameter spanning trees
J Chuzhoy, M Parter, Z Tan
arXiv preprint arXiv:2006.07486, 2020
92020
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
82022
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
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
52022
On (1+ ɛ)-Approximate Flow Sparsifiers
Y Chen, Z Tan
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2*2024
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
Leibniz international proceedings in informatics 251, 2023
2*2023
Towards the characterization of terminal cut functions: a condition for laminar families
Y Chen, Z Tan
arXiv preprint arXiv:2310.11367, 2023
12023
Almost-Optimal Sublinear Additive Spanners
Z Tan, T Zhang
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 281-294, 2023
12023
Parallel greedy spanners
B Haeupler, DE Hershkowitz, Z Tan
arXiv preprint arXiv:2304.08892, 2023
12023
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
Lower Bounds on -Extension with Steiner Nodes
Y Chen, Z Tan
arXiv preprint arXiv:2401.09585, 2024
2024
An Lower Bound for Steiner Point Removal
Y Chen, Z Tan
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
Worst-Case Welfare of Item Pricing in the Tollbooth Problem
Z Tan, Y Teng, M Zhao
Proceedings of the ACM Web Conference 2023, 3508-3518, 2023
2023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20