@InProceedings{besa_et_al:LIPIcs.FUN.2021.4,
author = {Besa, Juan Jose and Johnson, Timothy and Mamano, Nil and Osegueda, Martha C.},
title = {{Taming the Knight’s Tour: Minimizing Turns and Crossings}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.4},
URN = {urn:nbn:de:0030-drops-127654},
doi = {10.4230/LIPIcs.FUN.2021.4},
annote = {Keywords: Graph Drawing, Chess, Hamiltonian Cycle, Approximation Algorithms}
}