\begin{thebibliography}{10}

\bibitem{AppaMM06-MOLS}
G.~Appa, D.~Magos, and I.~Mourtos, Searching for mutually orthogonal {Latin}
  squares via integer and constraint programming, {\em European J. Oper. Res.}
  {\bf 173} (2006), 519--530.

\bibitem{BennettDZ03-SODLS}
F.~E. Bennett, B.~Du, and H.~Zhang, Existence of self-orthogonal diagonal
  {Latin} squares with a missing subsquare, {\em Discrete Math.} {\bf 261}
  (2003), 69--86.

\bibitem{BHMW2021-SatHandbook2ed}
A.~Biere, M.~Heule, H.~van Maaren, and T.~Walsh, editors, {\em Handbook of
  {Satisfiability}}, {IOS} Press, second edition, 2021.

\bibitem{BrightCSKG21-Lam}
C.~Bright, K.~K.~H. Cheung, B.~Stevens, I.~S. Kotsireas, and V.~Ganesh, A
  {SAT}-based resolution of {Lam}'s problem, In {\em Proc. AAAI 2021}, pp.
  3669--3676. {AAAI} Press, 2021.

\bibitem{Bright2020}
C.~Bright, J.~Gerhard, I.~S. Kotsireas, and V.~Ganesh, Effective problem
  solving using {SAT} solvers, In {\em Proc. Maple in Mathematics Education and
  Research 2019}, Vol. 1125 of {\em Commun. Comput. Inf. Sci.}, pp.  205--219.
  Springer, 2019.

\bibitem{bright2025}
C.~Bright, A.~Keita, and B.~Stevens, Myrvold's results on orthogonal triples of
  $10 \times 10$ {Latin} squares: A {SAT} investigation, arXiv preprint
  arXiv:2503.10504 [math.CO], 2025.
\newblock Available at \url{https://arxiv.org/abs/2503.10504}.

\bibitem{bright2025b}
C.~Bright, A.~Keita, and B.~Stevens, Orthogonal {Latin} squares of order 10
  with two relations: A {SAT} investigation, {\em Discrete Math. Algorithms
  Appl.}  (2025), to appear.

\bibitem{Brown1992}
J.~W. Brown, F.~Cherry, L.~Most, E.~T. Parker, and W.~D. Wallis, Completion of
  the spectrum of orthogonal diagonal {Latin} squares.
\newblock In {\em Graphs, Matrices, and Designs}, pp.  43--50. Routledge, 1993.

\bibitem{BurgerKV2010-SOLS10}
A.~P. Burger, M.~P. Kidd, and J.~H. van Vuuren, Enumerasie van self-ortogonale
  {Latynse} vierkante van orde 10, {\em Litnet Akademies (Natuurwetenskappe)}
  {\bf 1} (2010), 1--22.

\bibitem{Cook71-NPcompl}
S.~A. Cook, The complexity of theorem-proving procedures, In {\em Proc. STOC
  1971}, pp.  151--158. {ACM}, 1971.

\bibitem{DowlingG84-UP}
W.~F. Dowling and J.~H. Gallier, Linear-time algorithms for testing the
  satisfiability of propositional {Horn} formulae, {\em J. Log. Program.} {\bf
  1} (1984), 267--284.

\bibitem{EganW16-MOLSn9}
J.~Egan and I.~M. Wanless, Enumeration of {MOLS} of small order, {\em Math.
  Comput.} {\bf 85} (2016), 799--824.

\bibitem{GebserKS12-Clasp}
M.~Gebser, B.~Kaufmann, and T.~Schaub, Conflict-driven answer set solving: From
  theory to practice, {\em Artificial Intelligence} {\bf 187} (2012), 52--89.

\bibitem{GillW23-MOLSnontriv}
M.~J. Gill and I.~M. Wanless, Pairs of {MOLS} of order ten satisfying
  non-trivial relations, {\em Des. Codes Cryptogr.} {\bf 91} (2023),
  1293--1313.

\bibitem{GrahamR2006-SOLS10}
G.~P. Graham and C.~E. Roberts, Enumeration and isomorphic classification of
  self-orthogonal {Latin} squares, {\em J. Combin. Math. Combin. Comput.} {\bf
  59} (2010), 101--118.

\bibitem{Hedayat73-SOLS10}
A.~Hedayat, An application of sum composition: {A} self orthogonal {Latin
  Square} of order ten, {\em J. Comb. Theory {A}} {\bf 14} (1973), 256--260.

\bibitem{HeuleKB18-CnCchapter}
M.~Heule, O.~Kullmann, and A.~Biere, {Cube-and-Conquer} for {Satisfiability}.
\newblock In {\em Handbook of Parallel Constraint Reasoning}, pp.  31--59.
  Springer, 2018.

\bibitem{HeuleM06-March}
M.~Heule and H.~van Maaren, March{\_}dl: Adding adaptive heuristics and a new
  branching strategy, {\em Journal on Satisfiability, Boolean Modeling and
  Computation} {\bf 2} (2006), 47--59.

\bibitem{HuangLGMZ19-OrthGolf}
P.~Huang, M.~Liu, C.~Ge, F.~Ma, and J.~Zhang, Investigating the existence of
  orthogonal golf designs via {Satisfiability} testing, In {\em Proc. ISSAC},
  pp.  203--210. {ACM}, 2019.

\bibitem{JinLGMZ21-CostasLS}
J.~Jin, Y.~Lv, C.~Ge, F.~Ma, and J.~Zhang, Investigating the existence of
  {Costas} {Latin} squares via satisfiability testing, In {\em Proc. SAT 2021},
  Vol. 12831 of {\em Lect. Notes in Comp. Sci.}, pp.  270--279. Springer, 2021.

\bibitem{KeedwellD2015-LatinSquares}
A.~D. Keedwell and J.~D\'enes, {\em Latin Squares and their Applications},
  North-Holland, second edition, 2015.

\bibitem{Knuth2000-DLX}
D.~Knuth, Dancing links.
\newblock In {\em Millennial Perspectives in Computer Science}, pp.  187--214.
  Red Globe Press, 2000.

\bibitem{KochemazovZS17-DLX}
S.~Kochemazov, O.~Zaikin, and A.~Semenov, Runtime estimation for enumerating
  all mutually orthogonal diagonal {Latin} squares of order 10, In {\em Proc.
  MIPRO 2017}, pp.  1166--1171. {IEEE}, 2017.

\bibitem{KochemazovZVB20-JIS}
S.~Kochemazov, O.~Zaikin, E.~Vatutin, and A.~Belyshev, Enumerating diagonal
  {Latin} squares of order up to 9, {\em J. Integer Seq.} {\bf 23} (2020),
  20.1.2.

\bibitem{LamTS89}
C.~W.~H. Lam, L.~Thiel, and S.~Swierz, The nonexistence of finite projective
  planes of order 10, {\em Canad. J. Math.} {\bf 41} (1989), 1117--1123.

\bibitem{LiuHJHMZZ23-HoleyLS}
M.~Liu, R.~Han, F.~Jia, P.~Huang, F.~Ma, H.~Zhang, and J.~Zhang, Investigating
  the existence of {Holey} {Latin} squares via satisfiability testing, In {\em
  Proc. PRICAI 2023}, Vol. 14326 of {\em Lect. Notes in Comp. Sci.}, pp.
  410--422. Springer, 2023.

\bibitem{LuLZ11-DSOLS10}
R.~Lu, S.~Liu, and J.~Zhang, Searching for doubly self-orthogonal {Latin}
  squares, In {\em Proc. CP 2011}, Vol. 6876 of {\em Lect. Notes in Comp.
  Sci.}, pp.  538--545. Springer, 2011.

\bibitem{Mann1942}
H.~B. Mann, The construction of orthogonal {Latin} squares, {\em Ann. Math.
  Stat.} {\bf 13} (1942), 418--423.

\bibitem{McKayMM07-SmallLS}
B.~D. McKay, A.~Meynert, and W.~Myrvold, Small {Latin squares}, quasigroups,
  and loops, {\em J. Combin. Des.} {\bf 15} (2007), 98--119.

\bibitem{NguyenNKB20-AmoSAT}
V.{-}H. Nguyen, V.{-}Q. Nguyen, K.~Kim, and P.~Barahona, Empirical study on
  {SAT}-encodings of the at-most-one constraint, In {\em Proc. SMA 2020}, pp.
  470--475. {ACM}, 2020.

\bibitem{web:cluster}
A.~Novopashin, Irkutsk supercomputer center of {SB RAS}, 2025.
\newblock Available at \url{https://hpc.icc.ru}.

\bibitem{Parker1963-MOLS10}
E.~T. Parker, Computer investigation of orthogonal {Latin} squares of order
  ten, {\em Proc. Symp. Appl. Math.} {\bf 15} (1963), 73--81.

\bibitem{RubinBCS21-CPindexEnc}
N.~Rubin, C.~Bright, K.~K.~H. Cheung, and B.~Stevens, Improving integer and
  constraint programming for {Graeco-Latin} squares, In {\em Proc. ICTAI 2021},
  pp.  604--608. {IEEE}, 2021.

\bibitem{web:OEIS}
N.~J.~A. Sloane, The on-line encyclopedia of integer sequences, 2025.
\newblock Available at \url{https://oeis.org}.

\bibitem{SoosNC09-Cryptominisat}
M.~Soos, K.~Nohl, and C.~Castelluccia, Extending {SAT} solvers to cryptographic
  problems, In {\em Proc. SAT 2009}, Vol. 5584 of {\em Lect. Notes in Comp.
  Sci.}, pp.  244--257. Springer, 2009.

\bibitem{VatutinB20-ESODLS}
E.~Vatutin and A.~Belyshev, Enumerating the orthogonal diagonal {Latin} squares
  of small order for different types of orthogonality, In {\em Proc. RuSCDays
  2020}, Vol. 1331 of {\em Commun. Comput. Inf. Sci.}, pp.  586--597. Springer,
  2020.

\bibitem{VatutinZ2023-CMS-SAT}
E.~Vatutin and O.~Zaikin, Classification of cells mapping schemes related to
  orthogonal diagonal {Latin} squares of small order, In {\em Proc. RuSCDays
  2023}, Vol. 14389 of {\em Lect. Notes in Comp. Sci.}, pp.  21--34. Springer,
  2023.

\bibitem{VatutinZKV17-OpenEng}
E.~Vatutin, O.~Zaikin, S.~Kochemazov, and S.~Valyaev, Using volunteer computing
  to study some features of diagonal {Latin} squares, {\em Open Engineering}
  {\bf 7} (2017), 453--460.

\bibitem{VatutinZMN2021-CMS}
E.~Vatutin, O.~Zaikin, M.~Manzyuk, and N.~Nikitina, Searching for orthogonal
  {Latin} squares via cells mapping and {BOINC}-based {Cube-and-Conquer}, In
  {\em Proc. RuSCDays 2021}, Vol. 1510 of {\em Commun. Comput. Inf. Sci.}, pp.
  498--512. Springer, 2021.

\bibitem{Wanless01-MOLS}
I.~M. Wanless, Answers to questions by {D{\'{e}}nes} on {Latin} power sets,
  {\em Eur. J. Comb.} {\bf 22} (2001), 1009--1020.

\bibitem{Zaikin2022-IJCAI}
O.~Zaikin, Inverting 43-step {MD4} via cube-and-conquer, In {\em Proc. IJCAI
  2022}, pp.  1894--1900. ijcai.org, 2022.

\bibitem{web:sources}
O.~Zaikin, Searching for combinatorial designs based on {Latin} squares, 2025.
\newblock Available at \url{https://github.com/olegzaikin/latinsquares}.

\bibitem{ZaikinZKV16-ENDM}
O.~Zaikin, A.~Zhuravlev, S.~Kochemazov, and E.~Vatutin, On the construction of
  triples of diagonal {Latin} squares of order 10, {\em Electronic Notes in
  Discrete Mathematics} {\bf 54} (2016), 307--312.

\end{thebibliography}
