2 citations · 2 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
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…
math.CO2026
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…