Author of the publication

Parity Permutation Pattern Matching.

, , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 384-395. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity., , , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 185-200. Springer, (2019)The Longest Run Subsequence Problem: Further Complexity Results., and . CPM, volume 191 of LIPIcs, page 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Generalizing Roberts' Characterization of Unit Interval Graphs., , , , and . MFCS, volume 306 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration., and . IPEC, volume 115 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Token Sliding on Split Graphs., , , , , and . STACS, volume 126 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Longest Run Subsequence Problem: Further Complexity Results., and . CoRR, (2020)Abundant Extensions., , , , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 3-17. Springer, (2021)Recognizing Unit Multiple Intervals Is Hard., , , and . ISAAC, volume 283 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Complexity of Broadcast Domination and Multipacking in Digraphs., , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 264-276. Springer, (2020)Token Sliding on Split Graphs., , , , , and . Theory Comput. Syst., 65 (4): 662-686 (2021)