Paths to stable allocations - Ágnes Cseh (CoRR, 2012)

Stable Flows over Time. - Ágnes Cseh; Jannik Matuschke; Martin Skutella (Algorithms, 2013)

Stable flows with restricted edges. - Ágnes Cseh (CoRR, 2013)

The Student/Project Allocation problem with group projects. - Ashwin Arulselvan; Ágnes Cseh; Jannik Matuschke (CoRR, 2014)

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (ISAAC, 2015)

Stable Marriage and Roommates problems with restricted edges: Complexity and approximability. - Ágnes Cseh; David F. Manlove (Discret. Optim., 2016)

Marriages are made in calculation. - Ágnes Cseh (Bull. EATCS, 2016)

Improved algorithmic results for unsplittable stable allocation problems. - Ágnes Cseh; Brian C. Dean (J. Comb. Optim., 2016)

Popular Matchings with Two-Sided Preferences and One-Sided Ties. - Ágnes Cseh; Chien-Chung Huang 001; Telikepalli Kavitha (SIAM J. Discret. Math., 2017)

Matchings with Lower Quotas: Algorithms and Complexity. - Ashwin Arulselvan; Ágnes Cseh; Martin Groß 001; David F. Manlove; Jannik Matuschke (Algorithmica, 2018)

Popularity, stability, and the dominant matching polytope. - Ágnes Cseh; Yuri Faenza; Telikepalli Kavitha; Vladlena Powers (CoRR, 2018)

Popular edges and dominant matchings. - Ágnes Cseh; Telikepalli Kavitha (Math. Program., 2018)

New and Simple Algorithms for Stable Flow Problems. - Ágnes Cseh; Jannik Matuschke (Algorithmica, 2019)

Pareto optimal coalitions of fixed size. - Ágnes Cseh; Tamás Fleiner; Petra Harján (CoRR, 2019)

Selected open problems in Matching Under Preferences. - Katarína Cechlárová; Ágnes Cseh; David F. Manlove (Bull. EATCS, 2019)

Paths to stable allocations. - Ágnes Cseh; Martin Skutella (Int. J. Game Theory, 2019)

The Stable Roommates Problem with Short Lists. - Ágnes Cseh; Robert W. Irving; David F. Manlove (Theory Comput. Syst., 2019)

A quest for a fair schedule: The Young Physicists' Tournament. - Katarína Cechlárová; Ágnes Cseh; Zsuzsanna Jankó; Marián Kires; Lukás Mino (CoRR, 2020)

The stable marriage problem with ties and restricted edges. - Ágnes Cseh; Klaus Heeger (Discret. Optim., 2020)

The Complexity of Cake Cutting with Unequal Shares. - Ágnes Cseh; Tamás Fleiner (ACM Trans. Algorithms, 2020)

Optimal Kidney Exchange with Immunosuppressants. - Haris Aziz 001; Ágnes Cseh; John P. Dickerson; Duncan C. McElfresh (AAAI, 2021)

Multi-Robot Task Allocation-Complexity and Approximation. - Haris Aziz 001; Hau Chan; Ágnes Cseh; Bo Li 037; Fahimeh Ramezani 002; Chenhao Wang 001 (AAMAS, 2021)

Popular Matchings in Complete Graphs. - Ágnes Cseh; Telikepalli Kavitha (Algorithmica, 2021)

On absolutely and simply popular rankings. - Sonja Kraiczy; Ágnes Cseh; David F. Manlove (CoRR, 2021)

Polynomially tractable cases in the popular roommates problem. - Erika R. Bérczi-Kovács; Ágnes Cseh; Kata Kosztolányi; Attila Mályusz (CoRR, 2021)

Pairwise Preferences in the Stable Marriage Problem. - Ágnes Cseh; Attila Juhos (ACM Trans. Economics and Comput., 2021)

Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. - Ágnes Cseh; Tobias Friedrich 001; Jannik Peters 001 (AAMAS, 2022)

Three-Dimensional Popular Matching with Cyclic Preferences. - Ágnes Cseh; Jannik Peters 001 (AAMAS, 2022)

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. - Pascal Führlich; Ágnes Cseh; Pascal Lenzner (EC, 2022)

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Begüm Genç; Luis Quesada 001 (Constraints An Int. J., 2022)

Understanding Popular Matchings via Stable Matchings. - Ágnes Cseh; Yuri Faenza; Telikepalli Kavitha; Vladlena Powers (SIAM J. Discret. Math., 2022)

The Swiss Gambit. - Ágnes Cseh; Pascal Führlich; Pascal Lenzner (AAMAS, 2023)

Computational Complexity of k-Stable Matchings. - Haris Aziz 001; Gergely Csáji; Ágnes Cseh (SAGT, 2023)

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Luis Quesada 001 (Constraints An Int. J., 2023)

A quest for a fair schedule: The International Young Physicists' Tournament. - Katarína Cechlárová; Ágnes Cseh; Zsuzsanna Jankó; Marián Kires; Lukás Mino (J. Sched., 2023)

On weakly and strongly popular rankings. - Sonja Kraiczy; Ágnes Cseh; David F. Manlove (Discret. Appl. Math., 2023)

English Translation of "Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre" by Dénes König. - Ágnes Cseh (CoRR, 2024)

Popular matchings with weighted voters. - Klaus Heeger; Ágnes Cseh (Games Econ. Behav., 2024)

Envy-freeness in 3D hedonic games. - Michael McKay; Ágnes Cseh; David F. Manlove (Auton. Agents Multi Agent Syst., 2024)

Computational Complexity of k-stable Matchings. - Haris Aziz 001; Gergely Csáji; Ágnes Cseh (ACM Trans. Economics and Comput., 2025)

Maximum-utility Popular Matchings with Bounded Instability. - Ildikó Schlotter; Ágnes Cseh (ACM Trans. Comput. Theory, 2025)