Anna Galluccio

Electron. Notes Discret. Math., 2010

2009

Gear Composition of Stable Set Polytopes and G-Perfection.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Edge-colouring of joins of regular graphs, I.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

The k-Gear Composition and the Stable Set Polytope.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Gear composition and the stable set polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

On the Stable Set Polytope of Claw-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Edge-colouring of regular graphs of large degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

2006

Improved approximation of maximum vertex cover.

[BibT_eX]

[DOI]

Paolo Nobili

Oper. Res. Lett., 2006

2004

Edge-Connectivity Augmentation and Network Matrices.

[BibT_eX]

[DOI]

Michele Conforti

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems.

[BibT_eX]

[DOI]

Algorithmica, 2003

2002

The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.

[BibT_eX]

[DOI]

Luis A. Goddyn

Comb., 2002

A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Optimization via enumeration: a new algorithm for the Max Cut Problem.

[BibT_eX]

[DOI]

Jan Vondrák

Math. Program., 2001

High-Girth Graphs Avoiding a Minor are Nearly Bipartite.

[BibT_eX]

[DOI]

Luis A. Goddyn

Pavol Hell

J. Comb. Theory, Ser. B, 2001

Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

The complexity of H-colouring of bounded degree graphs.

[BibT_eX]

[DOI]

Pavol Hell

Jaroslav Nesetril

Discret. Math., 2000

1999

On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

1998

Even Directed Cycles in H-Free Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1998

1997

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.

[BibT_eX]

[DOI]

Antonio Sassano

J. Comb. Theory, Ser. B, 1997

A Nice Class for the Vertex Packing Problem.

[BibT_eX]

[DOI]

Paola Bertolazzi

Discret. Appl. Math., 1997

1996

(p, q)-odd digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Cycles of Prescribed Modularity in Planar Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 1996

1994

Different capacities of a digraph.

[BibT_eX]

[DOI]

Graphs Comb., 1994

New classes of Berge perfect graphs.

[BibT_eX]

[DOI]