30 citations · 208 across the 26 of their papers we have counts for
6 papers · 1 filter
Unified Hanani-Tutte theorem
Radoslav Fulek, Jan Kynčl, Dömötör Pálvölgyi
We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph has a drawing in the plane where every pair of indepen…
Simple realizability of complete abstract topological graphs simplified
Jan Kynčl
An abstract topological graph (briefly an AT-graph) is a pair where is a graph and is a set of pairs of its edges…
Hardness of Permutation Pattern Matching
Vít Jelínek, Jan Kynčl
Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations and , represented as sequences of integers, and the task is to determine wh…
Better upper bounds on the Füredi-Hajnal limits of permutations
Josef Cibulka, Jan Kynčl
A binary matrix is a matrix with entries from the set . We say that a binary matrix contains a binary matrix if can be obtained from by removal of some row…
On the nonexistence of -reptile simplices in and
Jan Kynčl, Zuzana Patáková
A -dimensional simplex is called a -reptile (or a -reptile simplex) if it can be tiled by simplices with disjoint interiors that are all mutually congruent and sim…
Near equipartitions of colored point sets
Andreas F. Holmsen, Jan Kynčl, Claudiu Valculescu
Suppose that points in general position in the plane are colored red and blue, with at least points of each color. We show that then there exist pairwise disjoint conv…