Mathematics
Parameterized Complexity
100%
Graph in graph theory
64%
Kernelization
62%
Fixed-parameter Algorithms
46%
NP-complete problem
41%
Hitting Set
34%
Arc Routing
33%
Data Reduction
32%
Hypergraph
29%
Routing Problem
25%
NP-hardness
24%
Partitioning
22%
Routing
22%
Open Shop
21%
Linear Time
21%
Parameterized Algorithms
20%
Polynomial time
20%
Perfect Graphs
18%
Approximation Algorithms
15%
Lower bound
15%
Scheduling Problem
14%
Multigraph
14%
Fixed-parameter Tractability
13%
Matroid Intersection
13%
Interval Graphs
13%
Matching Problem
12%
Matroid
11%
Chinese Postman Problem
11%
Packing
11%
Computational Complexity
11%
Eulerian Graph
11%
Treewidth
10%
Partial Order
9%
Complexity Theory
9%
Machine Scheduling
9%
Covering Problem
9%
Facility Location
9%
Chordal Graphs
9%
Complexity Analysis
8%
Packing Problem
8%
Scheduling
8%
Biological Networks
8%
Location Problem
8%
Bipartite Graph
8%
Perfect Matching
8%
Bipartite Permutation Graphs
8%
Travelling salesman problems
8%
Hardness
8%
Linear Space
7%
Set Packing
7%
Engineering & Materials Science
Data reduction
50%
Hardness
42%
Scheduling
37%
Computational complexity
35%
Approximation algorithms
25%
Formal languages
14%
Parameterization
13%
Failure analysis
10%
Data structures
6%
Feature extraction
6%
Structural properties
6%
Wireless sensor networks
6%
Resource allocation
5%
Separators
5%
