30 citations · 31 across the 4 of their papers we have counts for
5 papers
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems
Ivan Bliznets, Marek Cygan, Pawel Komosa +2
In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and…
First order convergence of matroids
Frantisek Kardos, Daniel Kral, Anita Liebenau +1
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse struc…
Kernelization lower bound for Permutation Pattern Matching
Ivan Bliznets, Marek Cygan, Pawel Komosa +1
A permutation contains a permutation as a pattern if it contains a subsequence of length whose elements are in the same relative order as in the permutation . This…
Amalgam width of matroids
Lukas Mach, Tomas Toufar
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitel…
A new lower bound based on Gromov's method of selecting heavily covered points
Daniel Kral, Lukas Mach, Jean-Sebastien Sereni
Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there…