# Hans L. Bodlaender

- Publications
- Influence

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.**In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$… Expand

Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel, is a polynomial-time transformation that transforms any given… Expand

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform… Expand

A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions, algorithms that… Expand

In this paper, we give, for constant k, a linear time algorithm, that given a graph G = (V, E), determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G with… Expand

Abstract. We present an algorithm that constructively produces a solution to the k -DOMINATING SET problem for planar graphs in time O(c^ \sqrt k n) , where c=4^ 6\sqrt 34 . To obtain this result, we… Expand

In this paper we give, for all constantsk,l, explicit algorithms that, given a graphG=(V,E) with a tree-decomposition ofGwith treewidth at mostl, decide whether the treewidth (or pathwidth) ofGis at… Expand

We introduce the framework of cross-composition for proving kernelization lower bounds. A classical problem $L$ \and/or-cross-composes into a parameterized problem $\mathcal{Q}$ if it is possible to… Expand

In this paper we consider the following game: players must alternately color the lowest numbered uncolored vertex of a given graph G= ({1, 2,…, n}, E) with a color, taken from a given set C, such… Expand

32 that a canonical ordering or a 4-connected triangular planar graph is possible, in which every vertex v k has out(v k) 2, which decreases the width of a visibility representation by a factor 2.… Expand