
Finding Efficient Domination for P_8Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

Finding Efficient Domination for S_1,1,5Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

Finding Efficient Domination for S_1,3,3Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
read it

Finding Dominating Induced Matchings in P_9Free Graphs in Polynomial Time
Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
read it

Finding Dominating Induced Matchings in S_1,1,5Free Graphs in Polynomial Time
Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
read it

Maximum Weight Independent Sets for (S_1,2,4,Triangle)Free Graphs in Polynomial Time
The Maximum Weight Independent Set (MWIS) problem on finite undirected g...
read it

On Efficient Domination for Some Classes of HFree Bipartite Graphs
A vertex set D in a finite undirected graph G is an efficient dominatin...
read it
Andreas Brandstädt
is this you? claim profile