Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. - Raffaele Mosca (Inf. Process. Lett., 1997)

Stable Sets in Certain P6-free Graphs. - Raffaele Mosca (Discret. Appl. Math., 1999)

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. - Raffaele Mosca (Graphs Comb., 2001)

On (P5, diamond)-free graphs. - Claudio Arbib; Raffaele Mosca (Discret. Math., 2002)

A Shy Invariant of Graphs. - Raffaele Mosca (Graphs Comb., 2002)

On variations of P4-sparse graphs. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2003)

On the structure and stability number of P5- and co-chair-free graphs. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2003)

Some results on maximum stable sets in certain P5-free graphs. - Raffaele Mosca (Discret. Appl. Math., 2003)

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. - Andreas Brandstädt; Hoàng-Oanh Le; Raffaele Mosca (Int. J. Found. Comput. Sci., 2004)

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width. - Andreas Brandstädt; Hoàng-Oanh Le; Raffaele Mosca (Discret. Appl. Math., 2005)

Independent sets in extensions of 2K2-free graphs. - Vadim V. Lozin; Raffaele Mosca (Discret. Appl. Math., 2005)

New Graph Classes of Bounded Clique-Width. - Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca (Theory Comput. Syst., 2005)

Polar graphs and maximal independent sets. - Vadim V. Lozin; Raffaele Mosca (Discret. Math., 2006)

Stable set and clique polytopes of (P5, gem)-free graphs. - Caterina De Simone; Raffaele Mosca (Discret. Math., 2007)

How to allocate hard candies fairly. - Marco Dall'Aglio; Raffaele Mosca (Math. Soc. Sci., 2007)

Independent Sets of Maximum Weight in Apple-Free Graphs. - Andreas Brandstädt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca (ISAAC, 2008)

Stable sets of maximum weight in (P7, banner)-free graphs. - Raffaele Mosca (Discret. Math., 2008)

Some observations on maximum weight stable sets in certain P. - Raffaele Mosca (Eur. J. Oper. Res., 2008)

On stable cutsets in claw-free graphs and planar graphs. - Van Bang Le; Raffaele Mosca; Haiko Müller (J. Discrete Algorithms, 2008)

The stable set polytope for some extensions of P4-free graphs. - Raffaele Mosca (Discret. Math., 2009)

Independent sets in (P6, diamond)-free graphs. - Raffaele Mosca (Discret. Math. Theor. Comput. Sci., 2009)

Maximum independent sets in subclasses of P5-free graphs. - Vadim V. Lozin; Raffaele Mosca (Inf. Process. Lett., 2009)

On Independent Vertex Sets in Subclasses of Apple-Free Graphs. - Andreas Brandstädt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca (Algorithmica, 2010)

Independent Sets of Maximum Weight in Apple-Free Graphs. - Andreas Brandstädt; Vadim V. Lozin; Raffaele Mosca (SIAM J. Discret. Math., 2010)

Dominating Induced Matchings for P7-Free Graphs in Linear Time - Andreas Brandstädt; Raffaele Mosca (CoRR, 2011)

On distance-3 matchings and induced matchings. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2011)

Stable sets for (P6, K2, 3)-free graphs. - Raffaele Mosca (Discuss. Math. Graph Theory, 2012)

Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations. - Raffaele Mosca (Discret. Math. Theor. Comput. Sci., 2012)

Maximum regular induced subgraphs in 2 P3-free graphs. - Vadim V. Lozin; Raffaele Mosca (Theor. Comput. Sci., 2012)

Sparse regular induced subgraphs in 2P3-free graphs. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Optim., 2013)

Maximum weight independent sets in (P6, co-banner)-free graphs. - Raffaele Mosca (Inf. Process. Lett., 2013)

Dominating Induced Matchings for P 7-Free Graphs in Linear Time. - Andreas Brandstädt; Raffaele Mosca (Algorithmica, 2014)

The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs. - Raffaele Mosca (CoRR, 2014)

Dominating Induced Matchings for P8-free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2015)

Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2015)

Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2015)

Independent domination in finitely defined classes of graphs: Polynomial algorithms. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Appl. Math., 2015)

Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. - Andreas Brandstädt; Raffaele Mosca (Graphs Comb., 2015)

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. - Raffaele Mosca; Paolo Nobili (Graphs Comb., 2015)

Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. - Andreas Brandstädt; Raffaele Mosca (WG, 2016)

Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. - Andreas Brandstädt; Suhail Mahfud; Raffaele Mosca (CoRR, 2016)

Independent Domination versus Weighted Independent Domination. - Vadim V. Lozin; Raffaele Mosca; Victor Zamaraev (CoRR, 2016)

Weighted Efficient Domination for P5-Free and P6-Free Graphs. - Andreas Brandstädt; Raffaele Mosca (SIAM J. Discret. Math., 2016)

New Results on Weighted Independent Domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (WG, 2017)

Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (Algorithmica, 2017)

On Chordal-k-Generalized Split Graphs. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2017)

Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2017)

Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2017)

A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. - Raffaele Mosca (Discret. Appl. Math., 2017)

On Efficient Domination for Some Classes of H-Free Chordal Graphs. - Andreas Brandstädt; Raffaele Mosca (Electron. Notes Discret. Math., 2017)

More results on weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Theor. Comput. Sci., 2017)

Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2018)

Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2018)

Maximum weight independent set for ℓclaw-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2018)

Finding Dominating Induced Matchings in S1, 1, 5-Free Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2019)

On efficient domination for some classes of H-free bipartite graphs. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2019)

Independent sets in (P4+P4, Triangle)-free graphs. - Raffaele Mosca (CoRR, 2020)

Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2020)

Finding Efficient Domination for S1, 1, 5-Free Bipartite Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2020)

Dominating induced matchings in S1, 2, 4-free graphs. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2020)

On efficient domination for some classes of H-free chordal graphs. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2020)

Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2020)

Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Discret. Appl. Math., 2020)

Independent domination versus weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Inf. Process. Lett., 2020)

Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time. - Andreas Brandstädt; Raffaele Mosca (CoRR, 2021)

Independent Sets in (P4+P4, Triangle)-Free Graphs. - Raffaele Mosca (Graphs Comb., 2021)

Maximum weight independent sets for (S1, 2, 4, triangle)-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Theor. Comput. Sci., 2021)

A note on hospital financing: local financing vs. central financing. - Raffaele Mosca (CoRR, 2022)

Finding dominating induced matchings in P9-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Discuss. Math. Graph Theory, 2022)

New Results on Independent Sets in Extensions of 2K2-free Graphs. - Raffaele Mosca (Graphs Comb., 2022)

Combining decomposition approaches for the Maximum Weight Stable Set problem. - Andreas Brandstädt; Raffaele Mosca (Theor. Comput. Sci., 2023)

Finding dominating induced matchings in P10-free graphs in polynomial time. - Andreas Brandstädt; Raffaele Mosca (Theor. Comput. Sci., 2024)

Independent sets of maximum weight beyond claw-free graphs and related problems. - Andreas Brandstädt; Vadim V. Lozin; Raffaele Mosca (Theor. Comput. Sci., 2025)