It only takes a few: on the hardness of voting with a constant number of agents. - Felix Brandt 001; Paul Harrenstein; Keyvan Kardel; Hans Georg Seedig (AAMAS, 2013)

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (CoRR, 2017)

k-Majority digraphs and the hardness of voting with a constant number of voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (J. Comput. Syst. Sci., 2019)