The following pages link to Martin Lackner (Q300456):
Displaying 16 items.
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- Consistent approval-based multi-winner rules (Q1995319) (← links)
- Utilitarian welfare and representation guarantees of approval-based multiwinner rules (Q2046010) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- The computational landscape of permutation patterns (Q2937642) (← links)
- Computational Aspects of Nearly Single-Peaked Electorates (Q2962574) (← links)
- Multicut on Graphs of Bounded Clique-Width (Q3167354) (← links)
- Manipulation of k-Approval in Nearly Single-Peaked Electorates (Q3449523) (← links)
- (Q3457256) (← links)
- The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations (Q4557004) (← links)
- Multi-Winner Voting with Approval Preferences (Q5095940) (← links)
- Incomplete Preferences in Single-Peaked Electorates (Q5109906) (← links)
- Preferences Single-Peaked on a Circle (Q5114791) (← links)
- Phragmén's voting methods and justified representation (Q6120935) (← links)
- A W[1]-Completeness Result for Generalized Permutation Pattern Matching (Q6227648) (← links)