activity
20222026
most citedExcluding a clique or a biclique in graphs of bounded induced matching treewidth

1 citations · 2 across the 18 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2022

Computing Tree Decompositions with Small Independence Number

Clément Dallard, Fedor V. Fomin, Petr A. Golovach +2

The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the mini…