BibTeX record conf/cpm/CastelliDMZ17

download as .bib file

@inproceedings{DBLP:conf/cpm/CastelliDMZ17,
  author       = {Mauro Castelli and
                  Riccardo Dondi and
                  Giancarlo Mauri and
                  Italo Zoppis},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jakub Radoszewski and
                  Wojciech Rytter},
  title        = {The Longest Filled Common Subsequence Problem},
  booktitle    = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
                  July 4-6, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {78},
  pages        = {14:1--14:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2017.14},
  doi          = {10.4230/LIPICS.CPM.2017.14},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/CastelliDMZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics