"On the parameterized complexity of the repetition free longest common ..."

Guillaume Blin et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2011.12.009

access: closed

type: Journal Article

metadata version: 2017-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/BlinBDS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BlinBDS12
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora:
On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112(7): 272-276 (2012)

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.