
Griddings of permutations and hardness of pattern matching
We study the complexity of the decision problem known as Permutation Pat...
read it

Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy o...
read it

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
Permutation Pattern Matching (PPM) is the problem of deciding for a give...
read it

Induced odd cycle packing number, independent sets, and chromatic number
The induced odd cycle packing numberiocp(G) of a graph G is the maximum ...
read it

Coloring nearquadrangulations of the cylinder and the torus
Let G be a simple connected plane graph and let C_1 and C_2 be cycles in...
read it

On the Simultaneous Minimum Spanning Trees Problem
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given ...
read it
Jakub Pekárek
is this you? claim profile