Koana, Tomohiro; Froese, Vincent; Niedermeier, Rolf The complexity of binary matrix completion under diameter constraints. (English) Zbl 07639677 J. Comput. Syst. Sci. 132, 45-67 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{T. Koana} et al., J. Comput. Syst. Sci. 132, 45--67 (2023; Zbl 07639677) Full Text: DOI arXiv
Han, Yo-Sub; Ko, Sang-Ki; Ng, Timothy; Salomaa, Kai Closest substring problems for regular languages. (English) Zbl 1497.68268 Theor. Comput. Sci. 862, 144-154 (2021). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{Y.-S. Han} et al., Theor. Comput. Sci. 862, 144--154 (2021; Zbl 1497.68268) Full Text: DOI
Bulteau, Laurent; Schmid, Markus L. Consensus strings with small maximum distance and small distance sum. (English) Zbl 1432.68190 Algorithmica 82, No. 5, 1378-1409 (2020). MSC: 68Q27 68W32 PDFBibTeX XMLCite \textit{L. Bulteau} and \textit{M. L. Schmid}, Algorithmica 82, No. 5, 1378--1409 (2020; Zbl 1432.68190) Full Text: DOI Link
Bulteau, Laurent; Schmid, Markus L. Consensus strings with small maximum distance and small distance sum. (English) Zbl 1508.68133 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 1, 15 p. (2018). MSC: 68Q27 68W32 PDFBibTeX XMLCite \textit{L. Bulteau} and \textit{M. L. Schmid}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 1, 15 p. (2018; Zbl 1508.68133) Full Text: DOI