| Partitioning well-clustered graphs: Spectral clustering works! R Peng, H Sun, L Zanetti SIAM Journal on Computing 46 (2), 710-743, 2017 | 115 | 2017 |
| Hermitian matrices for clustering directed graphs: insights and applications M Cucuringu, H Li, H Sun, L Zanetti International Conference on Artificial Intelligence and Statistics, 983-992, 2020 | 50 | 2020 |
| Distributed graph clustering and sparsification H Sun, L Zanetti ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-23, 2019 | 37* | 2019 |
| A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems D Tamascelli, L Zanetti Journal of Physics A: Mathematical and Theoretical 47 (32), 325302, 2014 | 35 | 2014 |
| Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities T Sauerwald, L Zanetti arXiv preprint arXiv:1903.01342, 2019 | 21 | 2019 |
| Random walks on randomly evolving graphs L Cai, T Sauerwald, L Zanetti Structural Information and Communication Complexity: 27th International …, 2020 | 9 | 2020 |
| Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem H Li, H Sun, L Zanetti The 27th Annual European Symposium on Algorithms (ESA 2019) 144, 2019 | 8 | 2019 |
| Geometric bounds on the fastest mixing Markov chain S Olesker-Taylor, L Zanetti Probability Theory and Related Fields, 1-46, 2024 | 7 | 2024 |
| Algorithms for partitioning well-clustered graphs L Zanetti University of Bristol, 2018 | 3 | 2018 |
| An iterative spectral algorithm for digraph clustering J Martin, T Rogers, L Zanetti Journal of Complex Networks 12 (2), cnae016, 2024 | | 2024 |
He SunReader in Algorithms & Complexity, University of EdinburghVerified email at ed.ac.uk
