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