BibTeX record conf/cpm/BonizzoniVM00

download as .bib file

@inproceedings{DBLP:conf/cpm/BonizzoniVM00,
  author       = {Paola Bonizzoni and
                  Gianluca Della Vedova and
                  Giancarlo Mauri},
  editor       = {Raffaele Giancarlo and
                  David Sankoff},
  title        = {Approximating the Maximum Isomorphic Agreement Subtree Is Hard},
  booktitle    = {Combinatorial Pattern Matching, 11th Annual Symposium, {CPM} 2000,
                  Montreal, Canada, June 21-23, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1848},
  pages        = {119--128},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45123-4\_12},
  doi          = {10.1007/3-540-45123-4\_12},
  timestamp    = {Sat, 30 Sep 2023 09:37:48 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/BonizzoniVM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics