default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiguel Romance
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Gonzalo Contreras-Aso
, Regino Criado, Miguel Romance:
Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities. J. Complex Networks 12(5) (2024)- [c1]Juan Manuel Matalobos Veiga, Regino Criado, Miguel Romance Del Rio, Sergio Iglesias Perez, Alberto Partida Rodriguez, Karan Kabbur Hanumanthappa Manjunatha:
A Hypergraph-based Model for Cyberincident-related Data Analysis. EICC 2024: 161-162 - [i15]David Aleja, Julio Flores, Eva Primo, Miguel Romance:
Time-dependent Personalized PageRank for temporal networks: discrete and continuous scales. CoRR abs/2407.06198 (2024) - 2023
- [j28]Ekaterina Vasilyeva, Miguel Romance, Ivan Samoylenko, Kirill D. Kovalenko, Daniil Musatov, Andrei M. Raigorodskii, Stefano Boccaletti:
Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. Entropy 25(6): 923 (2023) - 2022
- [i14]David Aleja, Gonzalo Contreras-Aso, Karin Alfaro-Bittner, Eva Primo, Regino Criado, Miguel Romance, Stefano Boccaletti:
A compartmental model for cyber-epidemics. CoRR abs/2205.08345 (2022) - [i13]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, Baruch Barzel, Stefano Boccaletti:
Why are there six degrees of separation in a social network? CoRR abs/2211.09463 (2022) - [i12]Gonzalo Contreras-Aso, Regino Criado, Miguel Romance:
Parametric control of PageRank centrality rankings: a geometrical approach. CoRR abs/2211.12929 (2022) - 2020
- [j27]A. Criado-Alonso, Elena Battaner Moro, David Aleja, Miguel Romance, Regino Criado:
Using complex networks to identify patterns in specialty mathematical language: a new approach. Soc. Netw. Anal. Min. 10(1): 69 (2020)
2010 – 2019
- 2019
- [j26]Regino Criado, Julio Flores, Esther García, Alejandro García del Amo, Ángel Pérez, Miguel Romance:
On the α-nonbacktracking centrality for complex networks: Existence and limit cases. J. Comput. Appl. Math. 350: 35-45 (2019) - 2018
- [j25]Massimiliano Zanin, Miguel Romance, Santiago Moral, Regino Criado:
Credit Card Fraud Detection through Parenclitic Network Analysis. Complex. 2018: 5764370:1-5764370:9 (2018) - [j24]Francisco Pedroche, Esther García, Miguel Romance, Regino Criado:
Sharp estimates for the personalized Multiplex PageRank. J. Comput. Appl. Math. 330: 1030-1040 (2018) - [j23]Julio Flores, Miguel Romance:
On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales. J. Comput. Appl. Math. 330: 1041-1051 (2018) - [j22]Francisco Pedroche, Esther García, Miguel Romance, Regino Criado:
On the spectrum of two-layer approach and Multiplex PageRank. J. Comput. Appl. Math. 344: 161-172 (2018) - 2017
- [i11]Massimiliano Zanin, Miguel Romance, Santiago Moral, Regino Criado:
Credit card fraud detection through parenclitic network analysis. CoRR abs/1706.01953 (2017) - 2016
- [j21]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
On graphs associated to sets of rankings. J. Comput. Appl. Math. 291: 497-508 (2016) - 2015
- [j20]Francisco Pedroche, Regino Criado, Esther García, Miguel Romance, Victoria E. Sánchez:
Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index). Networks Heterog. Media 10(1): 101-125 (2015) - [j19]Santiago Moral, Victor Chapela, Regino Criado, Miguel Romance:
Efficient algorithms for estimating loss of information in a complex network: Applications to intentional risk analysis. Networks Heterog. Media 10(1): 195-208 (2015) - [j18]Rosa M. Benito, Regino Criado, Juan Carlos Losada, Miguel Romance:
Preface: "New trends, models and applications in complex and multiplex networks". Networks Heterog. Media 10(1): i-iii (2015) - 2014
- [j17]Regino Criado, Julio Flores, Alejandro García del Amo, Miguel Romance:
Centralities of a network and its line graph: an analytical comparison by means of their irregularity. Int. J. Comput. Math. 91(2): 304-314 (2014) - [i10]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:
The structure and dynamics of multilayer networks. CoRR abs/1407.0742 (2014) - 2013
- [i9]Luis Sola, Miguel Romance, Regino Criado, Julio Flores, Alejandro García del Amo, Stefano Boccaletti:
Eigenvector centrality of nodes in multiplex networks. CoRR abs/1305.7445 (2013) - [i8]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues. CoRR abs/1307.3412 (2013) - [i7]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
Comparing rankings by means of competitivity graphs: structural properties and computation. CoRR abs/1310.6921 (2013) - 2012
- [j16]Regino Criado, Miguel Romance, Yamir Moreno, Jesús Gómez-Gardeñes:
Editorial. Int. J. Bifurc. Chaos 22(7) (2012) - [j15]Regino Criado, Miguel Romance, Ángel Sánchez:
A Post-Processing Method for Interest Point Location in Images by Using Weighted Line-Graph Complex Networks. Int. J. Bifurc. Chaos 22(7) (2012) - [j14]Regino Criado, Julio Flores, Alejandro García del Amo, Jesús Gómez-Gardeñes, Miguel Romance:
A mathematical model for networks with structures in the mesoscale. Int. J. Comput. Math. 89(3): 291-309 (2012) - [j13]Regino Criado, Miguel Romance, Ángel Sánchez:
Interest point detection in images using complex network analysis. J. Comput. Appl. Math. 236(12): 2975-2980 (2012) - [j12]Regino Criado, Julio Flores, Alejandro García del Amo, Miguel Romance:
Structural properties of the line-graphs associated to directed networks. Networks Heterog. Media 7(3): 373-384 (2012) - [j11]Regino Criado, Rosa M. Benito, Miguel Romance, Juan Carlos Losada:
Preface: Mesoscales and evolution in complex networks: Applications and related topics. Networks Heterog. Media 7(3): i-iii (2012) - [i6]Esther García, Francisco Pedroche, Miguel Romance:
On the Localization of the Personalized PageRank of Complex Networks. CoRR abs/1206.4855 (2012) - [i5]Alessio Cardillo, Massimiliano Zanin, Jesús Gómez-Gardeñes, Miguel Romance, Alejandro García del Amo, Stefano Boccaletti:
Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures. CoRR abs/1211.6839 (2012) - [i4]Alessio Cardillo, Jesús Gómez-Gardeñes, Massimiliano Zanin, Miguel Romance, David Papo, Francisco del Pozo, Stefano Boccaletti:
Emergence of network features from multiplexity. CoRR abs/1212.2153 (2012) - 2011
- [j10]Regino Criado, Julio Flores, Alejandro García del Amo, Miguel Romance:
Analytical relationships between metric and centrality measures of a network and its dual. J. Comput. Appl. Math. 235(7): 1775-1780 (2011) - [j9]Miguel Romance:
Local estimates for eigenvector-like centralities of complex networks. J. Comput. Appl. Math. 235(7): 1868-1874 (2011) - [i3]Vincenzo Nicosia, Regino Criado, Miguel Romance, Giovanni Russo, Vito Latora:
Controlling centrality in complex networks. CoRR abs/1109.4521 (2011) - 2010
- [j8]Regino Criado, Miguel Romance, María Vela-Pérez:
Hyperstructures, a New Approach to Complex Systems. Int. J. Bifurc. Chaos 20(3): 877-883 (2010) - [i2]Jesús Gómez-Gardeñes, Miguel Romance, Regino Criado, Daniele Vilone, Ángel Sánchez:
Evolutionary Games defined at the Network Mesoscale: The Public Goods game. CoRR abs/1011.1293 (2010) - [i1]Regino Criado, Julio Flores, Alejandro García del Amo, Jesús Gómez-Gardeñes, Miguel Romance:
A mathematical model for networks with structures in the mesoscale. CoRR abs/1012.3252 (2010)
2000 – 2009
- 2009
- [j7]Stefano Boccaletti, Regino Criado, Miguel Romance:
Editorial. Int. J. Bifurc. Chaos 19(2): 661-663 (2009) - [j6]Regino Criado, Javier Pello, Miguel Romance, María Vela-Pérez:
A Node-Based Multiscale Vulnerability of Complex Networks. Int. J. Bifurc. Chaos 19(2): 703-710 (2009) - [j5]Stefano Boccaletti, Regino Criado, Javier Pello, Miguel Romance, María Vela-Pérez:
Vulnerability and Fall of Efficiency in Complex Networks: a New Approach with Computational Advantages. Int. J. Bifurc. Chaos 19(2): 727-735 (2009) - [j4]Regino Criado, Javier Pello, Miguel Romance, María Vela-Pérez:
Improvements in performance and security for complex networks. Int. J. Comput. Math. 86(2): 209-218 (2009) - 2008
- [j3]Regino Criado, Benito Hernández-Bermejo, J. Marco-Blanco, Miguel Romance:
Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model. Int. J. Comput. Math. 85(3&4): 411-419 (2008) - 2007
- [j2]Regino Criado, Benito Hernández-Bermejo, Miguel Romance:
Efficiency, Vulnerability and Cost: an Overview with Applications to Subway Networks Worldwide. Int. J. Bifurc. Chaos 17(7): 2289-2301 (2007) - 2005
- [j1]Regino Criado, Julio Flores, Benito Hernández-Bermejo, Javier Pello, Miguel Romance:
Effective measurement of network vulnerability under random and intentional attacks. J. Math. Model. Algorithms 4(3): 307-316 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
