pdfformat: 

@InProceedings{asahiro_et_al:LIPIcs.CPM.2022.15, author = {Asahiro, Yuichi and Jansson, Jesper and Lin, Guohui and Miyano, Eiji and Ono, Hirotaka and Utashima, Tadatoshi}, title = {{PolynomialTime Equivalences and Refined Algorithms for Longest Common Subsequence Variants}}, booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)}, pages = {15:115:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772341}, ISSN = {18688969}, year = {2022}, volume = {223}, editor = {Bannai, Hideo and Holub, Jan}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16142}, URN = {urn:nbn:de:0030drops161424}, doi = {10.4230/LIPIcs.CPM.2022.15}, annote = {Keywords: Repetitionbounded longest common subsequence problem, multiset restricted longest common subsequence problem, onesidefilled longest common subsequence problem, twosidefilled longest common subsequence problem, exact algorithms, and approximation algorithms} }
Keywords:  Repetitionbounded longest common subsequence problem, multiset restricted longest common subsequence problem, onesidefilled longest common subsequence problem, twosidefilled longest common subsequence problem, exact algorithms, and approximation algorithms  
Seminar:  33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)  
Issue date:  2022  
Date of publication:  22.06.2022 