Raffaele Mosca

83 papers B 6Journal 76Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Weighted efficient domination for P8-free bipartite graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2025	J	`jnl`	Independent sets of maximum weight beyond claw-free graphs and related problems. Theor. Comput. Sci. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2024	J	`jnl`	Finding dominating induced matchings in P10-free graphs in polynomial time. Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2023	J	`jnl`	Combining decomposition approaches for the Maximum Weight Stable Set problem. Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2022	J	`jnl`	A note on hospital financing: local financing vs. central financing. CoRR Raffaele Mosca
2022	J	`jnl`	Finding dominating induced matchings in P Discuss. Math. Graph Theory Andreas Brandstädt, Raffaele Mosca
2022	J	`jnl`	New Results on Independent Sets in Extensions of 2K Graphs Comb. Raffaele Mosca
2021	J	`jnl`	Finding Efficient Domination for P CoRR Andreas Brandstädt, Raffaele Mosca
2021	J	`jnl`	Independent Sets in (P Graphs Comb. Raffaele Mosca
2021	J	`jnl`	Maximum weight independent sets for ( Theor. Comput. Sci. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Dominating induced matchings in S1, 2, 4-free graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding Efficient Domination for S CoRR Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding Efficient Domination for S CoRR Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2020	J	`jnl`	Independent domination versus weighted independent domination. Inf. Process. Lett. Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2020	J	`jnl`	Independent sets in (P CoRR Raffaele Mosca
2020	J	`jnl`	On efficient domination for some classes of H-free chordal graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	Finding Dominating Induced Matchings in P CoRR Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	Finding Dominating Induced Matchings in S CoRR Andreas Brandstädt, Raffaele Mosca
2019	J	`jnl`	On efficient domination for some classes of H-free bipartite graphs. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Maximum Weight Independent Sets for (S CoRR Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2018	J	`jnl`	On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. Discret. Appl. Math. Raffaele Mosca
2017	J	`jnl`	Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	Finding Dominating Induced Matchings in P Algorithmica Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	More results on weighted independent domination. Theor. Comput. Sci. Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2017	B	`conf`	New Results on Weighted Independent Domination. WG Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2017	J	`jnl`	On Chordal-k-Generalized Split Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	On Efficient Domination for Some Classes of Electron. Notes Discret. Math. Andreas Brandstädt, Raffaele Mosca
2017	J	`jnl`	On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR Andreas Brandstädt, Raffaele Mosca
2016	J	`jnl`	Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca
2016	J	`jnl`	Independent Domination versus Weighted Independent Domination. CoRR Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
2016	J	`jnl`	Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2016	J	`jnl`	Weighted Efficient Domination for P SIAM J. Discret. Math. Andreas Brandstädt, Raffaele Mosca
2016	B	`conf`	Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Dominating Induced Matchings for P CoRR Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
2015	J	`jnl`	Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs Comb. Andreas Brandstädt, Raffaele Mosca
2015	J	`jnl`	Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs Comb. Raffaele Mosca, Paolo Nobili
2015	J	`jnl`	Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR Andreas Brandstädt, Raffaele Mosca
2014	J	`jnl`	Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica Andreas Brandstädt, Raffaele Mosca
2014	J	`jnl`	The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs. CoRR Raffaele Mosca
2013	J	`jnl`	Maximum weight independent sets in ( Inf. Process. Lett. Raffaele Mosca
2013	J	`jnl`	Sparse regular induced subgraphs in 2P Discret. Optim. Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
2012	J	`jnl`	Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull CoRR Andreas Brandstädt, Raffaele Mosca
2012	J	`jnl`	Maximum regular induced subgraphs in 2 P Theor. Comput. Sci. Vadim V. Lozin, Raffaele Mosca
2012	J	`jnl`	Some Results on Stable Sets for k-Colorable P Discret. Math. Theor. Comput. Sci. Raffaele Mosca
2012	J	`jnl`	Stable sets for ( Discuss. Math. Graph Theory Raffaele Mosca
2011	B	`conf`	Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC Andreas Brandstädt, Raffaele Mosca
2011	J	`jnl`	Dominating Induced Matchings for P7-Free Graphs in Linear Time CoRR Andreas Brandstädt, Raffaele Mosca
2011	J	`jnl`	On distance-3 matchings and induced matchings. Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2010	J	`jnl`	Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
2010	J	`jnl`	On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2009	J	`jnl`	Independent sets in (P Discret. Math. Theor. Comput. Sci. Raffaele Mosca
2009	J	`jnl`	Maximum independent sets in subclasses of P Inf. Process. Lett. Vadim V. Lozin, Raffaele Mosca
2009	—	`conf`	On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought Andreas Brandstädt, Raffaele Mosca
2009	J	`jnl`	The stable set polytope for some extensions of P Discret. Math. Raffaele Mosca
2008	B	`conf`	Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
2008	J	`jnl`	On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms Van Bang Le, Raffaele Mosca, Haiko Müller
2008	J	`jnl`	Some observations on maximum weight stable sets in certain P. Eur. J. Oper. Res. Raffaele Mosca
2008	J	`jnl`	Stable sets of maximum weight in (P Discret. Math. Raffaele Mosca
2007	J	`jnl`	How to allocate hard candies fairly. Math. Soc. Sci. Marco Dall'Aglio, Raffaele Mosca
2007	J	`jnl`	Stable set and clique polytopes of (P Discret. Math. Caterina De Simone, Raffaele Mosca
2006	J	`jnl`	Polar graphs and maximal independent sets. Discret. Math. Vadim V. Lozin, Raffaele Mosca
2005	J	`jnl`	Chordal co-gem-free and ( Discret. Appl. Math. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2005	J	`jnl`	Independent sets in extensions of 2 Discret. Appl. Math. Vadim V. Lozin, Raffaele Mosca
2005	J	`jnl`	New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2005	B	`conf`	On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG Van Bang Le, Raffaele Mosca, Haiko Müller
2004	J	`jnl`	Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
2003	J	`jnl`	On the structure and stability number of P Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2003	J	`jnl`	On variations of P Discret. Appl. Math. Andreas Brandstädt, Raffaele Mosca
2003	J	`jnl`	Some results on maximum stable sets in certain P Discret. Appl. Math. Raffaele Mosca
2002	J	`jnl`	A Shy Invariant of Graphs. Graphs Comb. Raffaele Mosca
2002	B	`conf`	New Graph Classes of Bounded Clique-Width. WG Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
2002	J	`jnl`	On ( Discret. Math. Claudio Arbib, Raffaele Mosca
2001	J	`jnl`	A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. Graphs Comb. Raffaele Mosca
1999	J	`jnl`	Stable Sets in Certain P Discret. Appl. Math. Raffaele Mosca
1997	J	`jnl`	Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. Inf. Process. Lett. Raffaele Mosca