Gianpaolo Oriolo

52 papers A* 4A 1B 4C 1Journal 40Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Avoiding Deadlocks via Weak Deadlock Sets.
Networks
Gianpaolo Oriolo, Anna Russo Russo
2024 J jnl
Avoiding Deadlocks via Weak Deadlock Sets.
CoRR
Gianpaolo Oriolo, Anna Russo Russo
2022 J jnl
Horizontal collaboration in forestry: game theory models and algorithms for trading demands.
CoRR
Mourad Baïou, Gianpaolo Oriolo, Gautier Stauffer
2022 J jnl
On the facets of stable set polytopes of circular interval graphs.
Ann. Oper. Res.
Gianpaolo Oriolo, Gautier Stauffer
2021 J jnl
Minimum weighted clique cover on claw-free perfect graphs.
J. Graph Theory
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
2021 J jnl
Separation routine and extended formulations for the stable set problem in claw-free graphs.
Math. Program.
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2020 J jnl
Rerouting Flows when Links Fail.
SIAM J. Discret. Math.
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2019 J jnl
Single courier single restaurant meal delivery (without routing).
Oper. Res. Lett.
Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura
2017 — conf
Adaptivity in Network Interdiction.
GameSec
Bastián Bahamondes, José Correa, Jannik Matuschke, Gianpaolo Oriolo
2017 J jnl
Optimal design of a regional railway service in Italy.
J. Rail Transp. Plan. Manag.
Francesca Fedeli, Roberto Mancini, Carlo Mannino, Paolo Ofria, Gianpaolo Oriolo, Andrea Pacifici, Veronica Piccialli
2017 J jnl
Protection of flows under targeted attacks.
Oper. Res. Lett.
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2017 A* conf
Rerouting Flows When Links Fail.
ICALP
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2017 J jnl
Rerouting flows when links fail.
CoRR
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2016 J jnl
Protection of flows under targeted attacks.
CoRR
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2014 J jnl
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition.
J. ACM
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2013 B conf
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.
IPCO
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
2013 J jnl
Network design with a discrete set of traffic matrices.
Oper. Res. Lett.
Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen
2013 A conf
The Online Replacement Path Problem.
ESA
David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
2012 B conf
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.
WG
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
2012 J jnl
On coloring problems with local constraints.
Discret. Math.
Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo
2012 J jnl
On the recognition of fuzzy circular interval graphs.
Discret. Math.
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2012 A* conf
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.
SODA
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2011 J jnl
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).
Oper. Res. Lett.
Yuri Faenza, Gianpaolo Oriolo, Claudia Snels
2011 J jnl
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)
CoRR
Yuri Faenza, Gianpaolo Oriolo, Claudia Snels
2011 C conf
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.
CTW
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
2011 A* conf
An algorithmic decomposition of claw-free graphs leading to an O(n
SODA
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
2011 J jnl
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem.
Theor. Comput. Sci.
Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo
2011 J jnl
On the Recognition of Fuzzy Circular Interval Graphs
CoRR
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2010 J jnl
Stable routing under the Spanning Tree Protocol.
Oper. Res. Lett.
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità
2010 J jnl
The VPN Problem with Concave Costs.
SIAM J. Discret. Math.
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis
2009 J jnl
On coloring problems with local constraints.
Electron. Notes Discret. Math.
Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo
2008 B conf
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.
IPCO
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer
2008 J jnl
A short proof of the VPN Tree Routing Conjecture on ring networks.
Oper. Res. Lett.
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella
2008 J jnl
Clique-circulants and the stable set polytope of fuzzy circular interval graphs.
Math. Program.
Gianpaolo Oriolo, Gautier Stauffer
2008 J jnl
Domination Between Traffic Matrices.
Math. Oper. Res.
Gianpaolo Oriolo
2008 J jnl
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm.
Opt. Switch. Netw.
Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, Laura Sanità
2008 — conf
Local Restoration for Trees and Arborescences.
FITraMEn
Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto
2008 J jnl
The stable set polytope of quasi-line graphs.
Comb.
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2007 J jnl
Hardness of robust network design.
Networks
Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà
2007 J jnl
New Approaches for Virtual Private Network Design.
SIAM J. Comput.
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
2007 J jnl
The stable set problem and the thinness of a graph.
Oper. Res. Lett.
Carlo Mannino, Gianpaolo Oriolo, Federico Ricci-Tersenghi, L. Sunil Chandran
2006 J jnl
Design of trees in the hose model: The balanced case.
Oper. Res. Lett.
Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
2005 B conf
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.
IPCO
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
2005 A* conf
New Approaches for Virtual Private Network Design.
ICALP
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
2005 J jnl
On the cubicity of certain graphs.
Inf. Process. Lett.
L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo
2004 J jnl
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.
Math. Methods Oper. Res.
Thomas M. Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer
2004 J jnl
Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm.
Photonic Netw. Commun.
Roberto Sabella, Paola Iovanna, Gianpaolo Oriolo, P. D'Aprile
2003 J jnl
An approximate A* algorithm and its application to the SCS problem.
Theor. Comput. Sci.
Gaia Nicosia, Gianpaolo Oriolo
2003 J jnl
Clique family inequalities for the stable set polytope of quasi-line graphs.
Discret. Appl. Math.
Gianpaolo Oriolo
2003 J jnl
Reserving resilient capacity for a single commodity with upper-bound constraints.
Networks
Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd
2001 J jnl
Clique Covers in Claw-Free Berge Graphs.
Electron. Notes Discret. Math.
Gianpaolo Oriolo
2001 J jnl
Reserving Resilient Capacity in a Network.
SIAM J. Discret. Math.
Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd