Keyphrases
Exponential Lower Bounds
66%
Choosability
55%
Double Exponential
33%
Partial Maximum Satisfiability
33%
Tight
33%
Arithmetic Progressions
33%
Target Set Selection Problem
33%
Paired-domination
33%
Treewidth
22%
MaxSAT
22%
Maximum Satisfiability Problem
22%
Polynomial Factorial
22%
Runtime Complexity
22%
Exponential-time Algorithms
22%
Exponential Bound
22%
Dominating Set Problem
20%
Strong Exponential Time Hypothesis
20%
Cluster Editing
16%
Feedback Vertex Set
16%
Additive Utility Function
16%
Envy-freeness
16%
List Coloring
13%
Clique-width
13%
Domination Problems
13%
Paired Dominating Set
13%
Gallai-Edmonds Decomposition
11%
Path Length
11%
Maximum Satisfiability
11%
Computational Complexity
11%
Karl Marx
11%
Time Algorithm
11%
Complete Problems
11%
Cutwidth
11%
Network Valuation
8%
XP Algorithm
8%
Exact Exponential Algorithms
6%
List Assignment
6%
Split Graphs
6%
Dual Parameterization
6%
Polynomial Kernel
6%
Vertex Cover
6%
List Chromatic number
6%
Vertexing Algorithms
6%
Exponential Time Hypothesis
6%
Stack Exchange
6%
Single-exponential Algorithm
6%
Biclique
6%
Dominating Set
6%
Kernel on Graph
6%
Cluster Graph
6%
Mathematics
Choosability
100%
Integer
44%
Running Time
40%
Exponential Time
40%
Exponential Polynomial
33%
Central Role
33%
Exponential Bound
33%
Arithmetic Progression
33%
Factorials
33%
Counterexample
33%
Bounded Number
33%
Dominating Set
33%
Utility Function
33%
Chromatic Number
6%
List Coloring Problem
6%
Clique
6%
Polynomial
6%
Upper Bound
6%
Intractability
6%
Perfect Matchings
5%
