Search dblp for Publications

export results for "The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets."

 download as .bib file

@inproceedings{DBLP:conf/iwoca/CicaleseP21,
  author       = {Ferdinando Cicalese and
                  Nicol{\`{o}} Pilati},
  editor       = {Paola Flocchini and
                  Lucia Moura},
  title        = {The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets},
  booktitle    = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
                  Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12757},
  pages        = {179--193},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-79987-8\_13},
  doi          = {10.1007/978-3-030-79987-8\_13},
  timestamp    = {Thu, 29 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CicaleseP21.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.