2 citations · 2 across the 7 of their papers we have counts for
10 papers
Nearly Group-Separable Elections
Piotr Faliszewski, Jan Jabrocki, Stanisław Kaźmierowski +3
We study the problem of computing how close a given election is to being group-separable, measuring proximity by swaps of adjacent candidates in the votes. We also consider several…
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…
On Integer Programs That Look Like Paths
Marcin Briański, Alexandra Lassota, Kristýna Pekárková +2
Solving integer programs of the form is, in general, $…
Identifying Imperfect Clones in Elections
Piotr Faliszewski, Lukasz Janeczko, Grzegorz Lisowski +2
A perfect clone in an ordinal election (i.e., an election where the voters rank the candidates in a strict linear order) is a set of candidates that each voter ranks consecutively.…
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…
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Marcin Brianski, Martin Koutecky, Daniel Kral +2
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a constraint matrix and the n…
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecky +2
A long line of research on fixed parameter tractability of integer programming culminated with showing that integer programs with n variables and a constraint matrix with dual tree…