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
Parents
3
The complexity of completing partial Latin squares
Charles J. Colbourn · Discrete Applied Mathematics · 1984 · 189 citations
On Completing Latin Rectangles
Charles C. Lindner · Canadian Mathematical Bulletin · 1970 · 30 citations · Full text
1–3 of 3
7
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 7
5

University of Saskatchewan
Saskatoon, Canada
1 h-index
1 publications
189 citations

University of Bristol
Bristol, United Kingdom
1 h-index
1 publications
26 citations
Heilbronn Institute for Mathematical Research
Bristol, United Kingdom
1 h-index
1 publications
26 citations

University of Birmingham
Birmingham, United Kingdom
1 h-index
4 publications
104 citations
Auburn University
Auburn, United States
1 h-index
1 publications
30 citations
1–5 of 5
1 publications · 26 citations
1
h-index
1 publications · 189 citations
1
h-index
CMB · 1 publications · 30 citations
1
h-index
1–3