Mathematics
Covering Array
100%
Steiner Triple System
71%
Triple System
62%
Design
33%
Perfect Hash Family
25%
Transversal Design
25%
Exception
22%
Graph in graph theory
19%
Network Reliability
18%
Pairwise Balanced Design
18%
Partial
17%
Combinatorial Design
16%
Interaction
16%
Covering
12%
Vertex of a graph
12%
Steiner System
12%
Orthogonal Array
11%
Block Design
11%
Disk Array
11%
Family
10%
Necessary Conditions
10%
Fault
10%
Multigraph
10%
Group Divisible Design
10%
Mutually Orthogonal Latin Squares
9%
Coverage
9%
Packing
9%
Permutation
9%
Testing
8%
NP-complete problem
8%
Main Effect
8%
Magic square
8%
Consecutive
8%
Sufficient
8%
Balancing
8%
Chromatic Index
8%
Steiner Tree
7%
Class
7%
Cardinality
7%
Disjoint
7%
Lower bound
7%
Cover
7%
Matroid
7%
Scheduling
7%
Wavelength
7%
Traffic Grooming
7%
Domination
6%
Hadamard Matrix
6%
Permutation Graphs
6%
Graph Decomposition
6%
Engineering & Materials Science
Testing
23%
Polynomials
23%
Topology
16%
Scheduling
15%
Screening
13%
Software testing
12%
Throughput
10%
Medium access control
10%
Communication
9%
Labeling
8%
Design of experiments
8%
Network protocols
7%
Wireless networks
7%
Chemical analysis
6%
Recovery
6%
Hadamard matrices
6%
Coloring
5%
Computational methods
5%
Testbeds
5%
Decomposition
5%
Forward error correction
5%
Experiments
5%
NP-hard
5%