%0 Conference Paper %1 conf/cpm/BrodalKKK06 %A Brodal, Gerth Stølting %A Kaligosi, Kanela %A Katriel, Irit %A Kutz, Martin %B CPM %D 2006 %E Lewenstein, Moshe %E Valiente, Gabriel %I Springer %K dblp %P 330-341 %T Faster Algorithms for Computing Longest Common Increasing Subsequences. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2006.html#BrodalKKK06 %V 4009 %@ 3-540-35455-7

@inproceedings{conf/cpm/BrodalKKK06, added-at = {2019-10-19T00:00:00.000+0200}, author = {Brodal, Gerth Stølting and Kaligosi, Kanela and Katriel, Irit and Kutz, Martin}, biburl = {https://www.bibsonomy.org/bibtex/29cdfbf12462750d209fcf82821b63370/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2006}, editor = {Lewenstein, Moshe and Valiente, Gabriel}, ee = {https://doi.org/10.1007/11780441_30}, interhash = {937c003b850294a436a2f810c682692c}, intrahash = {9cdfbf12462750d209fcf82821b63370}, isbn = {3-540-35455-7}, keywords = {dblp}, pages = {330-341}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-10-22T16:17:32.000+0200}, title = {Faster Algorithms for Computing Longest Common Increasing Subsequences.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2006.html#BrodalKKK06}, volume = 4009, year = 2006 }