Anna Galluccio

According to our database1, Anna Galluccio authored at least 33 papers between 1994 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
The stable set polytope of icosahedral graphs.
Discret. Math., 2016

2015
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths.
SIAM J. Discret. Math., 2015

2014
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect.
J. Comb. Theory B, 2014

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect.
J. Comb. Theory B, 2014

2013
Edge-colouring of joins of regular graphs II.
J. Comb. Optim., 2013

22-clique-bond of stable set polyhedra.
Discret. Appl. Math., 2013

2011
The stable set polytope of claw-free graphs with stability number greater than three.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
The stable set polytope of claw-free graphs with large stability number.
Electron. Notes Discret. Math., 2010

2009
Gear Composition of Stable Set Polytopes and G-Perfection.
Math. Oper. Res., 2009

Edge-colouring of joins of regular graphs, I.
J. Comb. Optim., 2009

The k-Gear Composition and the Stable Set Polytope.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Gear composition and the stable set polytope.
Oper. Res. Lett., 2008

A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

On the Stable Set Polytope of Claw-Free Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Edge-colouring of regular graphs of large degree.
Theor. Comput. Sci., 2007

2006
Improved approximation of maximum vertex cover.
Oper. Res. Lett., 2006

2004
Edge-Connectivity Augmentation and Network Matrices.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
Algorithmica, 2003

2002
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.
Comb., 2002

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Optimization via enumeration: a new algorithm for the Max Cut Problem.
Math. Program., 2001

High-Girth Graphs Avoiding a Minor are Nearly Bipartite.
J. Comb. Theory B, 2001

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
The complexity of <i>H</i>-colouring of bounded degree graphs.
Discret. Math., 2000

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

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents.
Electron. J. Comb., 1999

1998
Even Directed Cycles in <i>H</i>-Free Digraphs.
J. Algorithms, 1998

1997
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
J. Comb. Theory B, 1997

A Nice Class for the Vertex Packing Problem.
Discret. Appl. Math., 1997

1996
(<i>p, q</i>)-odd digraphs.
J. Graph Theory, 1996

Cycles of Prescribed Modularity in Planar Digraphs.
J. Algorithms, 1996

1994
Different capacities of a digraph.
Graphs Comb., 1994

New classes of Berge perfect graphs.
Discret. Math., 1994


  Loading...