| Stochastic linear optimization with adversarial corruption Y Li, EY Lou, L Shan arXiv preprint arXiv:1909.02109, 2019 | 38 | 2019 |
| Robustness of first-and second-order consensus algorithms for a noisy scale-free small-world Koch network Y Yi, Z Zhang, L Shan, G Chen IEEE Transactions on Control Systems Technology 25 (1), 342-350, 2016 | 36 | 2016 |
| Current flow group closeness centrality for complex networks? H Li, R Peng, L Shan, Y Yi, Z Zhang The World Wide Web Conference, 961-971, 2019 | 33 | 2019 |
| Near-optimal algorithms for explainable k-medians and k-means K Makarychev, L Shan International Conference on Machine Learning, 7358-7367, 2021 | 28 | 2021 |
| Improved guarantees for k-means++ and k-means++ parallel K Makarychev, A Reddy, L Shan Advances in Neural Information Processing Systems 33, 16142-16152, 2020 | 25 | 2020 |
| Optimization of scoring rules Y Li, JD Hartline, L Shan, Y Wu Proceedings of the 23rd ACM Conference on Economics and Computation, 988-989, 2022 | 21* | 2022 |
| Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph L Shan, H Li, Z Zhang Theoretical Computer Science 677, 12-30, 2017 | 20 | 2017 |
| Improving information centrality of a node in complex networks by adding edges L Shan, Y Yi, Z Zhang arXiv preprint arXiv:1804.06540, 2018 | 15 | 2018 |
| Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket L Shan, H Li, Z Zhang Theoretical Computer Science 720, 47-54, 2018 | 11 | 2018 |
| Biharmonic Distance Related Centrality for Edges in Weighted Networks. Y Yi, L Shan, H Li, Z Zhang IJCAI, 3620-3626, 2018 | 9 | 2018 |
| Explainable k-means: don’t be greedy, plant bigger trees! K Makarychev, L Shan Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 8 | 2022 |
| Edge deletion algorithms for minimizing spread in sir epidemic models Y Yi, L Shan, PE Paré, KH Johansson SIAM Journal on Control and Optimization 60 (2), S246-S273, 2022 | 6 | 2022 |
| Optimal scoring rules for multi-dimensional effort JD Hartline, L Shan, Y Li, Y Wu The Thirty Sixth Annual Conference on Learning Theory, 2624-2650, 2023 | 5 | 2023 |
| Random Cuts are Optimal for Explainable k-Medians K Makarychev, L Shan arXiv preprint arXiv:2304.09113, 2023 | 2 | 2023 |
| Higher-Order Cheeger Inequality for Partitioning with Buffers K Makarychev, Y Makarychev, L Shan, A Vijayaraghavan arXiv preprint arXiv:2308.10160, 2023 | | 2023 |
| Approximation Algorithms for Norm Multiway Cut C Carlson, J Jafarov, K Makarychev, Y Makarychev, L Shan arXiv preprint arXiv:2308.08373, 2023 | | 2023 |
| Approximation Algorithms for Explainable Clustering L Shan Northwestern University, 2023 | | 2023 |
| Fair Curing and Network Design in SIS Epidemic Processes Y Yi, L Shan, PE Paré, KH Johansson arXiv preprint arXiv:2211.06028, 2022 | | 2022 |
| Algorithmic Learning Foundations for Common Law JD Hartline, DW Linna Jr, L Shan, A Tang Proceedings of the 2022 Symposium on Computer Science and Law, 109-117, 2022 | | 2022 |
Zhongzhi Zhang (章忠志)Professor, School of Computer Science, Fudan UniversityVerified email at fudan.edu.cn
