1. A. Aghdaei , Z. Zhao , and Z. Feng . Hypersf: Spectral hypergraph coarsening via flow-based local clustering. CoRR, abs/2108.07901 , 2021 . A. Aghdaei, Z. Zhao, and Z. Feng. Hypersf: Spectral hypergraph coarsening via flow-based local clustering. CoRR, abs/2108.07901, 2021.
2. V. L. Alev , N. Anari , L. C. Lau , and S. Oveis Gharan . Graph clustering using effective resistance . In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2018 . V. L. Alev, N. Anari, L. C. Lau, and S. Oveis Gharan. Graph clustering using effective resistance. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
3. Ü. V. Çatalyürek and C. Aykanat . Patoh (partitioning tool for hypergraphs) . In Encyclopedia of Parallel Computing , pages 1479 -- 1487 . Springer , 2011 . Ü. V. Çatalyürek and C. Aykanat. Patoh (partitioning tool for hypergraphs). In Encyclopedia of Parallel Computing, pages 1479--1487. Springer, 2011.
4. Generalizing the hypergraph Laplacian via a diffusion process with mediators
5. T.-H. H. Chan , A. Louis , Z. G. Tang , and C. Zhang . Spectral properties of hypergraph laplacian and approximation algorithms. Journal of the ACM (JACM), 65(3):15 , 2018 . T.-H. H. Chan, A. Louis, Z. G. Tang, and C. Zhang. Spectral properties of hypergraph laplacian and approximation algorithms. Journal of the ACM (JACM), 65(3):15, 2018.