#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1991

2018

- This year (1)
- Last 5 years (3)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk
- 2011 IEEE 52nd Annual Symposium on Foundations of…
- 2011

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… (More)

- Johan M. M. van Rooij, Hans L. Bodlaender
- Algorithmica
- 2008

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… (More)

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,… (More)

- Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
- Theory of Computing Systems
- 2011

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.… (More)

- Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
- Algorithmica
- 2010

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… (More)

- Wouter Stam, Peter V. M. Bot, Stella A. Boele-Bos, Johan M. M. van Rooij, Caty van den Hoek
- Helgoländer Meeresuntersuchungen
- 2006

DNA-DNA hybridizations between single-copy nuclear DNA fromLaminaria digitata and total DNA fromL. saccharina, L. Hyperborea, L. rodriguezii, L. ochroleuca andChorda filum, respectively, show that… (More)

- Johan M. M. van Rooij, Hans L. Bodlaender
- Discrete Applied Mathematics
- 2011

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. This approach is used in this paper… (More)

- Johan M. M. van Rooij
- CIAC
- 2010

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… (More)

- Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk
- Algorithmica
- 2009

Inclusion/exclusion and measure and conquer are two central techniques from the field of exact exponential-time algorithms that recently received a lot of attention. In this paper, we show that both… (More)