Approximating the Percolation Centrality through Sampling and Pseudo-dimension. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (CoRR, 2019)

Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (CoRR, 2019)

Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (KDD, 2020)

Estimating the Clustering Coefficient Using Sample Complexity Analysis. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (LATIN, 2022)

Percolation centrality via Rademacher Complexity. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (Discret. Appl. Math., 2022)

A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. - Alane M. de Lima; Murilo V. G. da Silva; André Luís Vignatti (J. Graph Algorithms Appl., 2023)