121 citations · 373 across the 96 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009★ 1 cited
Faster Algorithms for Finding and Counting Subgraphs
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman +2
In this paper we study a natural generalization of both {\sc -Path} and {\sc -Tree} problems, namely, the {\sc Subgraph Isomorphism} problem. In the {\sc Subgraph Isomorphism…
cs.DM2009★ 19 cited
(Meta) Kernelization
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov +3
In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of th…