On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem

Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00949104
Contributor : Guillaume Blin <>
Submitted on : Wednesday, February 19, 2014 - 10:19:08 AM
Last modification on : Monday, February 4, 2019 - 10:22:01 AM

Identifiers

  • HAL Id : hal-00949104, version 1

Citation

Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp. ⟨hal-00949104⟩

Share

Metrics

Record views

747