• Publications
  • Influence
On problems without polynomial kernels
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 givenExpand
  • 510
  • 57
  • PDF
On the parameterized complexity of multiple-interval graph problems
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 toExpand
  • 283
  • 22
  • PDF
Treewidth governs the complexity of target set selection
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 inExpand
  • 91
  • 11
  • PDF
On Problems without Polynomial Kernels (Extended Abstract)
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 thatExpand
  • 84
  • 7
  • PDF
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
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 ofExpand
  • 68
  • 7
  • PDF
A Completeness Theory for Polynomial (Turing) Kernelization
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 forExpand
  • 56
  • 7
  • PDF
An exact almost optimal algorithm for target set selection in social networks
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 aExpand
  • 35
  • 7
  • PDF
Gene Maps Linearization Using Genomic Rearrangement Distances
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 withExpand
  • 15
  • 7
  • PDF
Constrained LCS: Hardness and Approximation
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 2Expand
  • 37
  • 5
  • PDF
The Minimum Substring Cover problem
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 theExpand
  • 15
  • 5
  • PDF