82 citations · 351 across the 32 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015★ 6 cited
The Complexity of Pattern Matching for -Avoiding and Skew-Merged Permutations
Michael H. Albert, Marie-Louise Lackner, Martin Lackner +1
The Permutation Pattern Matching problem, asking whether a pattern permutation is contained in a permutation , is known to be NP-complete. In this paper we present two polyn…
cs.GT2015★ 30 cited
On the Likelihood of Single-Peaked Preferences
Marie-Louise Lackner, Martin Lackner
This paper contains an extensive combinatorial analysis of the single-peaked domain restriction and investigates the likelihood that an election is single-peaked. We provide a very…
cs.GT2015★ 60 cited
Structure in Dichotomous Preferences
Edith Elkind, Martin Lackner
Many hard computational social choice problems are known to become tractable when voters' preferences belong to a restricted domain, such as those of single-peaked or single-crossi…