 | 2010 |
|---|
| 25 |       | Anna Galluccio,
Claudio Gentile,
Paolo Ventura:
The stable set polytope of claw-free graphs with large stability number.
Electronic Notes in Discrete Mathematics 36: 1025-1032 (2010) |
| 2009 |
|---|
| 24 | | Anna Galluccio,
Claudio Gentile,
M. Macina,
Paolo Ventura:
The k-Gear Composition and the Stable Set Polytope.
CTW 2009: 251-254 |
| 23 | | Caterina De Simone,
Anna Galluccio:
Edge-colouring of joins of regular graphs, I.
J. Comb. Optim. 18(4): 417-428 (2009) |
| 22 | | Anna Galluccio,
Claudio Gentile,
Paolo Ventura:
Gear Composition of Stable Set Polytopes and G-Perfection.
Math. Oper. Res. 34(4): 813-836 (2009) |
| 2008 |
|---|
| 21 | | Anna Galluccio,
Claudio Gentile,
Paolo Ventura:
On the Stable Set Polytope of Claw-Free Graphs.
COCOA 2008: 339-350 |
| 20 | | Caterina De Simone,
Anna Galluccio:
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.
COCOA 2008: 351-360 |
| 19 | | Anna Galluccio,
Claudio Gentile,
Paolo Ventura:
Gear composition and the stable set polytope.
Oper. Res. Lett. 36(4): 419-423 (2008) |
| 2007 |
|---|
| 18 | | Caterina De Simone,
Anna Galluccio:
Edge-colouring of regular graphs of large degree.
Theor. Comput. Sci. 389(1-2): 91-99 (2007) |
| 2006 |
|---|
| 17 | | Anna Galluccio,
Paolo Nobili:
Improved approximation of maximum vertex cover.
Oper. Res. Lett. 34(1): 77-84 (2006) |
| 2004 |
|---|
| 16 | | Michele Conforti,
Anna Galluccio,
Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices.
WG 2004: 355-364 |
| 2003 |
|---|
| 15 | | Anna Galluccio,
Guido Proietti:
Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.
Algorithmica 36(4): 361-374 (2003) |
| 2002 |
|---|
| 14 | | Anna Galluccio,
Guido Proietti:
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.
ISAAC 2002: 150-162 |
| 13 | | Anna Galluccio,
Luis A. Goddyn:
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.
Combinatorica 22(3): 455-459 (2002) |
| 2001 |
|---|
| 12 | | Anna Galluccio,
Guido Proietti:
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.
ISAAC 2001: 345-354 |
| 11 | | Anna Galluccio,
Luis A. Goddyn,
Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite.
J. Comb. Theory, Ser. B 83(1): 1-14 (2001) |
| 2000 |
|---|
| 10 | | Anna Galluccio,
Pavol Hell,
Jaroslav Nesetril:
The complexity of H-colouring of bounded degree graphs.
Discrete Mathematics 222(1-3): 101-109 (2000) |
| 1999 |
|---|
| 9 | | Anna Galluccio,
Martin Loebl:
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents.
Electr. J. Comb. 6: (1999) |
| 8 | | Anna Galluccio,
Martin Loebl:
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration.
Electr. J. Comb. 6: (1999) |
| 1998 |
|---|
| 7 | | Anna Galluccio,
Martin Loebl:
Even Directed Cycles in H-Free Digraphs.
J. Algorithms 27(1): 26-41 (1998) |
| 1997 |
|---|
| 6 | | Paola Bertolazzi,
Caterina De Simone,
Anna Galluccio:
A Nice Class for the Vertex Packing Problem.
Discrete Applied Mathematics 76(1-3): 3-19 (1997) |
| 5 | | Anna Galluccio,
Antonio Sassano:
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
J. Comb. Theory, Ser. B 69(1): 1-38 (1997) |
| 1996 |
|---|
| 4 | | Anna Galluccio,
Martin Loebl:
Cycles of Prescribed Modularity in Planar Digraphs.
J. Algorithms 21(1): 51-70 (1996) |
| 1994 |
|---|
| 3 | | Caterina De Simone,
Anna Galluccio:
New classes of Berge perfect graphs.
Discrete Mathematics 131(1-3): 67-79 (1994) |
| 2 | | Anna Galluccio,
Luisa Gargano,
János Körner,
Gábor Simonyi:
Different capacities of a digraph.
Graphs and Combinatorics 10(2-4): 105-121 (1994) |
| 1993 |
|---|
| 1 |  | Anna Galluccio,
Martin Loebl:
Cycles of prescribed modularity in planar digraphs.
IPCO 1993: 113-127 |
Data released under the ODC-BY 1.0 license — See also our legal information page