The SCEAS System
| |||||||

## Search the dblp DataBase
Raffaele Mosca:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
**Chordal co-gem-free and (**[Citation Graph (0, 0)][DBLP]*P*_{5}, gem)-free graphs have bounded clique-width. Discrete Applied Mathematics, 2005, v:145, n:2, pp:232-241 [Journal] - Andreas Brandstädt, Raffaele Mosca
**On variations of P**[Citation Graph (0, 0)][DBLP]_{4}-sparse graphs. Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:521-532 [Journal] - Andreas Brandstädt, Raffaele Mosca
**On the structure and stability number of P**[Citation Graph (0, 0)][DBLP]_{5}- and co-chair-free graphs. Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:47-65 [Journal] - Vadim V. Lozin, Raffaele Mosca
**Independent sets in extensions of 2**[Citation Graph (0, 0)][DBLP]*K*_{2}-free graphs. Discrete Applied Mathematics, 2005, v:146, n:1, pp:74-80 [Journal] - Raffaele Mosca
**Some results on maximum stable sets in certain P**[Citation Graph (0, 0)][DBLP]_{5}-free graphs. Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:175-183 [Journal] - Raffaele Mosca
**Stable Sets in Certain P**[Citation Graph (0, 0)][DBLP]_{6}-free Graphs. Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:177-191 [Journal] - Claudio Arbib, Raffaele Mosca
**On (**[Citation Graph (0, 0)][DBLP]*P*_{5}, diamond)-free graphs. Discrete Mathematics, 2002, v:250, n:1-3, pp:1-22 [Journal] - 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] - 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] - Raffaele Mosca
**A Shy Invariant of Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:2, pp:367-379 [Journal] - 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] - 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] - 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] **On Distance-3 Matchings and Induced Matchings.**[Citation Graph (, )][DBLP]**Independent Sets of Maximum Weight in Apple-Free Graphs.**[Citation Graph (, )][DBLP]**On Independent Vertex Sets in Subclasses of Apple-Free Graphs.**[Citation Graph (, )][DBLP]**Stable set and clique polytopes of (P**[Citation Graph (, )][DBLP]_{5}, gem)-free graphs.**Stable sets of maximum weight in (P**[Citation Graph (, )][DBLP]_{7}, banner)-free graphs.**The stable set polytope for some extensions of P**[Citation Graph (, )][DBLP]_{4}-free graphs.
Search in 0.076secs, Finished in 0.077secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |