A. Brandstädt

activity

20112021

most citedPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

31 citations · 109 across the 27 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DM2016

Bounded Clique-Width of ( $S_{1, 2, 2}$ ,Triangle)-Free Graphs

Andreas Brandstadt, Suhail Mahfud, Raffaele Mosca

If a graph has no induced subgraph isomorphic to $H_{1}$ or $H_{2}$ then it is said to be ( $H_{1}, H_{2}$ )-free. Dabrowski and Paulusma found 13 open cases for the question whether the cliq…

cs.DM2016★ 3 cited

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 $G_{1}, G_{2}$ , $G_{1} + G_{2}$ denotes the disjoint union of $G_{1}$ and $G_{2}$ , and for a constan…

Bounded Clique-Width of (S1,2,2​,Triangle)-Free Graphs

Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time

Bounded Clique-Width of ( $S_{1, 2, 2}$ ,Triangle)-Free Graphs