research
∙
08/29/2023
String graphs with precise number of intersections
A string graph is an intersection graph of curves in the plane. A k-stri...
share
research
∙
11/11/2021
Avoiding a pair of patterns in multisets and compositions
In this paper, we study the Wilf-type equivalence relations among multis...
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...
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
∙
11/12/2020
Note on 3-Coloring of (2P_4,C_5)-Free Graphs
We show that the 3-coloring problem is polynomial-time solvable on (2P_4...
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
∙
02/27/2020
Fillings of skew shapes avoiding diagonal patterns
A skew shape is the difference of two top-left justified Ferrers shapes ...
research
∙
08/13/2018
On grounded L-graphs and their relatives
We consider the graph class Grounded-L corresponding to graphs that admi...
research
∙
03/23/2018
