Marie-Louise Lackner

Learn More
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 general upper bound result for domain restrictions that can be defined by certain forbidden configurations. This upper bound implies that many domain restrictions (including the(More)
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 polynomial time algorithms for special cases. The first algorithm is applicable if both π and τ are 321-avoiding; the second is applicable if π and τ are skew-merged. Both algorithms have(More)
  • 1