2 citations · 2 across the 7 of their papers we have counts for
5 papers · 1 filter
Measuring Depth of Matroids
Jakub Balabán, Petr Hliněný, Jan Jedelský +1
Motivated by recently discovered connections between matroid depth measures and block-structured integer programming [ICALP 2020, 2022], we undertake a systematic study of recursiv…
Obstructions and dualities for matroid depth parameters
Jakub Gajarský, Kristýna Pekárková, Michał Pilipczuk
Contraction-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction-de…
Branch-depth is minor closure of contraction-deletion-depth
Marcin Briański, Daniel Kráľ, Kristýna Pekárková
The notion of branch-depth for matroids was introduced by DeVos, Kwon and Oum as the matroid analogue of the tree-depth of graphs. The contraction-deletion-depth, another tree-dept…
Twin-width of graphs on surfaces
Daniel Kráľ, Kristýna Pekárková, Kenny Štorgel
Twin-width is a width parameter introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20, JACM'22], which has many structural and algorithmic applications. We prove that the twin…
On pattern-avoiding permutons
Frederik Garbe, Jan Hladký, Gábor Kun +1
The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutat…