Go to the corresponding LIPIcs Volume Portal 
Duraj, Lech ; Künnemann, Marvin ; Polak, Adam
pdfformat: 

@InProceedings{duraj_et_al:LIPIcs:2018:8570, author = {Lech Duraj and Marvin K{\"u}nnemann and Adam Polak}, title = {{Tight Conditional Lower Bounds for Longest Common Increasing Subsequence}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {15:115:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770514}, ISSN = {18688969}, year = {2018}, volume = {89}, editor = {Daniel Lokshtanov and Naomi Nishimura}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8570}, URN = {urn:nbn:de:0030drops85706}, doi = {10.4230/LIPIcs.IPEC.2017.15}, annote = {Keywords: finegrained complexity, combinatorial pattern matching, sequence alignments, parameterized complexity, SETH} }
Keywords:  finegrained complexity, combinatorial pattern matching, sequence alignments, parameterized complexity, SETH  
Seminar:  12th International Symposium on Parameterized and Exact Computation (IPEC 2017)  
Issue Date:  2018  
Date of publication:  23.02.2018 