BibTeX record conf/cpm/BrodalKKK06

download as .bib file

@inproceedings{DBLP:conf/cpm/BrodalKKK06,
  author       = {Gerth St{\o}lting Brodal and
                  Kanela Kaligosi and
                  Irit Katriel and
                  Martin Kutz},
  editor       = {Moshe Lewenstein and
                  Gabriel Valiente},
  title        = {Faster Algorithms for Computing Longest Common Increasing Subsequences},
  booktitle    = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
                  Barcelona, Spain, July 5-7, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4009},
  pages        = {330--341},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11780441\_30},
  doi          = {10.1007/11780441\_30},
  timestamp    = {Sat, 19 Oct 2019 20:27:16 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/BrodalKKK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics