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]

Abstract

Abstract is missing.