Mathematics
Approximability
14%
Approximation
16%
Approximation Algorithms
30%
Bicliques
17%
Binary Search Tree
18%
Bounded Treewidth
8%
Cactus
7%
Clique
9%
Connectivity
9%
Costs
11%
Customers
6%
Distributed Algorithms
7%
Dominating Set
5%
Edge Coloring
6%
Edge-connectivity
7%
Exponential time
12%
Fixed-parameter Algorithms
7%
Graph in graph theory
20%
Graph Powers
8%
Graph Products
14%
Hardness
18%
Hardness of Approximation
24%
Heuristics
7%
Inapproximability
8%
Independent Set
8%
Induced Matching
9%
Integrality
8%
Linear-time Algorithm
5%
Lower bound
7%
Maximum Independent Set
16%
Metric
6%
Metric Embeddings
8%
Minimum Cut
7%
Number system
7%
Partition
7%
Path
8%
Planar graph
10%
Poset
5%
Pricing
14%
Profit
6%
Rectangle
16%
Resources
5%
Shortest path
12%
Steiner Tree
15%
Subgraph
13%
Subset
6%
Triangle
9%
Vertex of a graph
12%
Vertical
5%
Engineering & Materials Science
Approximation algorithms
100%
Color
6%
Coloring
26%
Computational geometry
8%
Computer science
13%
Costs
26%
Data structures
7%
Fires
9%
Graph theory
7%
Hardness
45%
NP-hard
24%
Parallel algorithms
5%
Polynomials
24%
Profitability
5%
Relaxation
12%
Set theory
5%