New classes of Berge perfect graphs. - Caterina De Simone; Anna Galluccio (Discret. Math., 1994)

Different capacities of a digraph. - Anna Galluccio; Luisa Gargano; János Körner; Gábor Simonyi (Graphs Comb., 1994)

Cycles of Prescribed Modularity in Planar Digraphs. - Anna Galluccio; Martin Loebl (J. Algorithms, 1996)

(p, q)-odd digraphs. - Anna Galluccio; Martin Loebl (J. Graph Theory, 1996)

A Nice Class for the Vertex Packing Problem. - Paola Bertolazzi; Caterina De Simone; Anna Galluccio (Discret. Appl. Math., 1997)

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. - Anna Galluccio; Antonio Sassano (J. Comb. Theory B, 1997)

Even Directed Cycles in H-Free Digraphs. - Anna Galluccio; Martin Loebl (J. Algorithms, 1998)

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. - Anna Galluccio; Martin Loebl (Electron. J. Comb., 1999)

On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. - Anna Galluccio; Martin Loebl (Electron. J. Comb., 1999)

The complexity of H-colouring of bounded degree graphs. - Anna Galluccio; Pavol Hell; Jaroslav Nesetril (Discret. Math., 2000)

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. - Anna Galluccio; Guido Proietti (ISAAC, 2001)

High-Girth Graphs Avoiding a Minor are Nearly Bipartite. - Anna Galluccio; Luis A. Goddyn; Pavol Hell (J. Comb. Theory B, 2001)

Optimization via enumeration: a new algorithm for the Max Cut Problem. - Anna Galluccio; Martin Loebl; Jan Vondrák (Math. Program., 2001)

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. - Anna Galluccio; Guido Proietti (ISAAC, 2002)

The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. - Anna Galluccio; Luis A. Goddyn (Comb., 2002)

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. - Anna Galluccio; Guido Proietti (Algorithmica, 2003)

Edge-Connectivity Augmentation and Network Matrices. - Michele Conforti; Anna Galluccio; Guido Proietti (WG, 2004)

Improved approximation of maximum vertex cover. - Anna Galluccio; Paolo Nobili (Oper. Res. Lett., 2006)

Edge-colouring of regular graphs of large degree. - Caterina De Simone; Anna Galluccio (Theor. Comput. Sci., 2007)

On the Stable Set Polytope of Claw-Free Graphs. - Anna Galluccio; Claudio Gentile; Paolo Ventura (COCOA, 2008)

A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs. - Caterina De Simone; Anna Galluccio (COCOA, 2008)

Gear composition and the stable set polytope. - Anna Galluccio; Claudio Gentile; Paolo Ventura (Oper. Res. Lett., 2008)

The k-Gear Composition and the Stable Set Polytope. - Anna Galluccio; Claudio Gentile; M. Macina; Paolo Ventura (CTW, 2009)

Edge-colouring of joins of regular graphs, I. - Caterina De Simone; Anna Galluccio (J. Comb. Optim., 2009)

Gear Composition of Stable Set Polytopes and G-Perfection. - Anna Galluccio; Claudio Gentile; Paolo Ventura (Math. Oper. Res., 2009)

The stable set polytope of claw-free graphs with large stability number. - Anna Galluccio; Claudio Gentile; Paolo Ventura (Electron. Notes Discret. Math., 2010)

The stable set polytope of claw-free graphs with stability number greater than three. - Anna Galluccio; Claudio Gentile; Paolo Ventura (OR, 2011)

22-clique-bond of stable set polyhedra. - Anna Galluccio; Claudio Gentile; Paolo Ventura (Discret. Appl. Math., 2013)

Edge-colouring of joins of regular graphs II. - Caterina De Simone; Anna Galluccio (J. Comb. Optim., 2013)

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect. - Anna Galluccio; Claudio Gentile; Paolo Ventura (J. Comb. Theory B, 2014)

The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect. - Anna Galluccio; Claudio Gentile; Paolo Ventura (J. Comb. Theory B, 2014)

Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths. - Nicola Apollonio; Anna Galluccio (SIAM J. Discret. Math., 2015)

The stable set polytope of icosahedral graphs. - Anna Galluccio; Claudio Gentile (Discret. Math., 2016)