Raffaele Mosca

According to our database1, Raffaele Mosca authored at least 72 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Finding dominating induced matchings in P10-free graphs in polynomial time.
Theor. Comput. Sci., 2024

2023
Combining decomposition approaches for the Maximum Weight Stable Set problem.
Theor. Comput. Sci., June, 2023

2022
New Results on Independent Sets in Extensions of 2K<sub>2</sub>-free Graphs.
Graphs Comb., 2022

Finding dominating induced matchings in P<sub>9</sub>-free graphs in polynomial time.
Discuss. Math. Graph Theory, 2022

A note on hospital financing: local financing vs. central financing.
CoRR, 2022

2021
Maximum weight independent sets for (<i>S</i><sub>1, 2, 4</sub>, triangle)-free graphs in polynomial time.
Theor. Comput. Sci., 2021

Independent Sets in (P<sub>4+P<sub>4</sub></sub>, Triangle)-Free Graphs.
Graphs Comb., 2021

Finding Efficient Domination for P<sub>8</sub>-Free Bipartite Graphs in Polynomial Time.
CoRR, 2021

2020
Independent domination versus weighted independent domination.
Inf. Process. Lett., 2020

Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time.
Discret. Appl. Math., 2020

Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time.
Discret. Appl. Math., 2020

On efficient domination for some classes of H-free chordal graphs.
Discret. Appl. Math., 2020

Dominating induced matchings in S1, 2, 4-free graphs.
Discret. Appl. Math., 2020

Finding Efficient Domination for S<sub>1, 1, 5</sub>-Free Bipartite Graphs in Polynomial Time.
CoRR, 2020

Finding Efficient Domination for S<sub>1, 3, 3</sub>-Free Bipartite Graphs in Polynomial Time.
CoRR, 2020

Independent sets in (P<sub>4</sub>+P<sub>4</sub>, Triangle)-free graphs.
CoRR, 2020

2019
On efficient domination for some classes of H-free bipartite graphs.
Discret. Appl. Math., 2019

Finding Dominating Induced Matchings in S<sub>1, 1, 5</sub>-Free Graphs in Polynomial Time.
CoRR, 2019

2018
Maximum weight independent set for ℓclaw-free graphs in polynomial time.
Discret. Appl. Math., 2018

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

Maximum Weight Independent Sets for (S<sub>1, 2, 4</sub>, Triangle)-Free Graphs in Polynomial Time.
CoRR, 2018

2017
More results on weighted independent domination.
Theor. Comput. Sci., 2017

On Efficient Domination for Some Classes of <i>H</i>-Free Chordal Graphs.
Electron. Notes Discret. Math., 2017

A sufficient condition to extend polynomial results for the Maximum Independent Set Problem.
Discret. Appl. Math., 2017

Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs.
CoRR, 2017

Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time.
CoRR, 2017

On Chordal-k-Generalized Split Graphs.
CoRR, 2017

Finding Dominating Induced Matchings in P<sub>8</sub> -Free Graphs in Polynomial Time.
Algorithmica, 2017

New Results on Weighted Independent Domination.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
Weighted Efficient Domination for P<sub>5</sub>-Free and P<sub>6</sub>-Free Graphs.
SIAM J. Discret. Math., 2016

Independent Domination versus Weighted Independent Domination.
CoRR, 2016

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

Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

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

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

Independent domination in finitely defined classes of graphs: Polynomial algorithms.
Discret. Appl. Math., 2015

Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time.
CoRR, 2015

Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time.
CoRR, 2015

Dominating Induced Matchings for P<sub>8</sub>-free Graphs in Polynomial Time.
CoRR, 2015

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

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

2013
Maximum weight independent sets in (<i>P</i><sub>6</sub>, co-banner)-free graphs.
Inf. Process. Lett., 2013

Sparse regular induced subgraphs in 2P<sub>3</sub>-free graphs.
Discret. Optim., 2013

2012
Maximum regular induced subgraphs in 2 P<sub>3</sub>-free graphs.
Theor. Comput. Sci., 2012

Some Results on Stable Sets for k-Colorable P<sub>6</sub>-Free Graphs and Generalizations.
Discret. Math. Theor. Comput. Sci., 2012

Stable sets for (<i>P<sub>6</sub>, K<sub>2, 3</sub></i>)-free graphs.
Discuss. Math. Graph Theory, 2012

2011
On distance-3 matchings and induced matchings.
Discret. Appl. Math., 2011

Dominating Induced Matchings for P7-Free Graphs in Linear Time
CoRR, 2011

2010
Independent Sets of Maximum Weight in Apple-Free Graphs.
SIAM J. Discret. Math., 2010

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

2009
Maximum independent sets in subclasses of P<sub>5</sub>-free graphs.
Inf. Process. Lett., 2009

Independent sets in (P<sub>6</sub>, diamond)-free graphs.
Discret. Math. Theor. Comput. Sci., 2009

The stable set polytope for some extensions of P<sub>4</sub>-free graphs.
Discret. Math., 2009

2008
On stable cutsets in claw-free graphs and planar graphs.
J. Discrete Algorithms, 2008

Some observations on maximum weight stable sets in certain P.
Eur. J. Oper. Res., 2008

Stable sets of maximum weight in (P<sub>7</sub>, banner)-free graphs.
Discret. Math., 2008

Independent Sets of Maximum Weight in Apple-Free Graphs.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
How to allocate hard candies fairly.
Math. Soc. Sci., 2007

Stable set and clique polytopes of (P<sub>5</sub>, gem)-free graphs.
Discret. Math., 2007

2006
Polar graphs and maximal independent sets.
Discret. Math., 2006

2005
New Graph Classes of Bounded Clique-Width.
Theory Comput. Syst., 2005

Independent sets in extensions of 2<i>K</i><sub>2</sub>-free graphs.
Discret. Appl. Math., 2005

Chordal co-gem-free and (<i>P</i><sub>5</sub>, gem)-free graphs have bounded clique-width.
Discret. Appl. Math., 2005

2004
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.
Int. J. Found. Comput. Sci., 2004

2003
Some results on maximum stable sets in certain P<sub>5</sub>-free graphs.
Discret. Appl. Math., 2003

On the structure and stability number of P<sub>5</sub>- and co-chair-free graphs.
Discret. Appl. Math., 2003

On variations of P<sub>4</sub>-sparse graphs.
Discret. Appl. Math., 2003

2002
A Shy Invariant of Graphs.
Graphs Comb., 2002

On (<i>P</i><sub>5</sub>, diamond)-free graphs.
Discret. Math., 2002

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

1999
Stable Sets in Certain P<sub>6</sub>-free Graphs.
Discret. Appl. Math., 1999

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


  Loading...