BibTeX record conf/cpm/DessmarkJLL04

download as .bib file

@inproceedings{DBLP:conf/cpm/DessmarkJLL04,
  author    = {Anders Dessmark and
               Jesper Jansson and
               Andrzej Lingas and
               Eva{-}Marta Lundell},
  title     = {Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree
               Problem},
  booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
               Istanbul,Turkey, July 5-7, 2004, Proceedings},
  pages     = {220--229},
  year      = {2004},
  crossref  = {DBLP:conf/cpm/2004},
  url       = {https://doi.org/10.1007/978-3-540-27801-6\_16},
  doi       = {10.1007/978-3-540-27801-6\_16},
  timestamp = {Mon, 14 May 2018 20:32:06 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/DessmarkJLL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2004,
  editor    = {S{\"{u}}leyman Cenk Sahinalp and
               S. Muthukrishnan and
               Ugur Dogrus{\"{o}}z},
  title     = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
               Istanbul,Turkey, July 5-7, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3109},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b98377},
  doi       = {10.1007/b98377},
  isbn      = {3-540-22341-X},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cpm/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier