Tag: parameterized-complexity
Found 52 results for 'parameterized-complexity'.
1) cc.complexity-theory - Hardness of parameterized CLIQUE?
2) graph-algorithms - Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
3) cc.complexity-theory - A variant of maximum matching: disjunctive constraints on the endpoints' degrees of edges in matching
4) graph-theory - Do "outer-bounded-genus" graphs have constant treewidth?
5) ds.algorithms - Hardness of Subgraph isomorphism problem for sparse pattern graph
6) reference-request - Gentle introduction to the algorithmic aspects of tree-depth
7) reference-request - Maximum Treewidth of a Graphs with $m$ Edges
8) cc.complexity-theory - Natural complete problems in higher levels of the $\mathsf{W}$-hierarchy
9) parameterized-complexity - Parameterized complexity of tree/branch decomposition
10) cc.complexity-theory - Are there any parameterized problems in non-uniform FPT that are suspected (but not proven) to be in uniform-FPT?
11) ds.algorithms - Parameterized complexity of graph intersection number
12) cc.complexity-theory - Using Kolmogorov complexity as input "size"
13) cc.complexity-theory - Nontrivial Algorithms for Coloring (Parameterized by Pathwidth)
14) counting-complexity - Is it known whether counting $q$-dimensional $p$-matching is $\#W[1]$-Hard?
15) graph-algorithms - Node-weighted steiner problem with few terminals
16) cc.complexity-theory - Parameterized complexity of inclusion of regular languages
17) cc.complexity-theory - On Random Self-reducible properties
18) cc.complexity-theory - Name for "uniformly polynomial" subclass of XP?
19) cc.complexity-theory - Easy decision hard counting Parametrized
20) ds.algorithms - W[1]-hard problems with FPT time approximation algorithms
21) parameterized-complexity - Complement problems are not in the same class in parametrized complexity hierarchy? If not in $P$
22) parameterized-complexity - Natural maximization problems in FPT
23) parameterized-complexity - Reducing Parameterized Problems (whose solution size can be "large") to W[i]-complete problems (for fixed i)
24) parameterized-complexity - Proving membership in W-hierarchy when problem is not parameterized by its solution size
25) cc.complexity-theory - Parametrized complexity of the 2-Long Paths Problem
26) cc.complexity-theory - Has parameterized complexity led to better algorithms?
27) cc.complexity-theory - Instance of FPT-reductions that is not a polynomial-time reduction
28) computability - Is there a sensible notion of an approximation algorithm for an undecidable problem?
29) reference-request - parameterized algorithms for geometric set cover
30) ds.algorithms - Parametrized Algorithm for Finding Bicliques
31) graph-theory - Graph theory: definiton of the crown of a graph
32) parameterized-complexity - Polynomial kernel for $k$-FLIP SAT on $3$-CNF formulas
33) reference-request - Major open problems on polynomial kernel (non) existence
34) ds.algorithms - Edit distance with move operations
35) circuit-complexity - OR-weft Hierarchy
36) cc.complexity-theory - Parametrized Complexity of Counting Bicliques
37) cc.complexity-theory - What is the parameterized complexity of following model checking problem?
38) parameterized-complexity - Any results on binary boolean CSP beyond the fixed-parameter tractability of almost 2SAT problem?
39) computability - Is there a sensible notion of an approximation algorithm for an undecidable problem?
40) ds.algorithms - Parameterized algorithm when the parameter is not known in advance?
41) parameterized-complexity - Reducing Parameterized Problems (whose solution size can be "large") to W[i]-complete problems (for fixed i)
42) ds.algorithms - Vertex disjoint simple paths of length k
43) cc.complexity-theory - Is parametrized maximum independent clauses problem in FPT?
44) graph-algorithms - Crown Rule Reduction In Parameterized Complexity - Vertex Cover - Notion Question
45) cc.complexity-theory - Hitting sets with a subfamily
46) parameterized-complexity - Parameterized complexity of Exact Cover
47) cc.complexity-theory - Consequences of a distillation algorithm for PSPACE
48) reference-request - Is there a W[1]-hard problem that can be solved in $2^{o(n)}$ time?
49) np-hardness - Positive 1-in-3 SAT FPT or Fixed Parameter Intractable
50) cc.complexity-theory - Treewidth relations between Boolean formulas and Tseitin encodings