


default search action
Pablo Romero 0001
Person information
- affiliation: University of the Republic, Montevideo, Uruguay
Other persons with the same name
- Pablo Romero — disambiguation page
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2026
[j30]Pablo Romero
:
Most reliable graphs with reduced corank. Discret. Appl. Math. 379: 855-871 (2026)
[j29]Pablo Romero
, Martín D. Safe:
Nonexistence of uniformly most reliable graphs of least corank. Discret. Appl. Math. 380: 407-419 (2026)- 2025
[j28]Pablo Romero
:
Characterization of locally most split reliable graphs. Theor. Comput. Sci. 1047: 115327 (2025)- 2022
[j27]Mathias Bourel, Eduardo Alberto Canale
, Franco Robledo, Pablo Romero
, Luis Stábile:
Complexity and heuristics for the weighted max cut-clique problem. Int. Trans. Oper. Res. 29(2): 908-928 (2022)
[j26]Héctor Cancela, Leslie Murray, Franco Robledo, Pablo Romero, Pablo Sartor:
On the reliability estimation of stochastic binary systems. Int. Trans. Oper. Res. 29(3): 1688-1722 (2022)
[j25]Javiera Barrera
, Eduardo Moreno
, Gonzalo Muñoz
, Pablo Romero
:
Exact reliability optimization for series-parallel graphs using convex envelopes. Networks 80(2): 235-248 (2022)
[j24]Mauro Martínez, Pablo Romero
, Julian Viera:
A simple proof of the Gross-Saccoman multigraph conjecture. Networks 80(3): 333-337 (2022)
[j23]Pablo Romero
:
Uniformly optimally reliable graphs: A survey. Networks 80(4): 466-481 (2022)
[j22]Pablo Romero
:
Universal Reliability Bounds for Sparse Networks. IEEE Trans. Reliab. 71(1): 359-369 (2022)- 2021
[j21]Pablo Romero
:
The Gross-Saccoman conjecture is true. Networks 78(2): 164-173 (2021)- 2020
[j20]Amaro de Sousa, Gabriela Gallo, Santiago Gutierrez, Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero:
A tree-block decomposition-based heuristic for the minimum broadcast time. Int. J. Metaheuristics 7(4): 379-401 (2020)- 2019
[j19]Manuel Aprile
, Natalia Castro, Graciela Ferreira, Juan Piccini, Franco Robledo, Pablo Romero
:
Graph fragmentation problem: analysis and synthesis. Int. Trans. Oper. Res. 26(1): 41-53 (2019)- 2018
[j18]Amaro de Sousa, Gabriela Gallo, Santiago Gutierrez, Franco Robledo, Pablo Rodríguez-Bocca
, Pablo Romero
:
Heuristics for the Minimum Broadcast Time. Electron. Notes Discret. Math. 69: 165-172 (2018)
[j17]Graciela Ferreira, Franco Robledo, Pablo Romero
:
An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes. Electron. Notes Discret. Math. 69: 173-180 (2018)
[j16]Juan Piccini, Franco Robledo, Pablo Romero
:
Complexity among combinatorial problems from epidemics. Int. Trans. Oper. Res. 25(1): 295-318 (2018)
[j15]Rodrigo Recoba, Franco Robledo, Pablo Romero
, Omar Viera:
Two-node-connected star problem. Int. Trans. Oper. Res. 25(2): 523-543 (2018)- 2017
[j14]Eduardo Alberto Canale
, Pablo Romero
, Gerardo Rubino:
Factorization and exact evaluation of the source-terminal diameter-constrained reliability. Networks 70(4): 283-291 (2017)
[j13]Jacek Rak
, Dimitri Papadimitriou, Heiko Niedermayer, Pablo Romero
:
Information-driven network resilience: Research challenges and perspectives. Opt. Switch. Netw. 23: 156-178 (2017)- 2016
[j12]Gabriel Bayá, Antonio Mauttone, Franco Robledo, Pablo Romero
, Gerardo Rubino:
Capacitated m Ring Star Problem under Diameter Constrained Reliability. Electron. Notes Discret. Math. 51: 23-30 (2016)
[j11]Gabriel Bayá, Antonio Mauttone, Franco Robledo, Pablo Romero
:
Capacitated m Two-Node Survivable Star Problem. Electron. Notes Discret. Math. 52: 253-260 (2016)
[j10]Pablo Romero
, Jorge Graneri, Omar Viera, Sandro Moscatelli, Libertad Tansini:
A Multi-Tree Committee to assist port-of-entry inspection decisions. Eur. J. Oper. Res. 253(1): 170-177 (2016)- 2015
[j9]Pablo Romero
, Franco Robledo, Pablo Rodríguez-Bocca
, Claudia Rostagnol:
Lyapunov stability and performance of user-assisted Video-on-Demand services. Comput. Networks 79: 203-215 (2015)
[j8]Eduardo Alberto Canale
, Héctor Cancela
, Franco Robledo, Pablo Romero, Pablo Sartor:
Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5): 811-821 (2015)
[j7]Eduardo Alberto Canale
, Héctor Cancela
, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior. Networks 66(4): 296-305 (2015)- 2014
[j6]Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter-constrained K-reliability evaluation: complexity and heuristics. Int. J. Metaheuristics 3(3): 223-243 (2014)
[j5]Pablo Romero
, Franco Robledo, Pablo Rodríguez-Bocca
, Claudia Rostagnol:
Analysis and design of peer-assisted video-on-demand services. Int. Trans. Oper. Res. 21(4): 559-579 (2014)
[j4]Eduardo Alberto Canale
, Franco Robledo, Pablo Romero, Pablo Sartor:
Monte Carlo methods in diameter-constrained reliability. Opt. Switch. Netw. 14: 134-148 (2014)- 2013
[j3]Pablo Romero
, Franco Robledo Amoza, Pablo Rodríguez-Bocca
:
Optimum piece selection strategies for a peer-to-peer video streaming platform. Comput. Oper. Res. 40(5): 1289-1299 (2013)
[j2]Pablo Romero
, Franco Robledo, Pablo Rodríguez-Bocca
, Claudia Rostagnol:
Mathematical Analysis of caching policies and cooperation in YouTube-like services. Electron. Notes Discret. Math. 41: 221-228 (2013)
[j1]Pablo Romero, Franco Robledo, Pablo Rodríguez-Bocca:
An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks. Int. J. Metaheuristics 2(2): 101-122 (2013)
Conference and Workshop Papers
- 2025
[c50]Pablo Romero:
An Algebraic Characterization of Strong Graphs. CALDAM 2025: 270-279
[c49]Pablo Romero:
There are Finitely Many Uniformly Most Reliable Graphs of Corank 5. CALDAM 2025: 280-291
[c48]Pablo Romero, Louis Petingi:
Construction of infinitely many trace-minimal graphs with maximum number of spanning trees. LAGOS 2025: 177-184
[c47]Pablo Romero:
Most reliable two-terminal graphs with distance constraints. LAGOS 2025: 185-192- 2023
[c46]Pablo Romero, Martín D. Safe:
Least corank for the nonexistence of uniformly most reliable graphs. LAGOS 2023: 88-95- 2021
[c45]Sebastián Laborde, Franco Robledo, Pablo Romero
, Omar Viera:
A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability. ICVNS 2021: 43-57
[c44]Matías Banchero, Franco Robledo, Pablo Romero, Pablo Sartor, Camilo Servetti:
Max-Diversity Orthogonal Regrouping of MBA Students Using a GRASP/VND Heuristic. ICVNS 2021: 58-70
[c43]Lucía Barrero, Franco Robledo, Pablo Romero
, Rodrigo Viera:
A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows. ICVNS 2021: 152-165- 2020
[c42]Eduardo Alberto Canale
, Guillermo Rela
, Franco Robledo, Pablo Romero
, Luis Stábile:
Design of Most-Reliable Cubic Networks by Augmentations. DRCN 2020: 1-6
[c41]Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero
:
Optimal Broadcast Strategy in Homogeneous Point-to-Point Networks. LOD (1) 2020: 448-457
[c40]Guido Lagos
, Pablo Romero
:
On the Reliability of Dynamical Stochastic Binary Systems. LOD (1) 2020: 516-527
[c39]Giovanna Fortez, Franco Robledo, Pablo Romero
, Omar Viera:
A Fast Genetic Algorithm for the Max Cut-Clique Problem. LOD (1) 2020: 528-539- 2019
[c38]Mathias Bourel, Eduardo A. Canale
, Franco Robledo, Pablo Romero
, Luis Stábile:
Building Highly Reliable Networks with GRASP/VND Heuristics. DRCN 2019: 91-98
[c37]Eduardo A. Canale
, Franco Robledo, Pablo Romero
, Julian Viera:
Building Reliability-Improving Network Transformations. DRCN 2019: 107-113
[c36]Mathias Bourel
, Eduardo Alberto Canale
, Franco Robledo, Pablo Romero
, Luis Stábile:
A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks. HM 2019: 78-92
[c35]Nicole Rosenstock
, Juan Piccini, Guillermo Rela, Franco Robledo, Pablo Romero
:
GRASP Heuristics for the Stochastic Weighted Graph Fragmentation Problem. LOD 2019: 422-433
[c34]Guillermo Rela
, Franco Robledo, Pablo Romero
:
Uniformly Most-Reliable Graphs and Antiholes. LOD 2019: 434-444
[c33]Pablo Romero
:
Challenges in Stochastic Binary Systems. RNDM 2019: 1-8
[c32]Amaro de Sousa, Juan Piccini, Franco Robledo, Pablo Romero
:
An Interplay between Critical Node Detection and Epidemic Models. RNDM 2019: 1-7- 2018
[c31]Héctor Cancela
, Gustavo Guerberoff, Franco Robledo, Pablo Romero
:
Reliability maximization in stochastic binary systems. ICIN 2018: 1-7
[c30]Mathias Bourel, Eduardo Alberto Canale
, Franco Robledo, Pablo Romero
, Luis Stábile:
Complexity and Heuristics for the Max Cut-Clique Problem. ICVNS 2018: 28-40
[c29]Mathias Bourel, Eduardo A. Canale
, Franco Robledo, Pablo Romero
, Luis Stábile:
A GRASP/VND Heuristic for the Max Cut-Clique Problem. LOD 2018: 357-367
[c28]Héctor Cancela
, Graciela Ferreira, Gustavo Guerberoff, Franco Robledo, Pablo Romero
:
Building Reliability Bounds in Stochastic Binary Systems. RNDM 2018: 1-7- 2017
[c27]Guillermo Rela
, Franco Robledo, Pablo Romero
:
Petersen Graph is Uniformly Most-Reliable. MOD 2017: 426-435
[c26]Gabriel Bayá, Antonio Mauttone, Franco Robledo, Pablo Romero
:
GRASP Heuristics for a Generalized Capacitated Ring Tree Problem. MOD 2017: 436-448
[c25]Natalia Castro, Graciela Ferreira, Franco Robledo, Pablo Romero
:
Graph Fragmentation Problem for Natural Disaster Management. MOD 2017: 496-505
[c24]Pablo Romero
:
Building uniformly most-reliable networks by iterative augmentation. RNDM 2017: 1-7- 2016
[c23]Franco Robledo, Pablo Romero
, Maria Saravia:
On the interplay between topological network design and diameter constrained reliability. DRCN 2016: 106-108
[c22]Rodrigo Recoba, Franco Robledo, Pablo Romero
, Omar Viera:
A GRASP/VND Heuristic for a Generalized Ring Star Problem. HM 2016: 104-117
[c21]Gabriel Bayá, Antonio Mauttone, Franco Robledo, Pablo Romero
:
The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach. HM 2016: 171-186
[c20]Juan Piccini, Franco Robledo, Pablo Romero
:
Graph Fragmentation Problem. ICORES 2016: 137-144
[c19]Eduardo A. Canale
, Pablo Romero
, Gerardo Rubino:
Factorization theory in diameter constrained reliability. RNDM 2016: 66-71
[c18]Eduardo A. Canale
, Pablo Romero
, Gerardo Rubino, Xavier Warnes
:
Network utility problem and easy reliability polynomials. RNDM 2016: 79-84
[c17]Pablo Romero
:
Duality in stochastic binary systems. RNDM 2016: 85-91
[c16]Juan Piccini, Franco Robledo, Pablo Romero
:
Analysis and complexity of pandemics. RNDM 2016: 224-230- 2015
[c15]Cecilia Parodi, Franco Robledo, Pablo Romero
, Carlos Testuri:
Optimal multicommodity flows over an existing DWDM multi-overlay. LATINCOM 2015: 1-6
[c14]Juan Piccini, Franco Robledo, Pablo Romero
:
Node-Immunization Strategies in a Stochastic Epidemic Model. MOD 2015: 222-232
[c13]Eduardo Alberto Canale
, Héctor Cancela
, Juan Piccini, Franco Robledo, Pablo Romero, Gerardo Rubino, Pablo Sartor:
Recursive Variance Reduction method in stochastic monotone binary systems. RNDM@WMNC 2015: 135-141
[c12]María Elisa Bertinat, Héctor Cancela
, Maria Fernanda Gonzalez, Franco Robledo, Pablo Romero
:
Statistical methods for diameter constrained reliability estimation in rare event scenarios. RNDM@WMNC 2015: 243-250- 2014
[c11]Eduardo Alberto Canale
, Juan Piccini, Franco Robledo, Pablo Romero
:
Diameter-Constrained Reliability: Complexity, Factorization and Exact computation in Weak Graphs. LANC 2014: 12:1-12:7- 2013
[c10]Pablo Romero
, Berardi Sensale Rodriguez, Diego Astessiano, Rafael M. Canetti:
Fisho: A cost-effective intelligent autonomous robot fish. ICAR 2013: 1-6
[c9]Franco Robledo, Pablo Romero, Pablo Sartor:
A novel Interpolation technique to address the Edge-Reliability Problem. ICUMT 2013: 187-192- 2012
[c8]Pablo Romero, María Elisa Bertinat, Darío Padula, Pablo Rodríguez-Bocca, Franco Robledo Amoza:
A Cooperative Model for Multi-class Peer-to-peer Streaming Networks. ICORES 2012: 274-282
[c7]Franco Robledo Amoza, Pablo Rodríguez-Bocca
, Pablo Romero
, Claudia Rostagnol:
Stability and capacity of peer-to-peer assisted video-on-demand applications. ICUMT 2012: 328-335
[c6]Franco Robledo Amoza, Pablo Rodríguez-Bocca
, Pablo Romero
, Claudia Rostagnol:
A new caching policy for cloud assisted Peer-to-Peer video-on-demand services. P2P 2012: 43-49- 2011
[c5]Darío Padula, María Elisa Bertinat, Franco Robledo Amoza, Pablo Rodríguez-Bocca
, Pablo Romero
:
A Simple Proactive Provider Participation Technique in a Mesh-Based Peer-to-Peer Streaming Service. HAIS (2) 2011: 42-50
[c4]María Elisa Bertinat, Darío Padula, Franco Robledo Amoza, Pablo Rodríguez-Bocca
, Pablo Romero
:
Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks. INOC 2011: 529-534- 2010
[c3]Pablo Romero
, Franco Robledo, Pablo Rodríguez-Bocca
, Darío Padula, María Elisa Bertinat:
A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach. ANTS Conference 2010: 336-343- 2009
[c2]María Elisa Bertinat, Darío Padula, Franco Robledo Amoza, Pablo Romero
, Daniel De Vera, Pablo Rodríguez-Bocca
, Gerardo Rubino:
A COP for cooperation in a P2P streaming protocol. ICUMT 2009: 1-7
[c1]María Elisa Bertinat, Daniel De Vera, Darío Padula, Franco Robledo Amoza, Pablo Rodríguez-Bocca
, Pablo Romero
, Gerardo Rubino:
GoalBit: the first free and open source peer-to-peer streaming network. LANC 2009: 49-59
Informal and Other Publications
- 2020
[i4]Héctor Cancela, Gustavo Guerberoff, Franco Robledo, Pablo Romero:
Analysis and Reliability of Separable Systems. CoRR abs/2011.02027 (2020)- 2014
[i3]Eduardo A. Canale, Pablo Romero:
Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals. CoRR abs/1404.3684 (2014)
[i2]Eduardo Alberto Canale, Pablo Romero, Gerardo Rubino:
Irrelevant Components and Exact Computation of the Diameter Constrained Reliability. CoRR abs/1409.7688 (2014)
[i1]Eduardo A. Canale, Pablo Romero, Gerardo Rubino:
A Full Characterization of Irrelevant Components in Diameter Constrained Reliability. CoRR abs/1410.0707 (2014)
Coauthor Index
aka: Eduardo A. Canale
aka: Franco Robledo Amoza

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 2026-02-01 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







