| Spectral properties of hypergraph laplacian and approximation algorithms THH Chan, A Louis, ZG Tang, C Zhang Journal of the ACM (JACM) 65 (3), 1-48, 2018 | 98 | 2018 |
| Graph edge partitioning via neighborhood heuristic C Zhang, F Wei, Q Liu, ZG Tang, Z Li Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge …, 2017 | 98 | 2017 |
| How to match when all vertices arrive online Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of computing …, 2018 | 93 | 2018 |
| Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Z Huang, ZG Tang, X Wu, Y Zhang ACM Transactions on Algorithms (TALG) 15 (3), 1-15, 2019 | 81 | 2019 |
| Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models T Ezra, M Feldman, N Gravin, ZG Tang Proceedings of the 21st ACM Conference on Economics and Computation, 769-787, 2020 | 75 | 2020 |
| Tight competitive ratios of classic matching algorithms in the fully online model Z Huang, B Peng, ZG Tang, R Tao, X Wu, Y Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 67 | 2019 |
| Re-revisiting learning on hypergraphs: confidence interval and subgradient method C Zhang, S Hu, ZG Tang, THH Chan International Conference on Machine Learning, 4026-4034, 2017 | 65 | 2017 |
| Correlation-robust analysis of single item auction X Bei, N Gravin, P Lu, ZG Tang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 42 | 2019 |
| Fully online matching ii: Beating ranking and water-filling Z Huang, ZG Tang, X Wu, Y Zhang 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 37 | 2020 |
| Generalizing complex hypotheses on product distributions: Auctions, prophet inequalities, and pandora’s problem C Guo, Z Huang, ZG Tang, X Zhang Conference on Learning Theory, 2248-2288, 2021 | 36 | 2021 |
| Fully online matching Z Huang, N Kang, ZG Tang, X Wu, Y Zhang, X Zhu Journal of the ACM (JACM) 67 (3), 1-25, 2020 | 36 | 2020 |
| Tight approximation ratio of anonymous pricing Y Jin, P Lu, Q Qi, ZG Tang, T Xiao Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 35 | 2019 |
| Tight revenue gaps among simple mechanisms Y Jin, P Lu, ZG Tang, T Xiao SIAM Journal on Computing 49 (5), 927-958, 2020 | 33 | 2020 |
| Online submodular maximization with free disposal: Randomization beats for partition matroids THH Chan, Z Huang, SHC Jiang, N Kang, ZG Tang Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 33 | 2017 |
| Random order vertex arrival contention resolution schemes for matching, with applications H Fu, ZG Tang, H Wu, J Wu, Q Zhang 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 32 | 2021 |
| Online facility location with predictions SHC Jiang, E Liu, Y Lyu, ZG Tang, Y Zhang arXiv preprint arXiv:2110.08840, 2021 | 27 | 2021 |
| Prophet matching with general arrivals T Ezra, M Feldman, N Gravin, ZG Tang Mathematics of Operations Research 47 (2), 878-898, 2022 | 26 | 2022 |
| Order selection prophet inequality: From threshold optimization to arrival time design B Peng, ZG Tang 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 25 | 2022 |
| Diffusion operator and spectral analysis for directed hypergraph Laplacian THH Chan, ZG Tang, X Wu, C Zhang Theoretical Computer Science 784, 46-64, 2019 | 22 | 2019 |
| The value of information concealment H Fu, C Liaw, P Lu, ZG Tang Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 18 | 2018 |
Zhiyi HuangThe University of Hong KongEmail verificata su cs.hku.hk
