8 citations · 14 across the 6 of their papers we have counts for
6 papers
New Polynomial Cases of the Weighted Efficient Domination Problem
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G i…
Clique cycle-transversals in distance-hereditary graphs
Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira +1
A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a cliq…
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…
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient domin…
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…
Clique Separator Decomposition of Hole- and Diamond-Free Graphs and Algorithmic Consequences
Andreas Brandstädt, Vassilis Giakoumakis
Clique separator decomposition introduced by Tarjan and Whitesides is one of the most important graph decompositions. A graph is an {\em atom} if it has no clique separator. A {\em…