Caterina De Simone

Affiliations:
  • National Research Council, Italy


According to our database1, Caterina De Simone authored at least 18 papers between 1990 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Edge-colouring of joins of regular graphs II.
J. Comb. Optim., 2013

2009
Edge-colouring of joins of regular graphs, I.
J. Comb. Optim., 2009

2008
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Edge-colouring of regular graphs of large degree.
Theor. Comput. Sci., 2007

Stable set and clique polytopes of (P<sub>5</sub>, gem)-free graphs.
Discret. Math., 2007

2006
Edge-colouring of join graphs.
Theor. Comput. Sci., 2006

2005
On the fractional chromatic index of a graph and its complement.
Oper. Res. Lett., 2005

2002
On the chromatic polynomial of a graph.
Math. Program., 2002

2000
Two Conjectures on the Chromatic Polynomial.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
On the Odd Cycles of Normal Graphs.
Discret. Appl. Math., 1999

1997
On the Two-connected Planar Spanning Subgraph Polytope.
Discret. Appl. Math., 1997

A Nice Class for the Vertex Packing Problem.
Discret. Appl. Math., 1997

1996
A note on the Boolean quadric polytope.
Oper. Res. Lett., 1996

1994
New classes of Berge perfect graphs.
Discret. Math., 1994

Collapsing and lifting for the cut cone.
Discret. Math., 1994

1993
Stability Number of Bull- and Chair-Free Graphs.
Discret. Appl. Math., 1993

1990
Fair dissections of spiders, worms, and caterpillars.
Networks, 1990

The cut polytope and the Boolean quadric polytope.
Discret. Math., 1990


  Loading...