359 search results - page 36 / 72 » The Parameterized Complexity of Counting Problems |
103
Voted
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
SIGDOC
2000
ACM
15 years 2 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
113
Voted
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
104
Voted
STACS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
170
Voted
DISOPT
2011
14 years 5 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...