Search the dblp DataBase

Publications of Author

1. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
   New Graph Classes of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
   WG, 2002, pp:57-67 [Conf]
   
2. Van Bang Le, Raffaele Mosca, Haiko Müller
   On Stable Cutsets in Claw-Free Graphs and Planar Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:163-174 [Conf]
   
3. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
   Chordal co-gem-free and (P₅, gem)-free graphs have bounded clique-width. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:145, n:2, pp:232-241 [Journal]
   
4. Andreas Brandstädt, Raffaele Mosca
   On variations of P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:521-532 [Journal]
   
5. Andreas Brandstädt, Raffaele Mosca
   On the structure and stability number of P₅- and co-chair-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:47-65 [Journal]
   
6. Vadim V. Lozin, Raffaele Mosca
   Independent sets in extensions of 2K₂-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:146, n:1, pp:74-80 [Journal]
   
7. Raffaele Mosca
   Some results on maximum stable sets in certain P₅-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:175-183 [Journal]
   
8. Raffaele Mosca
   Stable Sets in Certain P₆-free Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:177-191 [Journal]
   
9. Claudio Arbib, Raffaele Mosca
   On (P₅, diamond)-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:250, n:1-3, pp:1-22 [Journal]
   
10. Vadim V. Lozin, Raffaele Mosca
    Polar graphs and maximal independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2901-2908 [Journal]
    
11. Raffaele Mosca
    A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:517-528 [Journal]
    
12. Raffaele Mosca
    A Shy Invariant of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:367-379 [Journal]
    
13. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
    Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:163-185 [Journal]
    
14. Raffaele Mosca
    Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:3, pp:137-143 [Journal]
    
15. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
    New Graph Classes of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:5, pp:623-645 [Journal]
    
16. 
    On Distance-3 Matchings and Induced Matchings. [Citation Graph (, )][DBLP]
    
    
17. 
    Independent Sets of Maximum Weight in Apple-Free Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    On Independent Vertex Sets in Subclasses of Apple-Free Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Stable set and clique polytopes of (P₅, gem)-free graphs. [Citation Graph (, )][DBLP]
    
    
20. 
    Stable sets of maximum weight in (P₇, banner)-free graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    The stable set polytope for some extensions of P₄-free graphs. [Citation Graph (, )][DBLP]