Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Invitation to fixed-parameter algorithms

- D. Thilikos
- Computer Science
- Comput. Sci. Rev.
- 1 December 2007

This is a review of the recent book by Rolf Niedermeier on fixed-parameter algorithms. It contains a critical description of the covered material, a comparison with other books dedicated to the same… Expand

Dominating sets in planar graphs: branch-width and exponential speed-up

- F. Fomin, D. Thilikos
- Computer Science, Mathematics
- SODA '03
- 12 January 2003

Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is… Expand

(Meta) Kernelization

- H. Bodlaender, F. Fomin, D. Lokshtanov, Eelko Penninkx, S. Saurabh, D. Thilikos
- Computer Science, Mathematics
- 50th Annual IEEE Symposium on Foundations of…
- 4 April 2009

Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every instance I comes with… Expand

On Graph Powers for Leaf-Labeled Trees

- N. Nishimura, P. Ragde, D. Thilikos
- Computer Science, Mathematics
- J. Algorithms
- 2002

We extend the well-studied concept of a graph power to that of a k-leaf powerG of a tree T: G is formed by creating a node for each leaf in the tree and an edge between a pair of nodes if and only if… Expand

Constructive Linear Time Algorithms for Branchwidth

- H. Bodlaender, D. Thilikos
- Mathematics, Physics
- ICALP
- 7 July 1997

Let G k be the class of graphs with branchwidth at most k. In this paper we prove that one can construct, for any k, a linear time algorithm that checks if a graph belongs to G k and, if so, outputs… Expand

Parameterized complexity of finding regular induced subgraphs

- H. Moser, D. Thilikos
- Mathematics, Computer Science
- J. Discrete Algorithms
- 1 June 2009

The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced subgraph in which… Expand

Searching Is Not Jumping

- L. Barrière, P. Fraigniaud, N. Santoro, D. Thilikos
- Computer Science, Mathematics
- WG
- 19 June 2003

This paper is concerned with the graph searching game: we are given a graph containing a fugitive (or lost) entity or item; the goal is to clear the edges of the graph, using searchers; an edge is… Expand

Bidimensionality and kernels

- F. Fomin, D. Lokshtanov, S. Saurabh, D. Thilikos
- Computer Science, Mathematics
- SODA '10
- 17 January 2010

Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005] as a tool to obtain sub-exponential… Expand

Fugitive-Search Games on Graphs and Related Parameters

- N. Dendris, L. Kirousis, D. Thilikos
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 10 February 1997

Abstract The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is assumed to… Expand

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up

- F. Fomin, D. Thilikos
- Computer Science, Mathematics
- ICALP
- 12 July 2004

Preprocessing by data reduction is a simple but powerful technique used for practically solving different network problems. A number of empirical studies shows that a set of reduction rules for… Expand