Clique Covers in Claw-Free Berge Graphs. - Gianpaolo Oriolo (Electron. Notes Discret. Math., 2001)

Reserving Resilient Capacity in a Network. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (SIAM J. Discret. Math., 2001)

Clique family inequalities for the stable set polytope of quasi-line graphs. - Gianpaolo Oriolo (Discret. Appl. Math., 2003)

Reserving resilient capacity for a single commodity with upper-bound constraints. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (Networks, 2003)

An approximate A* algorithm and its application to the SCS problem. - Gaia Nicosia; Gianpaolo Oriolo (Theor. Comput. Sci., 2003)

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. - Thomas M. Liebling; Gianpaolo Oriolo; Bianca Spille; Gautier Stauffer (Math. Methods Oper. Res., 2004)

Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm. - Roberto Sabella; Paola Iovanna; Gianpaolo Oriolo; P. D'Aprile (Photonic Netw. Commun., 2004)

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. - Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura (IPCO, 2005)

On the cubicity of certain graphs. - L. Sunil Chandran; Carlo Mannino; Gianpaolo Oriolo (Inf. Process. Lett., 2005)

Design of trees in the hose model: The balanced case. - Giuseppe F. Italiano; Stefano Leonardi 001; Gianpaolo Oriolo (Oper. Res. Lett., 2006)

Hardness of robust network design. - Chandra Chekuri; F. Bruce Shepherd; Gianpaolo Oriolo; Maria Grazia Scutellà (Networks, 2007)

The stable set problem and the thinness of a graph. - Carlo Mannino; Gianpaolo Oriolo; Federico Ricci-Tersenghi; L. Sunil Chandran (Oper. Res. Lett., 2007)

New Approaches for Virtual Private Network Design. - Friedrich Eisenbrand; Fabrizio Grandoni 001; Gianpaolo Oriolo; Martin Skutella (SIAM J. Comput., 2007)

Local Restoration for Trees and Arborescences. - Paola Iovanna; Gaia Nicosia; Gianpaolo Oriolo; Laura Sanità; Ezio Sperduto (FITraMEn, 2008)

A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. - Gianpaolo Oriolo; Ugo Pietropaoli; Gautier Stauffer (IPCO, 2008)

The stable set polytope of quasi-line graphs. - Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura (Comb., 2008)

Domination Between Traffic Matrices. - Gianpaolo Oriolo (Math. Oper. Res., 2008)

Clique-circulants and the stable set polytope of fuzzy circular interval graphs. - Gianpaolo Oriolo; Gautier Stauffer (Math. Program., 2008)

A short proof of the VPN Tree Routing Conjecture on ring networks. - Fabrizio Grandoni 001; Volker Kaibel; Gianpaolo Oriolo; Martin Skutella (Oper. Res. Lett., 2008)

Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm. - Roberto Sabella; Paola Iovanna; Gianpaolo Oriolo; Laura Sanità (Opt. Switch. Netw., 2008)

On coloring problems with local constraints. - Flavia Bonomo; Yuri Faenza; Gianpaolo Oriolo (Electron. Notes Discret. Math., 2009)

Stable routing under the Spanning Tree Protocol. - Fabrizio Grandoni 001; Gaia Nicosia; Gianpaolo Oriolo; Laura Sanità (Oper. Res. Lett., 2010)

The VPN Problem with Concave Costs. - Samuel Fiorini; Gianpaolo Oriolo; Laura Sanità; Dirk Oliver Theis (SIAM J. Discret. Math., 2010)

A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (CTW, 2011)

An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem. - Yuri Faenza; Gianpaolo Oriolo; Gautier Stauffer (SODA, 2011)

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) - Yuri Faenza; Gianpaolo Oriolo; Claudia Snels (CoRR, 2011)

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants). - Yuri Faenza; Gianpaolo Oriolo; Claudia Snels (Oper. Res. Lett., 2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. - Flavia Bonomo; Sara Mattia; Gianpaolo Oriolo (Theor. Comput. Sci., 2011)

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. - Yuri Faenza; Gianpaolo Oriolo; Gautier Stauffer (SODA, 2012)

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (WG, 2012)

On the recognition of fuzzy circular interval graphs. - Gianpaolo Oriolo; Ugo Pietropaoli; Gautier Stauffer (Discret. Math., 2012)

The Online Replacement Path Problem. - David Adjiashvili; Gianpaolo Oriolo; Marco Senatore (ESA, 2013)

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels; Gautier Stauffer (IPCO, 2013)

Network design with a discrete set of traffic matrices. - Gianpaolo Oriolo; Laura Sanità; Rico Zenklusen (Oper. Res. Lett., 2013)

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. - Yuri Faenza; Gianpaolo Oriolo; Gautier Stauffer (J. ACM, 2014)

Adaptivity in Network Interdiction. - Bastián Bahamondes; José Correa 001; Jannik Matuschke; Gianpaolo Oriolo (GameSec, 2017)

Optimal design of a regional railway service in Italy. - Francesca Fedeli; Roberto Mancini; Carlo Mannino; Paolo Ofria; Gianpaolo Oriolo; Andrea Pacifici; Veronica Piccialli (J. Rail Transp. Plan. Manag., 2017)

Protection of flows under targeted attacks. - Jannik Matuschke; S. Thomas McCormick; Gianpaolo Oriolo; Britta Peis; Martin Skutella (Oper. Res. Lett., 2017)

Single courier single restaurant meal delivery (without routing). - Matteo Cosmi; Gianpaolo Oriolo; Veronica Piccialli; Paolo Ventura (Oper. Res. Lett., 2019)

Rerouting Flows when Links Fail. - Jannik Matuschke; S. Thomas McCormick; Gianpaolo Oriolo (SIAM J. Discret. Math., 2020)

Minimum weighted clique cover on claw-free perfect graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (J. Graph Theory, 2021)

Separation routine and extended formulations for the stable set problem in claw-free graphs. - Yuri Faenza; Gianpaolo Oriolo; Gautier Stauffer (Math. Program., 2021)

On the facets of stable set polytopes of circular interval graphs. - Gianpaolo Oriolo; Gautier Stauffer (Ann. Oper. Res., 2022)

Horizontal collaboration in forestry: game theory models and algorithms for trading demands. - Mourad Baïou; Gianpaolo Oriolo; Gautier Stauffer (CoRR, 2022)

Avoiding Deadlocks via Weak Deadlock Sets. - Gianpaolo Oriolo; Anna Russo Russo (CoRR, 2024)