Latin Rectangle Completion

Latin Rectangle Completion is a combinatorial optimization problem in experimental design that involves extending a partially filled rectangular array of symbols into a complete Latin rectangle such that no symbol repeats in any row or column, thereby enabling valid inference in structured factorial settings.

3

Publications

245

Citations

7

Authors

5

Institutions

Publications per year

2017–2026

1

Authors

7

  1. DO
    Deryk Osthus

    University of Birmingham, United Kingdom

    1 publications · 26 citations

    1

    h-index

  2. AL
    Allan Lo

    University of Birmingham, United Kingdom

    1 publications · 26 citations

    1

    h-index

  3. CJ
    Charles J. Colbourn

    Arizona State University, United States

    1 publications · 189 citations

    1

    h-index

  4. DK
    Daniela Kühn

    University of Birmingham, United Kingdom

    1 publications · 26 citations

    1

    h-index

  5. BB
    Ben Barber

    University of Birmingham, United Kingdom

    1 publications · 26 citations

    1

    h-index

1–5 of 7

Venues

  1. Journal of Combinatorial Theory Series A

    1 publications · 26 citations

    1

    h-index

  2. Discrete Applied Mathematics

    1 publications · 189 citations

    1

    h-index

  3. Canadian Mathematical Bulletin

    CMB · 1 publications · 30 citations

    1

    h-index

1–3