research
∙
09/15/2021
Finding Efficient Domination for (S_1,2,5,S_3,3,3-Free Chordal Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
share
research
∙
01/05/2021
Finding Efficient Domination for P_8-Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
research
∙
10/29/2020
Finding Efficient Domination for S_1,1,5-Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
research
∙
08/10/2020
Finding Efficient Domination for S_1,3,3-Free Bipartite Graphs in Polynomial Time
A vertex set D in a finite undirected graph G is an efficient dominating...
research
∙
08/02/2019
Finding Dominating Induced Matchings in P_9-Free Graphs in Polynomial Time
Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
research
∙
05/14/2019
Finding Dominating Induced Matchings in S_1,1,5-Free Graphs in Polynomial Time
Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
research
∙
06/22/2018
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...
research
∙
05/30/2018