Effective measurement of network vulnerability under random and intentional attacks. - Regino Criado; Julio Flores; Benito Hernández-Bermejo; Javier Pello; Miguel Romance (J. Math. Model. Algorithms, 2005)

Analytical relationships between metric and centrality measures of a network and its dual. - Regino Criado; Julio Flores; Alejandro García del Amo; Miguel Romance (J. Comput. Appl. Math., 2011)

A mathematical model for networks with structures in the mesoscale. - Regino Criado; Julio Flores; Alejandro García del Amo; Jesús Gómez-Gardeñes; Miguel Romance (Int. J. Comput. Math., 2012)

Structural properties of the line-graphs associated to directed networks. - Regino Criado; Julio Flores; Alejandro García del Amo; Miguel Romance (Networks Heterog. Media, 2012)

Eigenvector centrality of nodes in multiplex networks. - Luis Sola; Miguel Romance; Regino Criado; Julio Flores; Alejandro García del Amo; Stefano Boccaletti (CoRR, 2013)

Centralities of a network and its line graph: an analytical comparison by means of their irregularity. - Regino Criado; Julio Flores; Alejandro García del Amo; Miguel Romance (Int. J. Comput. Math., 2014)

Investment planning in energy considering economic and environmental objectives. - Julio Flores; Jorge M. Montagna; Aldo R. Vecchietti (Comput. Chem. Eng., 2015)

On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales. - Julio Flores; Miguel Romance (J. Comput. Appl. Math., 2018)

On the α-nonbacktracking centrality for complex networks: Existence and limit cases. - Regino Criado; Julio Flores; Esther García; Alejandro García del Amo; Ángel Pérez; Miguel Romance (J. Comput. Appl. Math., 2019)

Time-dependent Personalized PageRank for temporal networks: discrete and continuous scales. - David Aleja; Julio Flores; Eva Primo; Miguel Romance (CoRR, 2024)

Fixed points of Personalized PageRank centrality: From irreducible to reducible networks. - David Aleja; Julio Flores; Eva Primo; Daniel Rodríguez; Miguel Romance (CoRR, 2025)