Department of Computer Science, Systems and Production, University of Rome "Tor Vergata"
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c9 |      | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer: Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO 2013: 86-97 |
| 2012 | ||
| j23 | | Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer: On the recognition of fuzzy circular interval graphs. Discrete Mathematics 312(8): 1426-1435 (2012) |
| j22 | | Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo: On coloring problems with local constraints. Discrete Mathematics 312(12-13): 2027-2039 (2012) |
| c8 | | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer: Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA 2012: 1298-1308 |
| c7 | | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels: Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. WG 2012: 22-33 |
| 2011 | ||
| j21 | | Yuri Faenza, Gianpaolo Oriolo, Claudia Snels: A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants). Oper. Res. Lett. 39(3): 213-217 (2011) |
| j20 | | Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45): 6261-6268 (2011) |
| c6 | | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels: A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. CTW 2011: 80-83 |
| c5 | | Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer: An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem. SODA 2011: 630-646 |
| i2 | | Yuri Faenza, Gianpaolo Oriolo, Claudia Snels: A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants). CoRR abs/1103.2601 (2011) |
| i1 | | Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer: On the Recognition of Fuzzy Circular Interval Graphs. CoRR abs/1104.2251 (2011) |
| 2010 | ||
| j19 | | Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità: Stable routing under the Spanning Tree Protocol. Oper. Res. Lett. 38(5): 399-404 (2010) |
| j18 | | Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis: The VPN Problem with Concave Costs. SIAM J. Discrete Math. 24(3): 1080-1090 (2010) |
| 2009 | ||
| j17 | | Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo: On coloring problems with local constraints. Electronic Notes in Discrete Mathematics 35: 215-220 (2009) |
| 2008 | ||
| j16 | | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura: The stable set polytope of quasi-line graphs. Combinatorica 28(1): 45-67 (2008) |
| j15 | | |
| j14 | | Gianpaolo Oriolo, Gautier Stauffer: Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Math. Program. 115(2): 291-317 (2008) |
| j13 | | Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella: A short proof of the VPN Tree Routing Conjecture on ring networks. Oper. Res. Lett. 36(3): 361-365 (2008) |
| j12 | | Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, Laura Sanità: Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. Optical Switching and Networking 5(2-3): 159-169 (2008) |
| c4 | | Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto: Local Restoration for Trees and Arborescences. FITraMEn 2008: 130-140 |
| c3 | | Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer: A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. IPCO 2008: 77-96 |
| 2007 | ||
| j11 | | Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà: Hardness of robust network design. Networks 50(1): 50-54 (2007) |
| j10 | | Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, L. Sunil Chandran: The stable set problem and the thinness of a graph. Oper. Res. Lett. 35(1): 1-9 (2007) |
| j9 | | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007) |
| 2006 | ||
| j8 | | Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo: Design of trees in the hose model: The balanced case. Oper. Res. Lett. 34(6): 601-606 (2006) |
| 2005 | ||
| j7 | | L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo: On the cubicity of certain graphs. Inf. Process. Lett. 94(3): 113-118 (2005) |
| c2 | | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162 |
| c1 | | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305 |
| 2004 | ||
| j6 | | Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer: On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Meth. of OR 59(1): 25-35 (2004) |
| 2003 | ||
| j5 | | Gianpaolo Oriolo: Clique family inequalities for the stable set polytope of quasi-line graphs. Discrete Applied Mathematics 132(1-3): 185-201 (2003) |
| j4 | | Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd: Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003) |
| j3 | | Gaia Nicosia, Gianpaolo Oriolo: An approximate A* algorithm and its application to the SCS problem. Theor. Comput. Sci. 290(3): 2021-2029 (2003) |
| 2001 | ||
| j2 | | Gianpaolo Oriolo: Clique Covers in Claw-Free Berge Graphs. Electronic Notes in Discrete Mathematics 8: 68-71 (2001) |
| j1 | | Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd: Reserving Resilient Capacity in a Network. SIAM J. Discrete Math. 14(4): 524-539 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page