A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

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]

Authors

Vít Jelínek

This author has not been identified. Look up 'Vít Jelínek' in Google

Michal Opler

This author has not been identified. Look up 'Michal Opler' in Google

Jakub Pekárek

This author has not been identified. Look up 'Jakub Pekárek' in Google