CNR Institutional Research Information System

GALLUCCIO, ANNA

GALLUCCIO, ANNA  

Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI  

Mostra records
Risultati 1 - 20 di 33 (tempo di esecuzione: 0.009 secondi).
Titolo Data di pubblicazione Autore(i) File
The stable set polytope of icosahedral graphs 1-gen-2016 Galluccio, A; Gentile, C
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths 1-gen-2015 Apollonio, Nicola; Galluccio, Anna
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect 1-gen-2014 Galluccio, A.; Gentile, C.; Ventura, P.
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect 1-gen-2014 Galluccio, A; Gentile, C; Ventura, P
2-clique-bond of stable set polyhedra 1-gen-2013 Galluccio, A; Gentile, C; Ventura, P
Edge-coloring of joins of regular graphs II 1-gen-2013 DE SIMONE, Caterina; Galluccio, Anna
Edge-colouring of joins of regular graphs II 1-gen-2011 De Simone, C; Galluccio, A
The stable set polytope of claw-free graphs with large stability number 1-gen-2010 Galluccio, A.; Gentile, C.; Ventura, P.
Edge-colouring of joins of regular graphs, I 1-gen-2009 De Simone, C.; Galluccio, A.
Gear Composition of stable set polytopes and G-perfection 1-gen-2009 Galluccio, A; Gentile, C; Ventura, P
Gear composition and the Stable Set Polytope 1-gen-2008 Galluccio, A; Gentile, C; Ventura, P
On the stable set polytope of claw-free graphs 1-gen-2008 Galluccio, A.; Gentile, C.; Ventura, P.
Edge colouring of regular graphs of large degree 1-gen-2007 De Simone, C; Galluccio, A
Improved approximation of Maximum Vertex Cover 1-gen-2006 Galluccio, A.; Nobili, P.
Critical Thermodynamics of the Two-Dimensional ±J Ising Spin Glass 1-gen-2004 Lukic, J; Galluccio, A; Marinari, E; Martin, Oc; Rinaldi, G
Edge-connectivity augmentation and network matrices 1-gen-2004 Conforti, M; Galluccio, A; Proietti, G
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems 1-gen-2003 Galluccio, A.; Proietti, G.
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation 1-gen-2002 Galluccio, A; Proietti, G
The circular flow number of a 6-edge-connected graph is less than four 1-gen-2002 Galluccio, A; Goddyn, L
High-girth graphs avoiding a minor are nearly bipartite 1-gen-2001 Galluccio, A.; Goddyn, L.A.; Hell, P.