 | 2009 |
|---|
| 23 |       | Andreas Brandstädt,
Raffaele Mosca:
On Distance-3 Matchings and Induced Matchings.
Graph Theory, Computational Intelligence and Thought 2009: 116-126 |
| 22 | | Raffaele Mosca:
The stable set polytope for some extensions of P4-free graphs.
Discrete Mathematics 309(1): 176-187 (2009) |
| 21 | | Vadim V. Lozin,
Raffaele Mosca:
Maximum independent sets in subclasses of P5-free graphs.
Inf. Process. Lett. 109(6): 319-324 (2009) |
| 2008 |
|---|
| 20 | | Andreas Brandstädt,
Tilo Klembt,
Vadim V. Lozin,
Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs.
ISAAC 2008: 848-858 |
| 19 | | Raffaele Mosca:
Stable sets of maximum weight in (P7, banner)-free graphs.
Discrete Mathematics 308(1): 20-33 (2008) |
| 18 | | Raffaele Mosca:
Some observations on maximum weight stable sets in certain P.
European Journal of Operational Research 184(3): 849-859 (2008) |
| 17 | | Van Bang Le,
Raffaele Mosca,
Haiko Müller:
On stable cutsets in claw-free graphs and planar graphs.
J. Discrete Algorithms 6(2): 256-276 (2008) |
| 2007 |
|---|
| 16 | | Caterina De Simone,
Raffaele Mosca:
Stable set and clique polytopes of (P5, gem)-free graphs.
Discrete Mathematics 307(22): 2661-2670 (2007) |
| 2006 |
|---|
| 15 | | Vadim V. Lozin,
Raffaele Mosca:
Polar graphs and maximal independent sets.
Discrete Mathematics 306(22): 2901-2908 (2006) |
| 2005 |
|---|
| 14 | | Van Bang Le,
Raffaele Mosca,
Haiko Müller:
On Stable Cutsets in Claw-Free Graphs and Planar Graphs.
WG 2005: 163-174 |
| 13 | | Andreas Brandstädt,
Hoàng-Oanh Le,
Raffaele Mosca:
Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width.
Discrete Applied Mathematics 145(2): 232-241 (2005) |
| 12 | | Vadim V. Lozin,
Raffaele Mosca:
Independent sets in extensions of 2K2-free graphs.
Discrete Applied Mathematics 146(1): 74-80 (2005) |
| 11 | | Andreas Brandstädt,
Feodor F. Dragan,
Hoàng-Oanh Le,
Raffaele Mosca:
New Graph Classes of Bounded Clique-Width.
Theory Comput. Syst. 38(5): 623-645 (2005) |
| 2004 |
|---|
| 10 | | Andreas Brandstädt,
Hoàng-Oanh Le,
Raffaele Mosca:
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.
Int. J. Found. Comput. Sci. 15(1): 163-185 (2004) |
| 2003 |
|---|
| 9 | | Andreas Brandstädt,
Raffaele Mosca:
On variations of P4-sparse graphs.
Discrete Applied Mathematics 129(2-3): 521-532 (2003) |
| 8 | | Raffaele Mosca:
Some results on maximum stable sets in certain P5-free graphs.
Discrete Applied Mathematics 132(1-3): 175-183 (2003) |
| 7 | | Andreas Brandstädt,
Raffaele Mosca:
On the structure and stability number of P5- and co-chair-free graphs.
Discrete Applied Mathematics 132(1-3): 47-65 (2003) |
| 2002 |
|---|
| 6 | | Andreas Brandstädt,
Feodor F. Dragan,
Hoàng-Oanh Le,
Raffaele Mosca:
New Graph Classes of Bounded Clique-Width.
WG 2002: 57-67 |
| 5 | | Claudio Arbib,
Raffaele Mosca:
On (P5, diamond)-free graphs.
Discrete Mathematics 250(1-3): 1-22 (2002) |
| 4 | | Raffaele Mosca:
A Shy Invariant of Graphs.
Graphs and Combinatorics 18(2): 367-379 (2002) |
| 2001 |
|---|
| 3 | | Raffaele Mosca:
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph.
Graphs and Combinatorics 17(3): 517-528 (2001) |
| 1999 |
|---|
| 2 | | Raffaele Mosca:
Stable Sets in Certain P6-free Graphs.
Discrete Applied Mathematics 92(2-3): 177-191 (1999) |
| 1997 |
|---|
| 1 | | Raffaele Mosca:
Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs.
Inf. Process. Lett. 61(3): 137-143 (1997) |
