research
∙
11/05/2021
Long paths make pattern-counting hard, and deep trees make it harder
We study the counting problem known as #PPM, whose input is a pair of pe...
share
research
∙
07/22/2021
Griddings of permutations and hardness of pattern matching
We study the complexity of the decision problem known as Permutation Pat...
research
∙
03/31/2021
Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy o...
research
∙
08/11/2020
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
Permutation Pattern Matching (PPM) is the problem of deciding for a give...
research
∙
01/08/2020
Induced odd cycle packing number, independent sets, and chromatic number
The induced odd cycle packing numberiocp(G) of a graph G is the maximum ...
research
∙
09/26/2019
Coloring near-quadrangulations of the cylinder and the torus
Let G be a simple connected plane graph and let C_1 and C_2 be cycles in...
research
∙
12/01/2017