82 citations · 351 across the 32 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 21 cited
Computational Aspects of Nearly Single-Peaked Electorates
Gábor Erdélyi, Martin Lackner, Andreas Pfandler
Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of th…
cs.DS2012★ 8 cited
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
Marie-Louise Bruner, Martin Lackner
The NP-complete Permutation Pattern Matching problem asks whether a -permutation is contained in a -permutation as a pattern. This is the case if there exists an orde…