Raffaele Mosca

According to our database, Raffaele Mosca authored at least 71 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Combining decomposition approaches for the Maximum Weight Stable Set problem.

Andreas Brandstädt, Raffaele Mosca

Theor. Comput. Sci., June, 2023

2022

New Results on Independent Sets in Extensions of 2K₂-free Graphs.

Raffaele Mosca

Graphs Comb., 2022

Finding dominating induced matchings in P₉-free graphs in polynomial time.

Andreas Brandstädt, Raffaele Mosca

Discuss. Math. Graph Theory, 2022

A note on hospital financing: local financing vs. central financing.

Raffaele Mosca

CoRR, 2022

2021

Maximum weight independent sets for (<i>S</i>_{1, 2, 4}, triangle)-free graphs in polynomial time.

Andreas Brandstädt, Raffaele Mosca

Theor. Comput. Sci., 2021

Independent Sets in (P_4+P₄, Triangle)-Free Graphs.

Raffaele Mosca

Graphs Comb., 2021

Finding Efficient Domination for P₈-Free Bipartite Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2021

2020

Independent domination versus weighted independent domination.

Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev

Inf. Process. Lett., 2020

Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time.

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

On efficient domination for some classes of H-free chordal graphs.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2020

Dominating induced matchings in S1, 2, 4-free graphs.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2020

Finding Efficient Domination for S_{1, 1, 5}-Free Bipartite Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2020

Finding Efficient Domination for S_{1, 3, 3}-Free Bipartite Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2020

Independent sets in (P₄+P₄, Triangle)-free graphs.

Raffaele Mosca

CoRR, 2020

2019

On efficient domination for some classes of H-free bipartite graphs.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2019

Finding Dominating Induced Matchings in S_{1, 1, 5}-Free Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2019

2018

Maximum weight independent set for ℓclaw-free graphs in polynomial time.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2018

Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2018

Maximum Weight Independent Sets for (S_{1, 2, 4}, Triangle)-Free Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2018

2017

More results on weighted independent domination.

Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev

Theor. Comput. Sci., 2017

On Efficient Domination for Some Classes of <i>H</i>-Free Chordal Graphs.

Andreas Brandstädt, Raffaele Mosca

Electron. Notes Discret. Math., 2017

A sufficient condition to extend polynomial results for the Maximum Independent Set Problem.

Raffaele Mosca

Discret. Appl. Math., 2017

Dominating Induced Matchings in $S_{1, 2, 4}$-Free 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

On Chordal-k-Generalized Split Graphs.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2017

Finding Dominating Induced Matchings in P₈ -Free Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

Algorithmica, 2017

New Results on Weighted Independent Domination.

Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Weighted Efficient Domination for P₅-Free and P₆-Free Graphs.

Andreas Brandstädt, Raffaele Mosca

SIAM J. Discret. Math., 2016

Independent Domination versus Weighted Independent Domination.

Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev

CoRR, 2016

Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs.

Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca

CoRR, 2016

Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs.

Andreas Brandstädt, Raffaele Mosca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number.

Raffaele Mosca, Paolo Nobili

Graphs Comb., 2015

Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull.

Andreas Brandstädt, Raffaele Mosca

Graphs Comb., 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 for ($P_7$, Triangle)-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

Dominating Induced Matchings for P₈-free Graphs in Polynomial Time.

Andreas Brandstädt, Raffaele Mosca

CoRR, 2015

2014

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

Raffaele Mosca

CoRR, 2014

Dominating Induced Matchings for P 7-Free Graphs in Linear Time.

Andreas Brandstädt, Raffaele Mosca

Algorithmica, 2014

2013

Maximum weight independent sets in (<i>P</i>₆, co-banner)-free graphs.

Raffaele Mosca

Inf. Process. Lett., 2013

Sparse regular induced subgraphs in 2P₃-free graphs.

Vadim V. Lozin, Raffaele Mosca, Christopher Purcell

Discret. Optim., 2013

2012

Maximum regular induced subgraphs in 2 P₃-free graphs.

Vadim V. Lozin, Raffaele Mosca

Theor. Comput. Sci., 2012

Some Results on Stable Sets for k-Colorable P₆-Free Graphs and Generalizations.

Raffaele Mosca

Discret. Math. Theor. Comput. Sci., 2012

Stable sets for (<i>P₆, K_{2, 3}</i>)-free graphs.

Raffaele Mosca

Discuss. Math. Graph Theory, 2012

2011

On distance-3 matchings and induced matchings.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2011

Dominating Induced Matchings for P7-Free Graphs in Linear Time

Andreas Brandstädt, Raffaele Mosca

CoRR, 2011

2010

Independent Sets of Maximum Weight in Apple-Free Graphs.

Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca

SIAM J. Discret. Math., 2010

On Independent Vertex Sets in Subclasses of Apple-Free Graphs.

Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca

Algorithmica, 2010

2009

Maximum independent sets in subclasses of P₅-free graphs.

Vadim V. Lozin, Raffaele Mosca

Inf. Process. Lett., 2009

Independent sets in (P₆, diamond)-free graphs.

Raffaele Mosca

Discret. Math. Theor. Comput. Sci., 2009

The stable set polytope for some extensions of P₄-free graphs.

Raffaele Mosca

Discret. Math., 2009

2008

On stable cutsets in claw-free graphs and planar graphs.

Van Bang Le, Raffaele Mosca, Haiko Müller

J. Discrete Algorithms, 2008

Some observations on maximum weight stable sets in certain P.

Raffaele Mosca

Eur. J. Oper. Res., 2008

Stable sets of maximum weight in (P₇, banner)-free graphs.

Raffaele Mosca

Discret. Math., 2008

Independent Sets of Maximum Weight in Apple-Free Graphs.

Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

How to allocate hard candies fairly.

Marco Dall'Aglio, Raffaele Mosca

Math. Soc. Sci., 2007

Stable set and clique polytopes of (P₅, gem)-free graphs.

Caterina De Simone, Raffaele Mosca

Discret. Math., 2007

2006

Polar graphs and maximal independent sets.

Vadim V. Lozin, Raffaele Mosca

Discret. Math., 2006

2005

New Graph Classes of Bounded Clique-Width.

Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca

Theory Comput. Syst., 2005

Independent sets in extensions of 2<i>K</i>₂-free graphs.

Vadim V. Lozin, Raffaele Mosca

Discret. Appl. Math., 2005

Chordal co-gem-free and (<i>P</i>₅, gem)-free graphs have bounded clique-width.

Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca

Discret. Appl. Math., 2005

2004

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

2003

Some results on maximum stable sets in certain P₅-free graphs.

Raffaele Mosca

Discret. Appl. Math., 2003

On the structure and stability number of P₅- and co-chair-free graphs.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2003

On variations of P₄-sparse graphs.

Andreas Brandstädt, Raffaele Mosca

Discret. Appl. Math., 2003

2002

A Shy Invariant of Graphs.

Raffaele Mosca

Graphs Comb., 2002

On (<i>P</i>₅, diamond)-free graphs.

Claudio Arbib, Raffaele Mosca

Discret. Math., 2002

2001

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph.

Raffaele Mosca

Graphs Comb., 2001

1999

Stable Sets in Certain P₆-free Graphs.

Raffaele Mosca

Discret. Appl. Math., 1999

1997

Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs.

Raffaele Mosca

Inf. Process. Lett., 1997