Ágnes Cseh

Most-cited papers

Popular Matchings with Two-Sided Preferences and One-Sided Ties
Ágnes Cseh, Chien-Chung Huang, T. Kavitha
2015International Colloquium on Automata, Languages and Programming53 citations Open access
Semantic Scholar
Popular edges and dominant matchings
Ágnes Cseh, T. Kavitha
2015Conference on Integer Programming and Combinatorial Optimization43 citations Open access
Semantic Scholar
Improving ranking quality and fairness in Swiss-system chess tournaments
P. Sauer, Ágnes Cseh, Pascal Lenzner
2021ACM Conference on Economics and Computation34 citations
Semantic Scholar
The Complexity of Cake Cutting with Unequal Shares
Ágnes Cseh, T. Fleiner
2017Algorithmic Game Theory31 citations Open access
Semantic Scholar
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability
Ágnes Cseh, D. Manlove
2014Algorithmic Game Theory31 citations Open access
Semantic Scholar
Multi-Robot Task Allocation - Complexity and Approximation
H. Aziz, Hau Chan, Ágnes Cseh, Bo Li +2 more
2021Adaptive Agents and Multi-Agent Systems28 citations
Semantic Scholar
Matchings with Lower Quotas: Algorithms and Complexity
A. Arulselvan, Ágnes Cseh, Martin Groß, D. Manlove +1 more
2014Algorithmica24 citations Open access
Semantic Scholar
The Stable Roommates Problem with Short Lists
Ágnes Cseh, Robert W. Irving, D. Manlove
2016Theory of Computing Systems23 citations Open access
Semantic Scholar
Organizing Time Exchanges: Lessons from Matching Markets
Tommy Andersson, Ágnes Cseh, Lars Ehlers, Albin Erlanson
2021American Economic Journal: Microeconomics18 citations Open access
Semantic Scholar
Pareto optimal coalitions of fixed size
Ágnes Cseh, T. Fleiner, Petra Harján
2019Journal of Mechanism and Institution Design18 citations Open access
Semantic Scholar
Optimal Kidney Exchange with Immunosuppressants
Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh
2021AAAI Conference on Artificial Intelligence17 citations Open access
Semantic Scholar
The stable marriage problem with ties and restricted edges
Ágnes Cseh, Klaus Heeger
2019Discrete Optimization17 citations Open access
Semantic Scholar
Popular Matchings in Complete Graphs
Ágnes Cseh, T. Kavitha
2018Algorithmica15 citations Open access
Semantic Scholar
Pairwise Preferences in the Stable Marriage Problem
Ágnes Cseh, A. Juhos
2018Symposium on Theoretical Aspects of Computer Science14 citations Open access
Semantic Scholar
Popular edges and dominant matchings
Ágnes Cseh, T. Kavitha
2017Mathematical programming11 citations Open access
Semantic Scholar
Stable Flows over Time
Ágnes Cseh, J. Matuschke, M. Skutella
2013Algorithms11 citations Open access
Semantic Scholar
Organizing time banks: Lessons from matching markets
Tommy Andersson, Ágnes Cseh, Lars Ehlers, Albin Erlanson
201810 citations
Semantic Scholar
Selected open problems in Matching Under Preferences
K. Cechlárová, Ágnes Cseh, D. Manlove
2019Bull. EATCS9 citations
Semantic Scholar
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
Ágnes Cseh, Guillaume Escamocher, Begum Genc, L. Quesada
2022Constraints8 citations Open access
Semantic Scholar
Understanding Popular Matchings via Stable Matchings
Ágnes Cseh, Yuri Faenza, T. Kavitha, V. Powers
2018SIAM Journal on Discrete Mathematics7 citations Open access
Semantic Scholar
Pareto optimal and popular house allocation with lower and upper quotas
Ágnes Cseh, T. Friedrich, Jannik Peters
2021Adaptive Agents and Multi-Agent Systems6 citations
Semantic Scholar
On Weakly and Strongly Popular Rankings
Sonja Kraiczy, Ágnes Cseh, D. Manlove
2021Adaptive Agents and Multi-Agent Systems6 citations
Semantic Scholar
New and Simple Algorithms for Stable Flow Problems
Ágnes Cseh, J. Matuschke
2013Algorithmica6 citations Open access
Semantic Scholar
Three-Dimensional Popular Matching with Cyclic Preferences
Ágnes Cseh, Jannik Peters
2021Adaptive Agents and Multi-Agent Systems5 citations
Semantic Scholar
Complexity and algorithms in matching problems under preferences
Ágnes Cseh, Doktors der Naturwissenschaften
20165 citations
Semantic Scholar
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity
A. Arulselvan, Ágnes Cseh, Martin Groß, D. Manlove +1 more
2014International Symposium on Algorithms and Computation5 citations Open access
Semantic Scholar
Popular matchings with weighted voters
Klaus Heeger, Ágnes Cseh
2021arXiv.org4 citations
Semantic Scholar
Improved algorithmic results for unsplittable stable allocation problems
Ágnes Cseh, Brian C. Dean
2014Journal of combinatorial optimization4 citations Open access
Semantic Scholar
Paths to stable allocations
Ágnes Cseh, M. Skutella
2012Algorithmic Game Theory4 citations
Semantic Scholar
The Swiss Gambit
Ágnes Cseh, Pascal Führlich, Pascal Lenzner
2023Adaptive Agents and Multi-Agent Systems3 citations Open access
Semantic Scholar
Computational Complexity of k-stable Matchings
H. Aziz, G. Csáji, Ágnes Cseh
2023Algorithmic Game Theory3 citations
Semantic Scholar
Maximum-utility Popular Matchings with Bounded Instability
Ildikó Schlotter, Ágnes Cseh
2022ACM Transactions on Computation Theory3 citations Open access
Semantic Scholar
On absolutely and simply popular rankings
Sonja Kraiczy, Ágnes Cseh, D. Manlove
2021arXiv.org3 citations
Semantic Scholar
Paths to stable allocations
Ágnes Cseh, M. Skutella
2019International Journal of Game Theory2 citations
Semantic Scholar
The Student/Project Allocation problem with group projects
A. Arulselvan, Ágnes Cseh, J. Matuschke
2014arXiv.org2 citations
Semantic Scholar
A quest for a fair schedule: The International Young Physicists’ Tournament
K. Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, M. Kireš +1 more
2022Journal of Scheduling1 citations Open access
Semantic Scholar
Polynomially tractable cases in the popular roommates problem
Erika R. Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila M'alyusz
2021Journal of Mechanism and Institution Design1 citations Open access
Semantic Scholar
The Stable Roommates Problem with Short Lists
Ágnes Cseh, Robert W. Irving, D. Manlove
2017Theory of Computing Systems1 citations Open access
Semantic Scholar
Popular matchings with weighted voters
Klaus Heeger, Ágnes Cseh
2024Games Econ. Behav.0 citations Open access
Semantic Scholar
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
2023Constraints0 citations Open access
Semantic Scholar
Envy-freeness in 3D Hedonic Games
Ágnes Cseh, Michael McKay, D. Manlove
2022arXiv.org0 citations Open access
Semantic Scholar
A quest for a fair schedule: The Young Physicists' Tournament
K. Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, M. Kireš +1 more
2020arXiv.org0 citations
Semantic Scholar
Cahier 11-2018 Organizing Time Banks : Lessons from Matching Market s
Tommy Andersson, Ágnes Cseh, Lars Ehlers, Albin Erlanson
20180 citations
Semantic Scholar
Popularity, stability, and the dominant matching polytope
Ágnes Cseh, Yuri Faenza, T. Kavitha, V. Powers
2018arXiv.org0 citations
Semantic Scholar
MT-DP – 2018 / 18 Organizing Time Banks : Lessons from Matching Markets
Tommy Andersson, Ágnes Cseh, Lars Ehlers, Albin Erlanson
20180 citations
Semantic Scholar
Marriages are made in calculation
Ágnes Cseh
2016Bull. EATCS0 citations
Semantic Scholar
M arriages are made in calculation
L. Aceto, Ágnes Cseh
20160 citations
Semantic Scholar
Stable flows with restricted edges
Ágnes Cseh
2013arXiv.org0 citations
Semantic Scholar
Was Ehestifter und Nierenspender verbindet. The Noble Matchmakers
Ágnes Cseh
20120 citations
Semantic Scholar
On weakly and strongly popular rankings ✩
Sonja Kraiczy, Ágnes Cseh, D. Manlove
0 citations
Semantic Scholar