8 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.DM2016
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time
Andreas Brandstadt, Raffaele Mosca
The Maximum Weight Independent Set (MWIS) problem is a well-known NP-hard problem. For graphs , denotes the disjoint union of and , and for a constan…
cs.DM2012★ 1 cited
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
Andreas Brandstädt, Raffaele Mosca
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most inves…
cs.DM2011★ 8 cited
Dominating Induced Matchings for P7-Free Graphs in Linear Time
Andreas Brandstadt, Raffaele Mosca
Let be a finite undirected graph with edge set . An edge set is an {\em induced matching} in if the pairwise distance of the edges of in is at…