ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2105.11923
  4. Cited By
The Complexity of Subelection Isomorphism Problems

The Complexity of Subelection Isomorphism Problems

25 May 2021
Piotr Faliszewski
Krzysztof Sornat
Stanislaw Szufa
ArXivPDFHTML

Papers citing "The Complexity of Subelection Isomorphism Problems"

3 / 3 papers shown
Title
Drawing a Map of Elections
Drawing a Map of Elections
Stanisław Szufa
Niclas Boehmer
Robert Bredereck
Piotr Faliszewski
R. Niedermeier
P. Skowron
A. Slinko
Nimrod Talmon
30
0
0
04 Apr 2025
Expected Frequency Matrices of Elections: Computation, Geometry, and
  Preference Learning
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning
Niclas Boehmer
Robert Bredereck
Edith Elkind
Piotr Faliszewski
Stanislaw Szufa
15
7
0
16 May 2022
Optimizing positional scoring rules for rank aggregation
Optimizing positional scoring rules for rank aggregation
I. Caragiannis
Xenophon Chatzigeorgiou
George A. Krimpas
Alexandros A. Voudouris
29
28
0
18 Sep 2016
1