Sfoglia per Autore
A new algorithm for the maximum weighted stable set problem in claw-free graphs
2008-01-01 Oriolo, G; Pietropaoli, U; Stauffer, G
A short proof of the VPN tree Routing conjecture on ring networks
2008-01-01 Grandoni, F; Oriolo, G; Kaibel, V; Skutella, M
The stable set polytope of quasi-line graphs
2008-01-01 Eisenbrand, F; Oriolo, G; Stauffer, G; Ventura, P
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm
2008-01-01 Sabella, R; Iovanna, P; Oriolo, G; Sanita, L
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
2008-01-01 Oriolo, G; Stauffer, G
Circular one matrices and the stable set polytope of quasi-line graphs
2008-01-01 Eisenbrand, F; Oriolo, G; Stauffer, G; Ventura, P
On coloring problems with local constraints
2009-01-01 Bonomo, F; Faenza, Y; Oriolo, G
On coloring problems with local constraints
2010-01-01 Bonomo, F; Faenza, Y; Oriolo, G
The hidden matching-structure of the composition of strips: a polyhedral perspective
2010-01-01 Faenza, Y; Oriolo, G; Stauffer, G
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
2010-01-01 Faenza, Y; Oriolo, G; Snels, C
Stable routing under the spanning tree protocol
2010-01-01 Grandoni, F; Nicosia, G; Oriolo, G; Sanità, L
The VPN problems with concave costs
2010-01-01 Fiorini, S; Oriolo, G; Sanita, L; Theis, D
An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem.
2011-01-01 Faenza, Y; Oriolo, G; Stauffer, G
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
2011-01-01 Faenza, Y; Oriolo, G; Snels, C
Apparatus and method for traffic routing
2011-10-12 Bottari, G; Iovanna, P; Oriolo, G
Minimum weighted clique cover on strip-composed perfect graphs
2012-01-01 Bonomo, F; Oriolo, G; Snels, C
On coloring problems with local constraints
2012-01-01 Bonomo, F; Faenza, Y; Oriolo, G
On the recognition of fuzzy circular interval graphs
2012-01-01 Oriolo, G; Pietropaoli, U; Stauffer, G
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
2012-01-01 Faenza, Y; Oriolo, G; Stauffer, G
Building topology in communications networks
2012-04-30 Iovanna, P; Oriolo, G; Zema, C
Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
---|---|---|---|---|
1-gen-2008 | A new algorithm for the maximum weighted stable set problem in claw-free graphs | Oriolo, G; Pietropaoli, U; Stauffer, G | Articolo su rivista | |
1-gen-2008 | A short proof of the VPN tree Routing conjecture on ring networks | Grandoni, F; Oriolo, G; Kaibel, V; Skutella, M | Articolo su rivista | |
1-gen-2008 | The stable set polytope of quasi-line graphs | Eisenbrand, F; Oriolo, G; Stauffer, G; Ventura, P | Articolo su rivista | |
1-gen-2008 | Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm | Sabella, R; Iovanna, P; Oriolo, G; Sanita, L | Articolo su rivista | |
1-gen-2008 | Clique-circulants and the stable set polytope of fuzzy circular interval graphs | Oriolo, G; Stauffer, G | Articolo su rivista | |
1-gen-2008 | Circular one matrices and the stable set polytope of quasi-line graphs | Eisenbrand, F; Oriolo, G; Stauffer, G; Ventura, P | Articolo su rivista | |
1-gen-2009 | On coloring problems with local constraints | Bonomo, F; Faenza, Y; Oriolo, G | Articolo su rivista | |
1-gen-2010 | On coloring problems with local constraints | Bonomo, F; Faenza, Y; Oriolo, G | Altro | |
1-gen-2010 | The hidden matching-structure of the composition of strips: a polyhedral perspective | Faenza, Y; Oriolo, G; Stauffer, G | Altro | |
1-gen-2010 | A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) | Faenza, Y; Oriolo, G; Snels, C | Altro | |
1-gen-2010 | Stable routing under the spanning tree protocol | Grandoni, F; Nicosia, G; Oriolo, G; Sanità, L | Articolo su rivista | |
1-gen-2010 | The VPN problems with concave costs | Fiorini, S; Oriolo, G; Sanita, L; Theis, D | Articolo su rivista | |
1-gen-2011 | An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem. | Faenza, Y; Oriolo, G; Stauffer, G | Intervento a convegno | |
1-gen-2011 | A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) | Faenza, Y; Oriolo, G; Snels, C | Articolo su rivista | |
12-ott-2011 | Apparatus and method for traffic routing | Bottari, G; Iovanna, P; Oriolo, G | Brevetti | |
1-gen-2012 | Minimum weighted clique cover on strip-composed perfect graphs | Bonomo, F; Oriolo, G; Snels, C | Intervento a convegno | |
1-gen-2012 | On coloring problems with local constraints | Bonomo, F; Faenza, Y; Oriolo, G | Articolo su rivista | |
1-gen-2012 | On the recognition of fuzzy circular interval graphs | Oriolo, G; Pietropaoli, U; Stauffer, G | Articolo su rivista | |
1-gen-2012 | Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs | Faenza, Y; Oriolo, G; Stauffer, G | Intervento a convegno | |
30-apr-2012 | Building topology in communications networks | Iovanna, P; Oriolo, G; Zema, C | Brevetti |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile