Publisher
Springer Nature Switzerland
Reference20 articles.
1. Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discrete Math. 22(2), 629–649 (2008)
2. Albert, M.H., Lackner, M., Lackner, M., Vatter, V.: The complexity of pattern matching for 321-avoiding and skew-merged permutations. Discrete Math. Theor. Comput. Sci. 18(2) (2016)
3. Alexandersson, P., Fufa, S.A., Getachew, F., Qiu, D.: Pattern-avoidance and fuss-catalan numbers. arXiv preprint. arXiv:2201.08168 (2022)
4. Berendsohn, B.A., Kozma, L., Marx, D.: Finding and counting permutations via CSPs. Algorithmica 83(8), 2552–2577 (2021). https://doi.org/10.1007/s00453-021-00812-z
5. Bonnet, É., Kim, E.J., Thomassé, S., Watrigant, R.: Twin-width I: tractable FO model checking. J. ACM 69(1), 3:1–3:46 (2022)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献