%0 Journal Article %1 journals/algorithmica/DurajKP19 %A Duraj, Lech %A Künnemann, Marvin %A Polak, Adam %D 2019 %J Algorithmica %K dblp %N 10 %P 3968-3992 %T Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#DurajKP19 %V 81

@article{journals/algorithmica/DurajKP19, added-at = {2019-09-23T00:00:00.000+0200}, author = {Duraj, Lech and Künnemann, Marvin and Polak, Adam}, biburl = {https://www.bibsonomy.org/bibtex/2155f32a71961aaa9713aa1dc91680f56/dblp}, ee = {https://doi.org/10.1007/s00453-018-0485-7}, interhash = {d2837c7cbc20c7c1efdcead0bb28f328}, intrahash = {155f32a71961aaa9713aa1dc91680f56}, journal = {Algorithmica}, keywords = {dblp}, number = 10, pages = {3968-3992}, timestamp = {2019-09-24T11:39:42.000+0200}, title = {Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#DurajKP19}, volume = 81, year = 2019 }