%0 Conference Paper %1 conf/stacs/Duraj20 %A Duraj, Lech %B STACS %D 2020 %E Paul, Christophe %E Bläser, Markus %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 41:1-41:18 %T A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#Duraj20 %V 154 %@ 978-3-95977-140-5

@inproceedings{conf/stacs/Duraj20, added-at = {2020-03-19T00:00:00.000+0100}, author = {Duraj, Lech}, biburl = {https://www.bibsonomy.org/bibtex/2834cbf1c06ea22e37fa4a31f16d8919c/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2020}, editor = {Paul, Christophe and Bläser, Markus}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2020.41}, interhash = {7c41f94eef6cca951b320264d8576a08}, intrahash = {834cbf1c06ea22e37fa4a31f16d8919c}, isbn = {978-3-95977-140-5}, keywords = {dblp}, pages = {41:1-41:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-08-26T07:21:20.000+0200}, title = {A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#Duraj20}, volume = 154, year = 2020 }