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)

Efficiency, Vulnerability and Cost: an Overview with Applications to Subway Networks Worldwide. - Regino Criado; Benito Hernández-Bermejo; Miguel Romance (Int. J. Bifurc. Chaos, 2007)

Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model. - Regino Criado; Benito Hernández-Bermejo; J. Marco-Blanco; Miguel Romance (Int. J. Comput. Math., 2008)

Vulnerability and Fall of Efficiency in Complex Networks: a New Approach with Computational Advantages. - Stefano Boccaletti; Regino Criado; Javier Pello; Miguel Romance; María Vela-Pérez (Int. J. Bifurc. Chaos, 2009)

Editorial. - Stefano Boccaletti; Regino Criado; Miguel Romance (Int. J. Bifurc. Chaos, 2009)

A Node-Based Multiscale Vulnerability of Complex Networks. - Regino Criado; Javier Pello; Miguel Romance; María Vela-Pérez (Int. J. Bifurc. Chaos, 2009)

Improvements in performance and security for complex networks. - Regino Criado; Javier Pello; Miguel Romance; María Vela-Pérez (Int. J. Comput. Math., 2009)

Evolutionary Games defined at the Network Mesoscale: The Public Goods game - Jesús Gómez-Gardeñes; Miguel Romance; Regino Criado; Daniele Vilone; Ángel Sánchez (CoRR, 2010)

Hyperstructures, a New Approach to Complex Systems. - Regino Criado; Miguel Romance; María Vela-Pérez (Int. J. Bifurc. Chaos, 2010)

Controlling centrality in complex networks - Vincenzo Nicosia; Regino Criado; Miguel Romance; Giovanni Russo 001; Vito Latora (CoRR, 2011)

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)

Local estimates for eigenvector-like centralities of complex networks. - Miguel Romance (J. Comput. Appl. Math., 2011)

On the Localization of the Personalized PageRank of Complex Networks - Esther García; Francisco Pedroche; Miguel Romance (CoRR, 2012)

Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures - Alessio Cardillo; Massimiliano Zanin; Jesús Gómez-Gardeñes; Miguel Romance; Alejandro García del Amo; Stefano Boccaletti (CoRR, 2012)

Emergence of network features from multiplexity - Alessio Cardillo; Jesús Gómez-Gardeñes; Massimiliano Zanin; Miguel Romance; David Papo; Francisco del Pozo; Stefano Boccaletti (CoRR, 2012)

Editorial. - Regino Criado; Miguel Romance; Yamir Moreno; Jesús Gómez-Gardeñes (Int. J. Bifurc. Chaos, 2012)

A Post-Processing Method for Interest Point Location in Images by Using Weighted Line-Graph Complex Networks. - Regino Criado; Miguel Romance; Ángel Sánchez (Int. J. Bifurc. Chaos, 2012)

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)

Interest point detection in images using complex network analysis. - Regino Criado; Miguel Romance; Ángel Sánchez (J. Comput. Appl. Math., 2012)

Preface: Mesoscales and evolution in complex networks: Applications and related topics. - Regino Criado; Rosa M. Benito; Miguel Romance; Juan Carlos Losada (Networks Heterog. Media, 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)

A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues. - Regino Criado; Esther García; Francisco Pedroche; Miguel Romance (CoRR, 2013)

Comparing rankings by means of competitivity graphs: structural properties and computation. - Regino Criado; Esther García; Francisco Pedroche; Miguel Romance (CoRR, 2013)

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

The structure and dynamics of multilayer networks. - S. Boccaletti; Ginestra Bianconi; Regino Criado; Charo I. Del Genio; Jesús Gómez-Gardeñes; Miguel Romance; Irene Sendiña-Nadal; Z. Wang; Massimiliano Zanin (CoRR, 2014)

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)

Preface: "New trends, models and applications in complex and multiplex networks". - Rosa M. Benito; Regino Criado; Juan Carlos Losada; Miguel Romance (Networks Heterog. Media, 2015)

Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis. - Santiago Moral; Victor Chapela; Regino Criado; Miguel Romance (Networks Heterog. Media, 2015)

Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index). - Francisco Pedroche; Regino Criado; Esther García; Miguel Romance; Victoria E. Sánchez (Networks Heterog. Media, 2015)

On graphs associated to sets of rankings. - Regino Criado; Esther García; Francisco Pedroche; Miguel Romance (J. Comput. Appl. Math., 2016)

Credit Card Fraud Detection through Parenclitic Network Analysis. - Massimiliano Zanin; Miguel Romance; Santiago Moral; Regino Criado (Complex., 2018)

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

Sharp estimates for the personalized Multiplex PageRank. - Francisco Pedroche; Esther García; Miguel Romance; Regino Criado (J. Comput. Appl. Math., 2018)

On the spectrum of two-layer approach and Multiplex PageRank. - Francisco Pedroche; Esther García; Miguel Romance; Regino Criado (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)

Using complex networks to identify patterns in specialty mathematical language: a new approach. - A. Criado-Alonso; Elena Battaner Moro; David Aleja; Miguel Romance; Regino Criado (Soc. Netw. Anal. Min., 2020)

A compartmental model for cyber-epidemics. - David Aleja; Gonzalo Contreras-Aso; Karin Alfaro-Bittner; Eva Primo; Regino Criado; Miguel Romance; Stefano Boccaletti (CoRR, 2022)

Why are there six degrees of separation in a social network? - Ivan Samoylenko; David Aleja; Eva Primo; Karin Alfaro-Bittner; Ekaterina Vasilyeva; Kirill D. Kovalenko; Daniil Musatov; Andrei M. Raigorodskii; Regino Criado; Miguel Romance; David Papo; Matjaz Perc; et al. (CoRR, 2022)

Parametric control of PageRank centrality rankings: a geometrical approach. - Gonzalo Contreras-Aso; Regino Criado; Miguel Romance (CoRR, 2022)

Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. - Ekaterina Vasilyeva; Miguel Romance; Ivan Samoylenko; Kirill D. Kovalenko; Daniil Musatov; Andrei M. Raigorodskii; Stefano Boccaletti (Entropy, 2023)

A Hypergraph-based Model for Cyberincident-related Data Analysis. - Juan Manuel Matalobos Veiga; Regino Criado; Miguel Romance Del Rio; Sergio Iglesias Perez; Alberto Partida Rodriguez; Karan Kabbur Hanumanthappa Manjunatha (EICC, 2024)

Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities. - Gonzalo Contreras-Aso; Regino Criado; Miguel Romance (J. Complex Networks, 2024)

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

On the application of Visibility Graphs in the Spectral Domain for Speaker Recognition. - Hernan Bocaccio; Sergio Iglesias Perez; Miguel Romance; Regino Criado; Gabriel B. Mindlin (CoRR, 2025)

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

Fully personalized PageRank and algebraic methods to distribute a random walker. - Gonzalo Contreras-Aso; Regino Criado; Miguel Romance (Comput. Appl. Math., 2025)