Session B2
Title Social Choice I
Chair Joerg Rothe
580 Large-Scale Election Campaigns: Combinatorial Shift Bribery
  Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
271 Manipulation with Bounded Single-Peaked Width: A Parameterized Study
  Yongjie Yang
440 Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting
  Palash Dey, Neeldhara Misra, Y. Narahari
770 On the Parameterized Complexity of Minimax Approval Voting
  Neeldhara Misra, Arshed Nabeel, Harman Singh
86 Computational Aspects of Multi-Winner Approval Voting
  Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh
228 Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young
  Ulle Endriss, Ronald de Haan
229 Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
  Ulle Endriss, Ronald de Haan, Stefan Szeider