Raffaele Mosca

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 37

Top Topics

Subgraph Isomorphism

Bipartite Graph

Independent Set

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in P10-free graphs in polynomial time. Theor. Comput. Sci. 990 (2024)
Andreas Brandstädt, Raffaele Mosca
Combining decomposition approaches for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 960 (2023)
Raffaele Mosca
A note on hospital financing: local financing vs. central financing. CoRR (2022)
Raffaele Mosca
-free Graphs. Graphs Comb. 38 (4) (2022)
Andreas Brandstädt, Raffaele Mosca
-free graphs in polynomial time. Discuss. Math. Graph Theory 42 (4) (2022)
Andreas Brandstädt, Raffaele Mosca
, triangle)-free graphs in polynomial time. Theor. Comput. Sci. (2021)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2021)
Raffaele Mosca
, Triangle)-Free Graphs. Graphs Comb. 37 (6) (2021)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
Independent domination versus weighted independent domination. Inf. Process. Lett. 156 (2020)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2020)
Andreas Brandstädt, Raffaele Mosca
-Free Bipartite Graphs in Polynomial Time. CoRR (2020)
Raffaele Mosca
, Triangle)-free graphs. CoRR (2020)
Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discret. Appl. Math. 283 (2020)
Andreas Brandstädt, Raffaele Mosca
Dominating induced matchings in S1, 2, 4-free graphs. Discret. Appl. Math. 278 (2020)
Andreas Brandstädt, Raffaele Mosca
Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discret. Appl. Math. 284 (2020)
Andreas Brandstädt, Raffaele Mosca
On efficient domination for some classes of H-free chordal graphs. Discret. Appl. Math. 281 (2020)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. CoRR (2019)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. CoRR (2019)
Andreas Brandstädt, Raffaele Mosca
On efficient domination for some classes of H-free bipartite graphs. Discret. Appl. Math. 270 (2019)
Andreas Brandstädt, Raffaele Mosca
, Triangle)-Free Graphs in Polynomial Time. CoRR (2018)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time. Discret. Appl. Math. 236 (2018)
Andreas Brandstädt, Raffaele Mosca
On Efficient Domination for Some Classes of H-Free Bipartite Graphs. CoRR (2018)
Andreas Brandstädt, Raffaele Mosca
Maximum weight independent set for ℓclaw-free graphs in polynomial time. Discret. Appl. Math. 237 (2018)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs in Polynomial Time. Algorithmica 77 (4) (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
More results on weighted independent domination. Theor. Comput. Sci. 700 (2017)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings in $S_{1, 2, 4}$-Free Graphs. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
-Free Chordal Graphs. Electron. Notes Discret. Math. 62 (2017)
Raffaele Mosca
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem. Discret. Appl. Math. 216 (2017)
Andreas Brandstädt, Raffaele Mosca
On Efficient Domination for Some Classes of H-Free Chordal Graphs. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
On Chordal-k-Generalized Split Graphs. CoRR (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
New Results on Weighted Independent Domination. WG (2017)
Andreas Brandstädt, Raffaele Mosca
Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time. CoRR (2017)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time. CoRR (2016)
Andreas Brandstädt, Suhail Mahfud, Raffaele Mosca
Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. CoRR (2016)
Andreas Brandstädt, Raffaele Mosca
-Free Graphs. SIAM J. Discret. Math. 30 (4) (2016)
Andreas Brandstädt, Raffaele Mosca
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG (2016)
Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
Independent Domination versus Weighted Independent Domination. CoRR (2016)
Andreas Brandstädt, Raffaele Mosca
Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt, Raffaele Mosca
-free Graphs in Polynomial Time. CoRR (2015)
Raffaele Mosca, Paolo Nobili
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs Comb. 31 (5) (2015)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets for ($P_7$, Triangle)-Free Graphs in Polynomial Time. CoRR (2015)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. Graphs Comb. 31 (5) (2015)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182 (2015)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P 7-Free Graphs in Linear Time. Algorithmica 68 (4) (2014)
Raffaele Mosca
The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs. CoRR (2014)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
-free graphs. Discret. Optim. 10 (4) (2013)
Raffaele Mosca
, co-banner)-free graphs. Inf. Process. Lett. 113 (3) (2013)
Vadim V. Lozin, Raffaele Mosca
-free graphs. Theor. Comput. Sci. 460 (2012)
Andreas Brandstädt, Raffaele Mosca
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull CoRR (2012)
Raffaele Mosca
)-free graphs. Discuss. Math. Graph Theory 32 (3) (2012)
Raffaele Mosca
-Free Graphs and Generalizations. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P7-Free Graphs in Linear Time CoRR (2011)
Andreas Brandstädt, Raffaele Mosca
On distance-3 matchings and induced matchings. Discret. Appl. Math. 159 (7) (2011)
Andreas Brandstädt, Raffaele Mosca
Dominating Induced Matchings for P 7-free Graphs in Linear Time. ISAAC (2011)
Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56 (4) (2010)
Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. 24 (1) (2010)
Raffaele Mosca
, diamond)-free graphs. Discret. Math. Theor. Comput. Sci. 11 (1) (2009)
Andreas Brandstädt, Raffaele Mosca
On Distance-3 Matchings and Induced Matchings. Graph Theory, Computational Intelligence and Thought (2009)
Raffaele Mosca
-free graphs. Discret. Math. 309 (1) (2009)
Vadim V. Lozin, Raffaele Mosca
-free graphs. Inf. Process. Lett. 109 (6) (2009)
Van Bang Le, Raffaele Mosca, Haiko Müller
On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6 (2) (2008)
Raffaele Mosca
, banner)-free graphs. Discret. Math. 308 (1) (2008)
Raffaele Mosca
Some observations on maximum weight stable sets in certain P. Eur. J. Oper. Res. 184 (3) (2008)
Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC (2008)
Caterina De Simone, Raffaele Mosca
, gem)-free graphs. Discret. Math. 307 (22) (2007)
Marco Dall'Aglio, Raffaele Mosca
How to allocate hard candies fairly. Math. Soc. Sci. 54 (3) (2007)
Vadim V. Lozin, Raffaele Mosca
Polar graphs and maximal independent sets. Discret. Math. 306 (22) (2006)
Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
, gem)-free graphs have bounded clique-width. Discret. Appl. Math. 145 (2) (2005)
Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG (2005)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38 (5) (2005)
Vadim V. Lozin, Raffaele Mosca
-free graphs. Discret. Appl. Math. 146 (1) (2005)
Andreas Brandstädt, Hoàng-Oanh Le, Raffaele Mosca
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width. Int. J. Found. Comput. Sci. 15 (1) (2004)
Andreas Brandstädt, Raffaele Mosca
-sparse graphs. Discret. Appl. Math. 129 (2-3) (2003)
Raffaele Mosca
-free graphs. Discret. Appl. Math. 132 (1-3) (2003)
Andreas Brandstädt, Raffaele Mosca
- and co-chair-free graphs. Discret. Appl. Math. 132 (1-3) (2003)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
New Graph Classes of Bounded Clique-Width. WG (2002)
Claudio Arbib, Raffaele Mosca
, diamond)-free graphs. Discret. Math. 250 (1-3) (2002)
Raffaele Mosca
A Shy Invariant of Graphs. Graphs Comb. 18 (2) (2002)
Raffaele Mosca
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. Graphs Comb. 17 (3) (2001)
Raffaele Mosca
-free Graphs. Discret. Appl. Math. 92 (2-3) (1999)
Raffaele Mosca
Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. Inf. Process. Lett. 61 (3) (1997)