Vít Jelínek, Michal Opler, Jakub Pekárek. A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. In Javier Esparza, Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. Volume 170 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{JelinekOP20,
title = {A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes},
author = {Vít Jelínek and Michal Opler and Jakub Pekárek},
year = {2020},
doi = {10.4230/LIPIcs.MFCS.2020.52},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.52},
researchr = {https://researchr.org/publication/JelinekOP20},
cites = {0},
citedby = {0},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic},
editor = {Javier Esparza and Daniel Král'},
volume = {170},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-159-7},
}