Magdaléna Tydrichová

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 9

Top Topics

Computationally Hard

Weighted Majority

Polynomial Time Complexity

Top Venues

Discret. Appl. Math.

Soc. Choice Welf.

Publications

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. 348 (2024)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Euclidean preferences in the plane under $\varvec{\ell _1},$$\varvec{\ell _2}$ and $\varvec{\ell _\infty }$ norms. Soc. Choice Welf. 63 (1) (2024)
Théo Delemazure, Chris Dong, Dominik Peters, Magdaléna Tydrichová
Comparing Ways of Obtaining Candidate Orderings from Approval Ballots. CoRR (2024)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Algorithmic Recognition of 2-Euclidean Preferences. ECAI (2023)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. Discret. Appl. Math. 318 (2022)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. CoRR (2021)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT (2021)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. SAGT (2020)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. CoRR (2020)