71 search results - page 2 / 15 » Kernelizations for Parameterized Counting Problems |
76
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
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 in...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
112
Voted
LATA
2009
Springer
15 years 4 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
108
click to vote
FAW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...