@InProceedings{gibney_et_al:LIPIcs.ESA.2019.51,
author = {Gibney, Daniel and Thankachan, Sharma V.},
title = {{On the Hardness and Inapproximability of Recognizing Wheeler Graphs}},
booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)},
pages = {51:1--51:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-124-5},
ISSN = {1868-8969},
year = {2019},
volume = {144},
editor = {Bender, Michael A. and Svensson, Ola 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.2019.51},
URN = {urn:nbn:de:0030-drops-111728},
doi = {10.4230/LIPIcs.ESA.2019.51},
annote = {Keywords: Burrows–Wheeler transform, string algorithms, suffix trees, NP-completeness}
}