Publications of Anna Galluccio

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Galluccio A., in the category ALL (or show them all):   (Items found: 77)


2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1991 | 1990 | 1988

2016  [top]

2015  [top]

2014  [top]
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect, Journal of Combinatorial Theory Series B 108, 1-28, 2014
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect, Journal of Combinatorial Theory Series B 107, 92-122, 2014

2013  [top]

2012  [top]
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with stability number greater than three, in: Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Schmedders K., Luethi H.-J., Klatte D. eds., Operations Research Proceedings, Springer Heidelberg Germania, 47-52, 2012

2011  [top]

2010  [top]

2009  [top]

2008  [top]

2007  [top]

2006  [top]

2005  [top]
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2005

2004  [top]

2003  [top]

2002  [top]
  • Anna Galluccio, Goddyn L.A.: The circular flow number of a 6-edge-connected graph is less than four, Combinatorica 22, 455-459, 2002
  • Anna Galluccio, Guido Proietti: A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation, in: Proc. 13th Annual International Symposium on Algorithms and Computation (ISAAC'02), Lecture Notes in Computer Science, 2518, Springer-Verlag, 150-162, 2002
  • Anna Galluccio, Pêcher A.: On the circular chromatic number of partitionable graphs, IASI-CNR, R. 566, 04/2002

2001  [top]
  • Anna Galluccio: Optimization via Enumeration: Pfaffian method for Max Cut and for Ising problem, in the Proceedings of Algorithmic Techniques in Physics, 2001
  • Anna Galluccio, Goddyn L.A., Hell P.: High-girth graphs avoiding a minor are nearly bipartite, Journal of Combinatorial Theory Series B 83, 1-14, 2001
  • Anna Galluccio, Loebl M., Vondřak J.: Optimization via enumeration: a new algorithm for the Max Cut problem, Mathematical Programming 90, 273-290, 2001
  • Anna Galluccio, Guido Proietti: Polynomial-time algorithms for edge-connectivity augmentation of Hamiltonian paths, Lecture Notes in Computer Science, 2223, Springer-Verlag, 345-354, 2001
  • Anna Galluccio, Guido Proietti: Polynomial time algorithms for 2-edge-connectivity augmentation problems, IASI-CNR, R. 556, 10/2001

2000  [top]

1999  [top]

1998  [top]

1997  [top]

1996  [top]

1995  [top]
  • Anna Galluccio, Loebl M.: Even directed cycles in H-free digraphs, IASI-CNR, R. 410, 07/1995
  • Anna Galluccio, Loebl M.: Even cycles and H-Homeomorphisms, IASI-CNR, R. 424, 12/1995
  • Anna Galluccio, Simonyi G., Simonovits M.: On the structure of co-critical graphs, in: Seventh International Conference in Graph Theory, Combinatorics, Algorithms and Applications, Alavi Y., Schwenk A. eds., J. Wiley and Sons, 1053-1069, 1995

1994  [top]

1993  [top]

1991  [top]

1990  [top]

1988  [top]
  • Anna Galluccio, Sassano A.: A min-max relation for the stability number in claw-free graphs I: kite-systems., IASI-CNR, R. 235, 09/1988
  • Anna Galluccio, Sassano A.: A min-max relation for the stability number in claw-free graphs II: 2-reducible graphs., IASI-CNR, R. 236, 09/1988
  • Anna Galluccio, Sassano A.: An algorithm for vertex packing in claw-free graphs., IASI-CNR, R. 240, 11/1988
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -