Duraj, Lech; Künnemann, Marvin; Polak, Adam Tight conditional lower bounds for longest common increasing subsequence. (English) Zbl 1430.68116 Algorithmica 81, No. 10, 3968-3992 (2019). MSC: 68Q17 68Q27 68W32 PDFBibTeX XMLCite \textit{L. Duraj} et al., Algorithmica 81, No. 10, 3968--3992 (2019; Zbl 1430.68116) Full Text: DOI arXiv
Duraj, Lech; Künnemann, Marvin; Polak, Adam Tight conditional lower bounds for longest common increasing subsequence. (English) Zbl 1443.68068 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 15, 13 p. (2018). MSC: 68Q17 68Q27 68W32 PDFBibTeX XMLCite \textit{L. Duraj} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 15, 13 p. (2018; Zbl 1443.68068) Full Text: DOI