Gianpaolo Oriolo

CoRR, 2022

On the facets of stable set polytopes of circular interval graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

Separation routine and extended formulations for the stable set problem in claw-free graphs.

[BibT_eX]

[DOI]

Math. Program., 2021

Minimum weighted clique cover on claw-free perfect graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

2020

Rerouting Flows when Links Fail.

[BibT_eX]

[DOI]

Jannik Matuschke

S. Thomas McCormick

SIAM J. Discret. Math., 2020

2019

Single courier single restaurant meal delivery (without routing).

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

2017

Protection of flows under targeted attacks.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

Optimal design of a regional railway service in Italy.

[BibT_eX]

[DOI]

J. Rail Transp. Plan. Manag., 2017

Adaptivity in Network Interdiction.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

2014

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition.

[BibT_eX]

[DOI]

J. ACM, 2014

2013

Network design with a discrete set of traffic matrices.

[BibT_eX]

[DOI]

Laura Sanità

Rico Zenklusen

Oper. Res. Lett., 2013

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

The Online Replacement Path Problem.

[BibT_eX]

[DOI]

David Adjiashvili

Marco Senatore

Proceedings of the Algorithms - ESA 2013, 2013

2012

On the recognition of fuzzy circular interval graphs.

[BibT_eX]

[DOI]

Ugo Pietropaoli

Discret. Math., 2012

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem.

[BibT_eX]

[DOI]

Sara Mattia

Theor. Comput. Sci., 2011

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)

[BibT_eX]

[DOI]

CoRR, 2011

An algorithmic decomposition of claw-free graphs leading to an O(n<sup>3</sup>)-algorithm for the weighted stable set problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

The VPN Problem with Concave Costs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Stable routing under the Spanning Tree Protocol.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

2009

On coloring problems with local constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm.

[BibT_eX]

[DOI]

Opt. Switch. Netw., 2008

A short proof of the VPN Tree Routing Conjecture on ring networks.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Clique-circulants and the stable set polytope of fuzzy circular interval graphs.

[BibT_eX]

[DOI]

Math. Program., 2008

Domination Between Traffic Matrices.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

The stable set polytope of quasi-line graphs.

[BibT_eX]

[DOI]

Comb., 2008

A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.

[BibT_eX]

[DOI]

Ugo Pietropaoli

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

Local Restoration for Trees and Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Traffic Management and Traffic Engineering for the Future Internet, 2008

2007

New Approaches for Virtual Private Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

The stable set problem and the thinness of a graph.

[BibT_eX]

[DOI]

Carlo Mannino

Federico Ricci-Tersenghi

L. Sunil Chandran

Oper. Res. Lett., 2007

Hardness of robust network design.

[BibT_eX]

[DOI]

Chandra Chekuri

F. Bruce Shepherd

Maria Grazia Scutellà

Networks, 2007

2006

Design of trees in the hose model: The balanced case.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Stefano Leonardi

Oper. Res. Lett., 2006

2005

On the cubicity of certain graphs.

[BibT_eX]

[DOI]

L. Sunil Chandran

Carlo Mannino

Inf. Process. Lett., 2005

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm.

[BibT_eX]

[DOI]

Photonic Netw. Commun., 2004

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2004

2003

An approximate A* algorithm and its application to the SCS problem.

[BibT_eX]

[DOI]

Gaia Nicosia

Theor. Comput. Sci., 2003

Reserving resilient capacity for a single commodity with upper-bound constraints.

[BibT_eX]

[DOI]

Graham R. Brightwell

F. Bruce Shepherd

Networks, 2003

Clique family inequalities for the stable set polytope of quasi-line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2001

Reserving Resilient Capacity in a Network.

[BibT_eX]

[DOI]

Graham R. Brightwell

F. Bruce Shepherd

SIAM J. Discret. Math., 2001

Clique Covers in Claw-Free Berge Graphs.

[BibT_eX]

[DOI]