Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Longest Filled Common Subsequence Problem."

Mauro Castelli et al. (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CPM.2017.14

access: open

type: Conference or Workshop Paper

metadata version: 2018-11-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/cpm/CastelliDMZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/CastelliDMZ17
Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The Longest Filled Common Subsequence Problem. CPM 2017: 14:1-14:13

a service of

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.