Go to the corresponding LIPIcs Volume Portal 
Castelli, Mauro ; Dondi, Riccardo ; Mauri, Giancarlo ; Zoppis, Italo
pdfformat: 

@InProceedings{castelli_et_al:LIPIcs:2017:7329, author = {Mauro Castelli and Riccardo Dondi and Giancarlo Mauri and Italo Zoppis}, title = {{The Longest Filled Common Subsequence Problem}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)}, pages = {14:114:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770392}, ISSN = {18688969}, year = {2017}, volume = {78}, editor = {Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7329}, URN = {urn:nbn:de:0030drops73293}, doi = {10.4230/LIPIcs.CPM.2017.14}, annote = {Keywords: longest common subsequence, approximation algorithms, computational complexity, fixedparameter algorithms} }
Keywords:  longest common subsequence, approximation algorithms, computational complexity, fixedparameter algorithms  
Seminar:  28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  
Issue Date:  2017  
Date of publication:  28.06.2017 