Pablo Romero

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Graciela Ferreira

> Home > Persons > Pablo Romero

Publications

2019
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/itor/AprileCFPRR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/itor/AprileCFPRR19
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
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/FerreiraRR18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/FerreiraRR18
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)
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/rndm/CancelaFGRR18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rndm/CancelaFGRR18
Héctor Cancela, Graciela Ferreira, Gustavo Guerberoff, Franco Robledo, Pablo Romero:
Building Reliability Bounds in Stochastic Binary Systems. RNDM 2018: 1-7
2017
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/mod/CastroFRR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mod/CastroFRR17
Natalia Castro, Graciela Ferreira, Franco Robledo, Pablo Romero:
Graph Fragmentation Problem for Natural Disaster Management. MOD 2017: 496-505

a service of

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.