Search the dblp DataBase

Publications of Author

1. David Avis, Caterina De Simone, Paolo Nobili
   Two Conjectures on the Chromatic Polynomial. [Citation Graph (0, 0)][DBLP]
   LATIN, 2000, pp:154-162 [Conf]
   
2. 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]
   
3. Caterina De Simone, Michael Jünger
   On the Two-connected Planar Spanning Subgraph Polytope. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:223-229 [Journal]
   
4. Caterina De Simone, János Körner
   On the Odd Cycles of Normal Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:161-169 [Journal]
   
5. Caterina De Simone, Antonio Sassano
   Stability Number of Bull- and Chair-Free Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:41, n:2, pp:121-129 [Journal]
   
6. David Avis, Caterina De Simone, Bruce A. Reed
   On the fractional chromatic index of a graph and its complement. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:385-388 [Journal]
   
7. Caterina De Simone, Célia Picinin de Mello
   Edge-colouring of join graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:355, n:3, pp:364-370 [Journal]
   
8. Caterina De Simone
   The cut polytope and the Boolean quadric polytope. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:79, n:1, pp:71-75 [Journal]
   
9. 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]
   
10. Caterina De Simone, Michel Deza, Monique Laurent
    Collapsing and lifting for the cut cone. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:105-130 [Journal]
    
11. 
    A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Stable set and clique polytopes of (P₅, gem)-free graphs. [Citation Graph (, )][DBLP]