Ranking and Drawing in Subexponential Time

In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimization

• Type: Journal
• Year: 2010
• Where: IWOCA
• Authors: Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
• Keywords: Algorithms, IWOCA 2010, P-kemeny Aggregation, P-one-sided Crossing Minimization, Social Choice Theory