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 Articles in Journals, Collections and Proceedings (or show them all):   (Items found: 39)

2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994
2016  [top]
2015  [top]
  • Apollonio N., Anna Galluccio: Minimally unbalanced diamond-free graphs and Dyck-paths, SIAM Journal on Discrete Mathematics, 2015
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]
  • De Simone C., Anna Galluccio: Edge-colouring of joins of regular graphs II, Journal of Combinatorial Optimization, DOI.101007/s10878-011-9420-4, 2011
2010  [top]
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with large stability number, Electronic Notes in Discrete Mathematics, ISCO 2010 International Symposium on Combinatorial Optimization, 2010
2009  [top]
  • De Simone C., Anna Galluccio: Edge-colouring of joins of regular graphs, I, Journal of Combinatorial Optimization 18, 417-428, 2009
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: Gear Composition of stable set polytopes and G-perfection, Mathematics of Operations Research 34, 813-836, 2009
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The k-gear composition and the stable set polytope, in the Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, June 2-4, Liberti L., Cafieri S., Mucherino A., Nannicini G., Tarissan F. eds., 2009
2008  [top]
2007  [top]
2006  [top]
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2006
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
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
2000  [top]
1999  [top]
  • Anna Galluccio, Loebl M.: A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents, Journal of Combinatorics 6 (1), 1999
  • Anna Galluccio, Loebl M.: A Theory of Pfaffian Orientations II: T-joins, $k$-cuts, and Duality of enumeration, Electronic Journal of Combinatorics 6 (1), 1999
1998  [top]
1997  [top]
1996  [top]
  • Anna Galluccio, Loebl M.: Cycles of prescribed modularity in planar digraphs, Journal of Algorithms 21, 50-71, 1996
1995  [top]
  • 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]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -