Classes
Publications
- On 3-Coloring of (2P_4, C_5)-Free Graphs2022 | Faculty of Mathematics and Physics
- Griddings of Permutations and Hardness of Pattern Matching2021 | Faculty of Mathematics and Physics
- On 3-Coloring of (2P4, C5)-Free Graphs2021 | Faculty of Mathematics and Physics
- Long paths make pattern-counting hard, and deep trees make it harder2021 | Faculty of Mathematics and Physics
- A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes2020 | Faculty of Mathematics and Physics
- On ordered Ramsey numbers of bounded-degree graphs2019 | Faculty of Mathematics and Physics
- On the Hardness of Switching to a Small Number of Edges2016 | Faculty of Mathematics and Physics
- Testing Planarity of Partially Embedded Graphs +12015 | Faculty of Mathematics and Physics
- Planar Embeddings with Small and Uniform Faces2014 | Faculty of Mathematics and Physics
- On the complexity of the G-reconstruction problem +22005 | Faculty of Mathematics and Physics
Loading network view...