Pubblicazioni

How Universal Polynomial Bases Enhance Spectral Graph Neural Networks: Heterophily, Over-smoothing, and Over-squashing

2024 - Proceedings of Machine Learning Research

Huang, K.; Wang, Y. G.; Li, M.; Lio, P.

Knowledge graphs

2021 - ACM COMPUTING SURVEYS

Hogan, A.; Blomqvist, E.; Cochez, M.; D'Amato, C.; Melo, G. D.; Gutierrez, C.; Kirrane, S.; Gayo, J. E. L.; Navigli, R.; Neumaier, S.; Ngomo, A. -C. N.; Polleres, A.; Rashid, S. M.; Rula, A.; Schmelzeisen, L.; Sequeda, J.; Staab, S.; Zimmermann, A.

Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks

2021 - Proceedings of Machine Learning Research

Bodnar, C.; Frasca, F.; Wang, Y. G.; Otter, N.; Montufar, G.; Lio, P.; Bronstein, M. M.

Truly scalable K-Truss and max-truss algorithms for community detection in graphs

2020 - IEEE ACCESS

Conte, A.; De Sensi, D.; Grossi, R.; Marino, A.; Versari, L.

A Polynomial-Time Algorithm for detecting the possibility of Braess Paradox in Directed Graphs

2019 - ALGORITHMICA

Cenciarelli, Pietro; Gorla, Daniele; Salvo, Ivano

On Resilient Graph Spanners

2016 - ALGORITHMICA

Ausiello, Giorgio; Franciosa, Paolo Giulio; G. F., Italiano; Ribichini, Andrea

Strong Articulation Points and Strong Bridges in Large Scale Graphs

2016 - ALGORITHMICA

Firmani, Donatella; Georgiadis, Loukas; Italiano Giuseppe, F.; Laura, Luigi; Santaroni, Federico

Clique counting in MapReduce: Algorithms and experiments

2015 - ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS

Finocchi, Irene; Finocchi, Marco; Fusco, EMANUELE GUIDO