Raffaele Mosca

Theor. Comput. Sci., 2024

2023

Combining decomposition approaches for the Maximum Weight Stable Set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., June, 2023

2022

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

[BibT_eX]

[DOI]

Graphs Comb., 2022

Finding dominating induced matchings in P9-free graphs in polynomial time.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

2021

Maximum weight independent sets for (S1, 2, 4, triangle)-free graphs in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Independent Sets in (P4+P4, Triangle)-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

Independent domination versus weighted independent domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Finding Efficient Domination for S1, 1, 5-Free Bipartite Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2020

Finding Efficient Domination for S1, 3, 3-Free Bipartite Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Finding Dominating Induced Matchings in S1, 1, 5-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2019

2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Maximum Weight Independent Sets for (S1, 2, 4, Triangle)-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2018

2017

More results on weighted independent domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On Efficient Domination for Some Classes of H-Free Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

On Chordal-k-Generalized Split Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Finding Dominating Induced Matchings in P8 -Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Algorithmica, 2017

New Results on Weighted Independent Domination.

[BibT_eX]

[DOI]

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

2016

Weighted Efficient Domination for P5-Free and P6-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Independent Domination versus Weighted Independent Domination.

[BibT_eX]

[DOI]

Victor Zamaraev

CoRR, 2016

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

[BibT_eX]

[DOI]

Suhail Mahfud

CoRR, 2016

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

[BibT_eX]

[DOI]

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

2015

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

[BibT_eX]

[DOI]

Paolo Nobili

Graphs Comb., 2015

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

[BibT_eX]

[DOI]

Graphs Comb., 2015

Independent domination in finitely defined classes of graphs: Polynomial algorithms.

[BibT_eX]

[DOI]

Christopher Purcell

Discret. Appl. Math., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Dominating Induced Matchings for P8-free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2015

2014

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

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Maximum weight independent sets in (P6, co-banner)-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Sparse regular induced subgraphs in 2P3-free graphs.

[BibT_eX]

[DOI]

Christopher Purcell

Discret. Optim., 2013

2012

Maximum regular induced subgraphs in 2 P3-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

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

Stable sets for (P6, K2, 3)-free graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

2011

On distance-3 matchings and induced matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Dominating Induced Matchings for P7-Free Graphs in Linear Time

[BibT_eX]

[DOI]

CoRR, 2011

2010

Independent Sets of Maximum Weight in Apple-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

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

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

Maximum independent sets in subclasses of P5-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Independent sets in (P6, diamond)-free graphs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

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

[BibT_eX]

[DOI]

Van Bang Le

Haiko Müller

J. Discrete Algorithms, 2008

Some observations on maximum weight stable sets in certain P.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

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

[BibT_eX]

[DOI]

Discret. Math., 2008

Independent Sets of Maximum Weight in Apple-Free Graphs.

[BibT_eX]

[DOI]

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

2007

How to allocate hard candies fairly.

[BibT_eX]

[DOI]

Marco Dall'Aglio

Math. Soc. Sci., 2007

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

[BibT_eX]

[DOI]

Caterina De Simone

Discret. Math., 2007

2006

Polar graphs and maximal independent sets.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

New Graph Classes of Bounded Clique-Width.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Independent sets in extensions of 2K2-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width.

[BibT_eX]

[DOI]

Hoàng-Oanh Le

Discret. Appl. Math., 2005

2004

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.

[BibT_eX]

[DOI]

Hoàng-Oanh Le

Int. J. Found. Comput. Sci., 2004

2003

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On variations of P4-sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

A Shy Invariant of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

On (P5, diamond)-free graphs.

[BibT_eX]

[DOI]

Claudio Arbib

Discret. Math., 2002

2001

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

[BibT_eX]

[DOI]

Graphs Comb., 2001

1999

Stable Sets in Certain P6-free Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1997

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

[BibT_eX]

[DOI]