Mathematics
Parameterized Algorithms
100%
Parameterized Complexity
66%
Graph in graph theory
44%
Deletion
41%
Vertex of a graph
37%
kernel
35%
Feedback Vertex Set
25%
Packing
25%
Max-cut
23%
Polynomial
21%
Cycle
21%
Path
20%
Unit Disk Graph
20%
Color
19%
Deterministic Algorithm
16%
Packing Problem
16%
NP-complete problem
16%
Digraph
15%
Vertex Cover
15%
Exponential time
15%
Spanning tree
14%
Tournament
14%
Query
13%
Randomized Algorithms
13%
Partial Information
12%
Stable Marriage
12%
Subgraph
12%
Treewidth
12%
Integer
12%
Disjoint
11%
Fixed-parameter Algorithms
11%
Hitting Set
11%
Matching Problem
11%
Approximation Algorithms
11%
Design
11%
Approximation Scheme
10%
Parameterization
10%
Branching
10%
Separator
10%
Subset
10%
Search Trees
9%
Independent Set
9%
Coding
9%
Trade-offs
9%
Minor
9%
Stable Matching
9%
Biological Networks
9%
Leaves
8%
Internal
8%
Kernelization
8%
Engineering & Materials Science
Polynomials
81%
NP-hard
47%
Approximation algorithms
32%
Feedback
30%
Directed graphs
26%
Color
23%
Parameterization
18%
Genes
17%
Computational geometry
17%
Genomics
17%
Set theory
14%
Coloring
14%
Computer science
11%
Visibility
11%
Decomposition
10%
Hamiltonians
10%
Hardness
10%
Graph theory
10%
Structural properties
9%
Dynamic programming
8%
Chromosomes
8%
Computational complexity
8%
Motion planning
8%
Tumors
7%
Multivariate Analysis
7%
Topology
7%
Data reduction
6%
Separators
6%
Stars
5%
Sieves
5%
Robots
5%
Modulators
5%
