BibTeX record conf/cpm/KomusiewiczOZ17

download as .bib file

@inproceedings{DBLP:conf/cpm/KomusiewiczOZ17,
  author       = {Christian Komusiewicz and
                  Mateus de Oliveira Oliveira and
                  Meirav Zehavi},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jakub Radoszewski and
                  Wojciech Rytter},
  title        = {Revisiting the Parameterized Complexity of Maximum-Duo Preservation
                  String Mapping},
  booktitle    = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
                  July 4-6, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {78},
  pages        = {11:1--11:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2017.11},
  doi          = {10.4230/LIPICS.CPM.2017.11},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/KomusiewiczOZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.