The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anna Galluccio: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anna Galluccio, Martin Loebl
    Cycles of prescribed modularity in planar digraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:113-127 [Conf]
  2. Anna Galluccio, Guido Proietti
    Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:345-354 [Conf]
  3. Anna Galluccio, Guido Proietti
    A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:150-162 [Conf]
  4. Michele Conforti, Anna Galluccio, Guido Proietti
    Edge-Connectivity Augmentation and Network Matrices. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:355-364 [Conf]
  5. Anna Galluccio, Guido Proietti
    Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:361-374 [Journal]
  6. Anna Galluccio, Luis A. Goddyn
    The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:455-459 [Journal]
  7. Anna Galluccio, Martin Loebl
    On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  8. Anna Galluccio, Martin Loebl
    On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  9. Paola Bertolazzi, Caterina De Simone, Anna Galluccio
    A Nice Class for the Vertex Packing Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:76, n:1-3, pp:3-19 [Journal]
  10. Anna Galluccio, Pavol Hell, Jaroslav Nesetril
    The complexity of H-colouring of bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:101-109 [Journal]
  11. Anna Galluccio, Martin Loebl
    Cycles of Prescribed Modularity in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:51-70 [Journal]
  12. Anna Galluccio, Martin Loebl
    Even Directed Cycles in H-Free Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:1, pp:26-41 [Journal]
  13. Anna Galluccio, Luis A. Goddyn, Pavol Hell
    High-Girth Graphs Avoiding a Minor are Nearly Bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:1, pp:1-14 [Journal]
  14. Anna Galluccio, Antonio Sassano
    The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:1, pp:1-38 [Journal]
  15. Anna Galluccio, Paolo Nobili
    Improved approximation of maximum vertex cover. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:77-84 [Journal]
  16. Caterina De Simone, Anna Galluccio
    New classes of Berge perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:67-79 [Journal]

  17. A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs. [Citation Graph (, )][DBLP]


  18. On the Stable Set Polytope of Claw-Free Graphs. [Citation Graph (, )][DBLP]


  19. The k-Gear Composition and the Stable Set Polytope. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002