@InProceedings{bannai_et_al:LIPIcs.ESA.2022.12,
author = {Bannai, Hideo and Goto, Keisuke and Ishihata, Masakazu and Kanda, Shunsuke and K\"{o}ppl, Dominik and Nishimoto, Takaaki},
title = {{Computing NP-Hard Repetitiveness Measures via MAX-SAT}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.12},
URN = {urn:nbn:de:0030-drops-169505},
doi = {10.4230/LIPIcs.ESA.2022.12},
annote = {Keywords: repetitiveness measures, string attractor, bidirectional macro scheme}
}