Covering Designs

Covering Design is a combinatorial structure consisting of a family of subsets of a finite set such that every subset of a specified size is contained in at least one member of the family, distinguished from other set systems by its minimality and coverage requirements for uniform block intersections.

90

Publications

3.2K

Citations

179

Authors

101

Institutions

Publications per year

2017–2026

7

Variants

Covering Design

Authors

179

  1. CJ
    Charles J. Colbourn

    Arizona State University, United States

    7 publications · 464 citations

    7

    h-index

  2. BS
    Brett Stevens

    Carleton University, Canada

    4 publications · 113 citations

    4

    h-index

  3. AM
    Ahmed M. Assaf

    Central Michigan University, United States

    3 publications · 31 citations

    3

    h-index

  4. JT
    José Torres-Jiménez

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    2 publications · 30 citations

    3

    h-index

  5. SM
    Sosina Martirosyan

    University of Duisburg-Essen, Germany

    3 publications · 242 citations

    3

    h-index

1–5 of 179

Venues

  1. Discrete Mathematics

    12 publications · 382 citations

    11

    h-index

  2. Journal of Combinatorial Designs

    JCD · 9 publications · 569 citations

    9

    h-index

  3. Designs Codes and Cryptography

    4 publications · 114 citations

    4

    h-index

  4. 3

    h-index

  5. European Journal of Combinatorics

    3 publications · 110 citations

    3

    h-index

1–5