Mathematics
Parameterized Complexity
71%
Kernelization
46%
Graph in graph theory
42%
Fixed-parameter Algorithms
34%
NP-complete problem
30%
Deletion
29%
Data Reduction
29%
Arc Routing
28%
Hitting Set
25%
Arc of a curve
24%
Routing
22%
Routing Problem
22%
Hypergraph
21%
kernel
20%
Partitioning
19%
NP-hardness
18%
Open Shop
17%
Dissolution
16%
Linear Time
15%
Parameterized Algorithms
15%
Polynomial time
14%
Perfect Graphs
13%
Scheduling Problem
12%
Approximation Algorithms
12%
Lower bound
11%
Partition
10%
Multigraph
10%
Fixed-parameter Tractability
10%
Interval
10%
Matroid Intersection
10%
Approximation
10%
Matching Problem
9%
Interval Graphs
9%
Computational Complexity
9%
Chinese Postman Problem
9%
Packing
9%
Scheduling
8%
Dominating Set
8%
Matroid
8%
Wireless Sensor Networks
8%
Disjoint
8%
Eulerian Graph
8%
Independent Set
8%
Machine Scheduling
8%
Biological Networks
7%
Partial
7%
Feature Selection
7%
Execution Time
7%
Facility Location
7%
Complexity Analysis
7%
Engineering & Materials Science
NP-hard
100%
Data reduction
51%
Scheduling
28%
Hardness
22%
Set theory
22%
Approximation algorithms
22%
Computational complexity
19%
Formal languages
10%
Parameterization
10%
Separators
8%
Failure analysis
7%
Combinatorial optimization
6%
Structural properties
6%
Travel time
6%
Linear programming
5%
Decomposition
5%
