8 citations · 37 across the 21 of their papers we have counts for
22 papers
A note on hospital financing: local financing vs. central financing
Raffaele Mosca
This note tries to study how hospital behaviors, with reference to interhospital collaboration or competition, could be affected by hospital financing systems. For that this note s…
Finding Efficient Domination for -Free Bipartite Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of if every vertex of is dominated by exactly one vertex o…
Finding Efficient Domination for -Free Bipartite Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an {\em efficient dominating set} (e.d.s.\ for short) of if every vertex of is dominated by exactly one vertex of .…
Finding Efficient Domination for -Free Bipartite Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
A vertex set in a finite undirected graph is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of if every vertex of is dominated by exactly one vertex o…
Independent sets in (,Triangle)-free graphs
Raffaele Mosca
The Maximum Weight Independent Set Problem (WIS) is a well-known NP-hard problem. A popular way to study WIS is to detect graph classes for which WIS can be solved in polynomial ti…
Finding Dominating Induced Matchings in -Free Graphs in Polynomial Time
Andreas Brandstädt, Raffaele Mosca
Let be a finite undirected graph. An edge subset is a {\em dominating induced matching} ({\em d.i.m.}) in if every edge in is intersected by exac…