On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13) |
| Author | Blin, Guillaume, Bonizzoni, Paola, Dondi, Riccardo, Sikora, Florian |
| Maintainer | CCSD |
| Last Updated | May 6, 2026, 07:58 (UTC) |
| Created | May 6, 2026, 07:58 (UTC) |
| Identifier | hal-00949104 |
| Language | en |
| contributor | Laboratoire d'Informatique Gaspard-Monge (LIGM) ; Université Paris-Est Marne-la-Vallée (UPEM)-École nationale des ponts et chaussées (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT) ; Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS) |
| coverage | Riga, Latvia |
| creator | Blin, Guillaume |
| date | 2013-07-06T00:00:00 |
| harvest_object_id | 3258306d-92b7-4464-8d54-6329454c489b |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2026-04-02T00:00:00 |
| set_spec | type:COMM |