1322 search results - page 10 / 265 » Parameterized counting problems |
WG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
ACID
2006
13 years 9 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...