Johan M. M. van Rooij
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from public sources and our publisher partners.
For the vast majority of local problems on graphs of small tree width (where by local we mean that a solution can be verified by checking separately the neighbourhood of each vertex), standard… Expand
In this paper we present a faster exact exponential timealgorithm for the edge dominating set problem. Our algorithm usesO(1.3226n) time and polynomial space. The algorithm combines an… Expand
We first propose a method, called “bottom-up method” that, informally, “propagates” improvement of the worst-case complexity for “sparse” instances to “denser” ones and we show an easy though… Expand
In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph,… Expand
We consider the Partition Into Triangles problem on bounded degree graphs. We show that this problem is polynomial-time solvable on graphs of maximum degree three by giving a linear-time algorithm.… Expand
Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been… Expand
In this paper, two central techniques from the field of exponential time algorithms are combined for the first time: inclusion/exclusion and branching with measure and conquer analysis.
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 propose to … Expand
An edge dominating set in a graph G=(V,E) is a subset of the edges D⊆E such that every edge in E is adjacent or equal to some edge in D. The problem of finding an edge dominating set of minimum… Expand
Suppose a graph G is given with two vertex-disjoint sets of vertices Z"1 and Z"2. Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that… Expand