Robust influence maximization W Chen, T Lin, Z Tan, M Zhao, X Zhou Proceedings of the 22nd ACM SIGKDD international conference on Knowledge …, 2016 | 234 | 2016 |
Towards tight (er) bounds for the excluded grid theorem J Chuzhoy, Z Tan Journal of Combinatorial Theory, Series B 146, 219-265, 2021 | 80 | 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 | 75 | 2021 |
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 | 32* | 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 | 30* | 2018 |
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 | 14* | 2022 |
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 | 11 | 2020 |
On packing low-diameter spanning trees J Chuzhoy, M Parter, Z Tan arXiv preprint arXiv:2006.07486, 2020 | 11 | 2020 |
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 | 8 | 2022 |
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 | 7 | 2022 |
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 |
On (1+ ɛ)-Approximate Flow Sparsifiers Y Chen, Z Tan Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4* | 2024 |
Parallel greedy spanners B Haeupler, DE Hershkowitz, Z Tan arXiv preprint arXiv:2304.08892, 2023 | 3 | 2023 |
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 |
New Structures and Algorithms for Length-Constrained Expander Decompositions B Haeupler, DE Hershkowitz, Z Tan arXiv preprint arXiv:2404.13446, 2024 | 1 | 2024 |
Lower Bounds on -Extension with Steiner Nodes Y Chen, Z Tan arXiv preprint arXiv:2401.09585, 2024 | 1 | 2024 |
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families Y Chen, Z Tan arXiv preprint arXiv:2310.11367, 2023 | 1 | 2023 |
Almost-Optimal Sublinear Additive Spanners Z Tan, T Zhang Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 281-294, 2023 | 1 | 2023 |
On the meeting time for two random walks on a regular graph Y Zhang, Z Tan, B Krishnamachari arXiv preprint arXiv:1408.2005, 2014 | 1 | 2014 |
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs Y Chen, Z Tan arXiv preprint arXiv:2407.10852, 2024 | | 2024 |