Anna Galluccio

发表

The k-Gear Composition and the Stable Set Polytope.

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2009 .

Different capacities of a digraph

János Körner, Anna Galluccio, Luisa Gargano, 1994, Graphs Comb..

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems

Guido Proietti, Anna Galluccio, A. Galluccio, 2003, Algorithmica.

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2014, J. Comb. Theory B.

New classes of Berge perfect graphs

Caterina De Simone, Anna Galluccio, C. Simone, 1994, Discret. Math..

Towards a 4/3-approximation algorithm for biconnectivity

Guido Proietti, Anna Galluccio, 1999 .

Gear composition and the stable set polytope

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2008, Oper. Res. Lett..

(p, Q)-odd Digraphs

Martin Loebl, Anna Galluccio, A. Galluccio, 1996, J. Graph Theory.

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths

Guido Proietti, Anna Galluccio, A. Galluccio, 2001, ISAAC.

Augmentation problems and network matrices

Guido Proietti, Michele Conforti, Anna Galluccio, 2003 .

The stable set polytope of claw-free graphs with stability number greater than three

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2011, OR.

22-clique-bond of Stable Set Polyhedra

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2013, Discret. Appl. Math..

Optimization via enumeration: a new algorithm for the Max Cut Problem

Jan Vondrák, Martin Loebl, Anna Galluccio, 2001, Math. Program..

A Nice Class for the Vertex Packing Problem

Caterina De Simone, Paola Bertolazzi, Anna Galluccio, 1997, Discret. Appl. Math..

The stable set polytope of icosahedral graphs

Claudio Gentile, Anna Galluccio, C. Gentile, 2016, Discret. Math..

High-Girth Graphs Avoiding a Minor are Nearly Bipartite

Pavol Hell, Luis A. Goddyn, Anna Galluccio, 2001, J. Comb. Theory, Ser. B.

On the Stable Set Polytope of Claw-Free Graphs

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2008, COCOA.

Even Directed Cycles in H-Free Digraphs

Martin Loebl, Anna Galluccio, 1998, J. Algorithms.

Edge-colouring of joins of regular graphs II

Caterina De Simone, Anna Galluccio, C. Simone, 2013, J. Comb. Optim..

The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four

Luis A. Goddyn, Anna Galluccio, 2002, Comb..

The stable set polytope of claw-free graphs with large stability number

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2010, Electron. Notes Discret. Math..

The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2014, J. Comb. Theory B.

The complexity of H-colouring of bounded degree graphs

Jaroslav Nesetril, Pavol Hell, Anna Galluccio, 2000, Discret. Math..

Edge-colouring of joins of regular graphs, I

Caterina De Simone, Anna Galluccio, 2009, J. Comb. Optim..

Gear Composition of Stable Set Polytopes and G-Perfection

Claudio Gentile, Paolo Ventura, Anna Galluccio, 2009, Math. Oper. Res..

Cycles of Prescribed Modularity in Planar Digraphs

Martin Loebl, Anna Galluccio, A. Galluccio, 1996, J. Algorithms.

Edge-colouring of regular graphs of large degree

Caterina De Simone, Anna Galluccio, C. Simone, 2007, Theor. Comput. Sci..

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation

Guido Proietti, Anna Galluccio, 2002, ISAAC.

Improved approximation of maximum vertex cover

Paolo Nobili, Anna Galluccio, 2006, Oper. Res. Lett..

A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs

Caterina De Simone, Anna Galluccio, C. Simone, 2008, COCOA.

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs

Antonio Sassano, Anna Galluccio, A. Sassano, 1997, J. Comb. Theory, Ser. B.

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents

Martin Loebl, Anna Galluccio, A. Galluccio, 1998, Electron. J. Comb..

On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration

Martin Loebl, Anna Galluccio, A. Galluccio, 1998, Electron. J. Comb..

Edge-Connectivity Augmentation and Network Matrices

Guido Proietti, Michele Conforti, Anna Galluccio, 2004, WG.

Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths pdf

Nicola Apollonio, Anna Galluccio, 2015, SIAM J. Discret. Math..

( P,Q )-odd digraphs

Martin Loebl, Anna Galluccio, 1996 .

Max cut in toroidal graphs

Martin Loebl, Anna Galluccio, 1998 .

Even/odd dipaths in planar digraphs

Martin Loebl, Anna Galluccio, 1994 .

Cycles of binary matroids with no F*_7 -minor

Martin Loebl, Anna Galluccio, 1996 .