Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{duraj:LIPIcs:2020:11902, author = {Lech Duraj}, title = {{A SubQuadratic Algorithm for the Longest Common Increasing Subsequence Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {41:141:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771405}, ISSN = {18688969}, year = {2020}, volume = {154}, editor = {Christophe Paul and Markus Bl{\"a}ser}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11902}, URN = {urn:nbn:de:0030drops119020}, doi = {10.4230/LIPIcs.STACS.2020.41}, annote = {Keywords: longest common increasing subsequence, logshaving, matching pairs} }
Keywords:  longest common increasing subsequence, logshaving, matching pairs  
Collection:  37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  
Issue Date:  2020  
Date of publication:  04.03.2020 