Fixed-parameter algorithms for Kemeny rankings
- 28 October 2009
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 410 (45), 4554-4570
- https://doi.org/10.1016/j.tcs.2009.08.033
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Aggregating inconsistent informationJournal of the ACM, 2008
- A fixed-parameter algorithm for the directed feedback vertex set problemJournal of the ACM, 2008
- On complexity of lobbying in multiple referendaReview of Economic Design, 2007
- Techniques for Practical Fixed-Parameter AlgorithmsThe Computer Journal, 2007
- Invitation to data reduction and problem kernelizationACM SIGACT News, 2007
- The complexity of Kemeny electionsTheoretical Computer Science, 2005
- Rank aggregation methods for the WebPublished by Association for Computing Machinery (ACM) ,2001
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989
- Fair and reasonable election systemsBehavioral Science, 1975