4 papers
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…