51 citations · 52 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 1 cited
Fast Algorithms for Join Operations on Tree Decompositions
Johan M. M. van Rooij
Treewidth is a measure of how tree-like a graph is. It has many important algorithmic applications because many NP-hard problems on general graphs become tractable when restricted…
cs.DS2008★ 51 cited
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
Johan M. M. Van Rooij, Hans L. Bodlaender
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we…