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

- Publications
- Influence

On problems without polynomial kernels

- H. Bodlaender, R. Downey, M. Fellows, D. Hermelin
- Mathematics, Computer Science
- J. Comput. Syst. Sci.
- 1 December 2009

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

On the parameterized complexity of multiple-interval graph problems

- M. Fellows, D. Hermelin, Frances A. Rosamond, S. Vialette
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2009

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many applications of interval graphs also generalize to… Expand

Treewidth governs the complexity of target set selection

- Oren Ben-Zwi, D. Hermelin, D. Lokshtanov, I. Newman
- Computer Science, Mathematics
- Discret. Optim.
- 1 February 2011

In this paper we study the Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos; a problem which gives a nice clean combinatorial formulation for many applications arising in… Expand

On Problems without Polynomial Kernels (Extended Abstract)

- H. Bodlaender, R. Downey, M. Fellows, D. Hermelin
- Computer Science, Mathematics
- ICALP
- 7 July 2008

Kernelization is a central technique used in parameterized algorithms, and in other approaches for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that… Expand

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs

- M. Fellows, G. Fertin, D. Hermelin, S. Vialette
- Computer Science
- ICALP
- 9 July 2007

We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices whose multiset of… Expand

A Completeness Theory for Polynomial (Turing) Kernelization

- D. Hermelin, S. Kratsch, K. Soltys, Magnus Wahlström, Xi Wu
- Computer Science, Mathematics
- Algorithmica
- 1 March 2015

The framework of Bodlaender et al. (J Comput Sys Sci 75(8):423–434, 2009) and Fortnow and Santhanam (J Comput Sys Sci 77(1):91–106, 2011) allows us to exclude the existence of polynomial kernels for… Expand

An exact almost optimal algorithm for target set selection in social networks

- Oren Ben-Zwi, D. Hermelin, D. Lokshtanov, I. Newman
- Computer Science
- EC '09
- 6 July 2009

The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicine. Its input is a… Expand

Gene Maps Linearization Using Genomic Rearrangement Distances

- G. Blin, E. Blais, D. Hermelin, Pierre Guillon, M. Blanchette, N. El-Mabrouk
- Computer Science, Mathematics
- J. Comput. Biol.
- 15 June 2007

A preliminary step to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Different genetic mapping techniques often give rise to different maps with… Expand

Constrained LCS: Hardness and Approximation

- Zvi Gotthilf, D. Hermelin, Moshe Lewenstein
- Computer Science, Mathematics
- CPM
- 18 June 2008

The problem of finding the longest common subsequence (LCS) of two given strings A 1 and A 2 is a well-studied problem. The constrained longest common subsequence (C-LCS) for three strings A 1 , A 2… Expand

The Minimum Substring Cover problem

- D. Hermelin, Dror Rawitz, R. Rizzi, S. Vialette
- Computer Science
- Inf. Comput.
- 11 October 2007

In this paper we consider the problem of covering a set of strings S with a set C of substrings in S, where C is said to cover S if every string in S can be written as a concatenation of the… Expand