Anna Galluccio
Anna Galluccio Anna Galluccio
Senior Researcher

Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti"
Via dei Taurini, 19
00185 Roma - Italy

Office n. 506
Tel.: +39 06 4993 7116
Fax: +39 06 4993 7137
Personal web page: http://www.iasi.cnr.it/~galluccio/Papers
email

Research interests

graph theory, combinatorial optimization, algorithms


Research groups

Selected publications
  • Anna Galluccio, Claudio Gentile: The stable set polytope of icosahedral graphs, Discrete Mathematics 339, 614-625, 2016
  • Apollonio N., Anna Galluccio: Minimally unbalanced diamond-free graphs and Dyck-paths, SIAM Journal on Discrete Mathematics, 2015
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: A note on the stable set prolytope of three-cliqued graphs, IASI-CNR, R. 15-04, 2015
  • 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
  • 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
  • Caterina De Simone, Anna Galluccio: Edge-colouring of joins of regular graphs II, Journal of Combinatorial Optimization 25, 78-90, 2013
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: 2-clique-bond of stable set polyhedra, Discrete Applied Mathematics 161, 1988-2000, 2013
  • 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
  • Caterina De Simone, Anna Galluccio: Edge-colouring of joins of regular graphs II, Journal of Combinatorial Optimization, DOI.101007/s10878-011-9420-4, 2011
  • Caterina De Simone, Anna Galluccio: Edge-colouring of joins of regular graphs, II, IASI-CNR, R. 10-24, 2010
  • 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
  • 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, IASI-CNR, R. 10-06, 7/2010
  • 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, IASI-CNR, R. 10-07, 7/2010
  • Caterina De Simone, Anna Galluccio: Edge-colouring of joins of regular graphs, I, Journal of Combinatorial Optimization 18, 417-428, 2009
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: 2-clique-bond of stable set polyhedra, IASI-CNR, R. 09-10, 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
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs I: XX-strip composition versus gear composition, IASI-CNR, R. 09-05, 2009
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs II: XX-graphs are G-perfect, IASI-CNR, R. 09-08, 2009
  • Caterina De Simone, Anna Galluccio: A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs, in: Combinatorial optimization and applications, Lecture Notes in Computer Science, 5165, 351-360, 2008
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: Gear composition and the Stable Set Polytope, Operations Research Letters 36, 419-423, 2008
  • Anna Galluccio, Claudio Gentile, Paolo Ventura: On the stable set polytope of claw-free graphs, in: COCOA 2008, Lecture Notes in Computer Science, 5165, 339-350, 2008
  • Caterina De Simone, Anna Galluccio: Edge colouring of regular graphs of large degree, Theoretical Computer Science 389, 91-99, 2007
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2006
  • Anna Galluccio, Nobili P.: Improved approximation of Maximum Vertex Cover, Operations Research Letters 34, 77-84, 2005
  • Conforti M., Anna Galluccio, Guido Proietti: Edge-connectivity augmentation and network matrices, in: Graph-Theoretic Concepts in Computer Science, Hromkovic J., Nagl M., Westfechtel B. eds., Lecture Notes in Computer Science, 3353, 355-364, 2004
  • Anna Galluccio, Nobili P.: A (1-1/2Q) - Approximation algorithm for max vertex cover in clique-coverable graphs, IASI-CNR, R. 611, 6/2004
  • Lukic J., Anna Galluccio, Marinari E., Martin O.C., Giovanni Rinaldi: Critical Thermodynamics of the Two-Dimensional +/-J Ising Spin Glass, Physical Review Letters 92 (11), 117202-117205, 2004
  • Conforti M., Anna Galluccio, Guido Proietti: Augmentation problems and network matrices, IASI-CNR, R. 583, 2003
  • Anna Galluccio, Guido Proietti: Polynomial time algorithms for 2-edge-connectivity augmentation problems, Algorithmica 36, 361-374, 2003
  • 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
  • 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 2-edge-connectivity augmentation problems, IASI-CNR, R. 556, 10/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, Hell P., Nešetřil J.: The complexity of $H$-colouring of bounded degree graphs, Discrete Mathematics 222, 101-109, 2000
  • Anna Galluccio, Loebl M., Vondřak J.: A new algorithm for the Ising problem: partition function for finite lattice graphs, Physical Review Letters 84, 5924-5927, 2000
  • Anna Galluccio, Goddyn L.A., Hell P.: High girth graphs avoiding a minor are nearly bipartite, IASI-CNR, R. 509, 09/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
  • Anna Galluccio, Loebl M.: A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents, Journal of Combinatorics 6 (1), 1999
  • Anna Galluccio, Loebl M., Vondřak J.: Optimization via enumeration: a new algorithm for the max cut problem, IASI-CNR, R. 507, 7/1999
  • Anna Galluccio, Guido Proietti: Towards a 4/3-approximation algorithm for biconnectivity, IASI-CNR, R. 506, 06/1999
  • Anna Galluccio, Hell P., Nešetřil J.: The complexity of H-colouring of bounded degree graphs, IASI-CNR, R. 482, 11/1998
  • Anna Galluccio, Loebl M.: Even directed cycles in $H$-free graphs, Journal of Algorithms 27, 26-41, 1998
  • Anna Galluccio, Loebl M.: Max cut in toroidal graphs, IASI-CNR, R. 471, 10/1998
  • Anna Galluccio, Loebl M.: On the theory of Pfaffian orientations II: T-joins, K-cuts, and duality of enumeration, IASI-CNR, R. 474, 10/1998
  • Paola Bertolazzi, Caterina De Simone, Anna Galluccio: A Nice Class for the Vertex Packing Problem, Discrete Applied Mathematics 76, 3-19, 1997
  • Anna Galluccio, Loebl M.: A theory of Pfaffian operations : 1. Perfect matchings and permanents, IASI-CNR, R. 452, 04/1997
  • Anna Galluccio, Sassano A.: The rank facets of the stable set polytope for claw-free graphs, Journal of Combinatorial Theory Series B, 1-38, 1997
  • Anna Galluccio, Loebl M.: Cycles of binary matroids with no F*_7 -minor, IASI-CNR, R. 431, 05/1996
  • Anna Galluccio, Loebl M.: Cycles of prescribed modularity in planar digraphs, Journal of Algorithms 21, 50-71, 1996
  • Anna Galluccio, Loebl M.: Even cycles and H-Homeomorphisms, IASI-CNR, R. 424, 12/1995
  • Anna Galluccio, Loebl M.: Even directed cycles in H-free digraphs, IASI-CNR, R. 410, 07/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
  • Caterina De Simone, Anna Galluccio: New Classes of Berge Perfect Graphs, Discrete Mathematics 131, 67-79, 1994
  • Anna Galluccio, Gargano L., Körner J., Simonyi G.: Different capacities of a digraph, Graphs and Combinatorics 10, 105-121, 1994
  • Anna Galluccio, Loebl M.: (p,q)-odd digraphs, IASI-CNR, R. 386, 09/1994
  • Anna Galluccio, Loebl M.: Even/odd dipaths in planar digraphs, Optimization Methods & Software 3, 225-236, 1994
  • Paola Bertolazzi, Caterina De Simone, Anna Galluccio: A nice class for the vertex packing problem, IASI-CNR, R. 358, 05/1993
  • Anna Galluccio, Gargano L., Simonyi G., Körner J.: Waterfalls, antichains and capacities of digraphs, IASI-CNR, R. 357, 5/1993
  • Anna Galluccio, Loebl M.: Cycles of prescribed modularity in planar digraphs, IASI-CNR, R. 355, 03/1993
  • Anna Galluccio, Loebl M.: Paths/cycles of prescribed parity in planar digraphs., IASI-CNR, R. 326, 10/1991
  • Caterina De Simone, Anna Galluccio: New classes of Berge perfect graphs., IASI-CNR, R. 306, 10/1990
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -