1. K-path centrality
2. Eugenio Angriman , Ruben Becker , Gianlorenzo d' Angelo , Hugo Gilbert , Alexander van der Grinten, and Henning Meyerhenke. 2021 . Group-Harmonic and Group-Closeness Maximization-Approximation and Engineering. In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 154--168 . Eugenio Angriman, Ruben Becker, Gianlorenzo d'Angelo, Hugo Gilbert, Alexander van der Grinten, and Henning Meyerhenke. 2021. Group-Harmonic and Group-Closeness Maximization-Approximation and Engineering. In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 154--168.
3. Eugenio Angriman , Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, and Henning Meyerhenke. 2020. Group centrality maximization for large-scale graphs . In 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 56--69 . Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, and Henning Meyerhenke. 2020. Group centrality maximization for large-scale graphs. In 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 56--69.
4. Martin Anthony Peter L Bartlett Peter L Bartlett etal 1999. Neural network learning: Theoretical foundations. Vol. 9. cambridge university press Cambridge. Martin Anthony Peter L Bartlett Peter L Bartlett et al. 1999. Neural network learning: Theoretical foundations. Vol. 9. cambridge university press Cambridge.
5. Rademacher and Gaussian complexities: Risk bounds and structural results;Bartlett Peter L.;Journal of Machine Learning Research,2002