Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/cpm/cpm2021.bht:"
download as .bib file
@inproceedings{DBLP:conf/cpm/000121,
author = {Michal Kouck{\'{y}}},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Computing Edit Distance (Invited Talk)},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.2},
doi = {10.4230/LIPICS.CPM.2021.2},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/000121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/0001K21,
author = {Meng He and
Serikzhan Kazi},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Data Structures for Categorical Path Counting Queries},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {15:1--15:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.15},
doi = {10.4230/LIPICS.CPM.2021.15},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/0001K21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/0001MPSS21,
author = {Giulia Bernardini and
Alberto Marchetti{-}Spaccamela and
Solon P. Pissis and
Leen Stougie and
Michelle Sweering},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Constructing Strings Avoiding Forbidden Substrings},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {9:1--9:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.9},
doi = {10.4230/LIPICS.CPM.2021.9},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/0001MPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/000421,
author = {Shahbaz Khan},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Optimal Construction of Hierarchical Overlap Graphs},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {17:1--17:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.17},
doi = {10.4230/LIPICS.CPM.2021.17},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/000421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AdamsonGPD21,
author = {Duncan Adamson and
Vladimir V. Gusev and
Igor Potapov and
Argyrios Deligkas},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Ranking Bracelets in Polynomial Time},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {4:1--4:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.4},
doi = {10.4230/LIPICS.CPM.2021.4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AdamsonGPD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AmirBK21,
author = {Amihood Amir and
Itai Boneh and
Eitan Kondratovsky},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {The k-Mappability Problem Revisited},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.5},
doi = {10.4230/LIPICS.CPM.2021.5},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AmirBK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BadkobehCP21,
author = {Golnaz Badkobeh and
Panagiotis Charalampopoulos and
Solon P. Pissis},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Internal Shortest Absent Word Queries},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {6:1--6:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.6},
doi = {10.4230/LIPICS.CPM.2021.6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BadkobehCP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Bannai21,
author = {Hideo Bannai},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Repetitions in Strings: {A} "Constant" Problem (Invited Talk)},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.1},
doi = {10.4230/LIPICS.CPM.2021.1},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Bannai21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BannaiKKP21,
author = {Hideo Bannai and
Juha K{\"{a}}rkk{\"{a}}inen and
Dominik K{\"{o}}ppl and
Marcin Piatkowski},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Constructing the Bijective and the Extended Burrows-Wheeler Transform
in Linear Time},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {7:1--7:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.7},
doi = {10.4230/LIPICS.CPM.2021.7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BannaiKKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BelazzouguiKPR21,
author = {Djamal Belazzougui and
Dmitry Kosolobov and
Simon J. Puglisi and
Rajeev Raman},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Weighted Ancestors in Suffix Trees Revisited},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.8},
doi = {10.4230/LIPICS.CPM.2021.8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BelazzouguiKPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGPS21,
author = {Philip Bille and
Inge Li G{\o}rtz and
Max Rish{\o}j Pedersen and
Teresa Anna Steiner},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Gapped Indexing for Consecutive Occurrences},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.10},
doi = {10.4230/LIPICS.CPM.2021.10},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleGPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauGV21,
author = {Laurent Bulteau and
Samuele Giraudo and
St{\'{e}}phane Vialette},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Disorders and Permutations},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {11:1--11:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.11},
doi = {10.4230/LIPICS.CPM.2021.11},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauGV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Charalampopoulos21,
author = {Panagiotis Charalampopoulos and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen and
Wiktor Zuba},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Computing Covers of 2D-Strings},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.12},
doi = {10.4230/LIPICS.CPM.2021.12},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Charalampopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CobasGN21,
author = {Dustin Cobas and
Travis Gagie and
Gonzalo Navarro},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {A Fast and Small Subsampled R-Index},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {13:1--13:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.13},
doi = {10.4230/LIPICS.CPM.2021.13},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/CobasGN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DondiS21,
author = {Riccardo Dondi and
Florian Sikora},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {The Longest Run Subsequence Problem: Further Complexity Results},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {14:1--14:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.14},
doi = {10.4230/LIPICS.CPM.2021.14},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/DondiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ItalianoPSV21,
author = {Giuseppe F. Italiano and
Nicola Prezza and
Blerina Sinaimeri and
Rossano Venturini},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Compressed Weighted de Bruijn Graphs},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {16:1--16:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.16},
doi = {10.4230/LIPICS.CPM.2021.16},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ItalianoPSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/KimC21,
author = {Sung{-}Hwan Kim and
Hwan{-}Gue Cho},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {A Compact Index for Cartesian Tree Matching},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {18:1--18:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.18},
doi = {10.4230/LIPICS.CPM.2021.18},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/KimC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MienoPSS21,
author = {Takuya Mieno and
Solon P. Pissis and
Leen Stougie and
Michelle Sweering},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {String Sanitization Under Edit Distance: Improved and Generalized},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {19:1--19:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.19},
doi = {10.4230/LIPICS.CPM.2021.19},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/MienoPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NelloreNT21,
author = {Abhinav Nellore and
Austin Nguyen and
Reid F. Thompson},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {An Invertible Transform for Efficient String Matching in Labeled Digraphs},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.20},
doi = {10.4230/LIPICS.CPM.2021.20},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/NelloreNT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/NishimotoT21,
author = {Takaaki Nishimoto and
Yasuo Tabei},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded
Space},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {21:1--21:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.21},
doi = {10.4230/LIPICS.CPM.2021.21},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/NishimotoT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ParkPCPR21,
author = {Sangsoo Park and
Sung Gwan Park and
Bastien Cazaux and
Kunsoo Park and
Eric Rivals},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {22:1--22:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.22},
doi = {10.4230/LIPICS.CPM.2021.22},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ParkPCPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Pisanti21,
author = {Nadia Pisanti},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {On-Line Pattern Matching on D-Texts (Invited Talk)},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {3:1--3:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.3},
doi = {10.4230/LIPICS.CPM.2021.3},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Pisanti21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Popa021,
author = {Andrei Popa and
Alexandru Popa},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Efficient Algorithms for Counting Gapped Palindromes},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {23:1--23:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.23},
doi = {10.4230/LIPICS.CPM.2021.23},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Popa021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/SobelB0NG21,
author = {Joshua Sobel and
Noah Bertram and
Chen Ding and
Fatemeh Nargesian and
Daniel Gildea},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {{AWLCO:} All-Window Length Co-Occurrence},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {24:1--24:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.24},
doi = {10.4230/LIPICS.CPM.2021.24},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/SobelB0NG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/X21,
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {0:1--0:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.0},
doi = {10.4230/LIPICS.CPM.2021.0},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/YaoB21,
author = {Keegan Yao and
Mukul S. Bansal},
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Optimal Completion and Comparison of Incomplete Phylogenetic Trees
Under Robinson-Foulds Distance},
booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
pages = {25:1--25:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CPM.2021.25},
doi = {10.4230/LIPICS.CPM.2021.25},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/YaoB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2021,
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-186-3},
isbn = {978-3-95977-186-3},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-05 05:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
