1. Abhijin Adiga and Anil Kumar S Vullikanti . 2013 . How robust is the core of a network? . In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13 . Springer, 541--556. Abhijin Adiga and Anil Kumar S Vullikanti. 2013. How robust is the core of a network?. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2013, Prague, Czech Republic, September 23--27, 2013, Proceedings, Part I 13. Springer, 541--556.
2. Neighborhood-Based Hypergraph Core Decomposition
3. Connection and separation in hypergraphs
4. Vladimir Batagelj and Matjaz Zaversnik . 2003. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003).
5. Fast algorithms for determining (generalized) core groups in social networks