|
Search the dblp DataBase
Gianpaolo Oriolo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1151-1162 [Conf]
- Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. [Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:291-305 [Conf]
- L. Sunil Chandran, Carlo Mannino, Gianpaolo Oriolo
On the cubicity of certain graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:94, n:3, pp:113-118 [Journal]
- Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
Design of trees in the hose model: The balanced case. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:6, pp:601-606 [Journal]
- Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, Sunil Chandran
The stable set problem and the thinness of a graph. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2007, v:35, n:1, pp:1-9 [Journal]
- Gaia Nicosia, Gianpaolo Oriolo
An approximate A* algorithm and its application to the SCS problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:290, n:3, pp:2021-2029 [Journal]
- Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
New Approaches for Virtual Private Network Design. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:706-721 [Journal]
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. [Citation Graph (, )][DBLP]
Local Restoration for Trees and Arborescences. [Citation Graph (, )][DBLP]
The stable set polytope of quasi-line graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|