# Dr. Ágnes Cseh

**Chair for**** Algorithm Engineering**

Hasso Plattner Institute

Office: A-1.11

Tel.: +49 331 5509-3952

E-Mail: Agnes.Cseh(at)hpi.de

# Short CV

**Previous work experience**

- postdoctoral researcher at Hungarian Academy of Sciences, Institute of Economics, Sep 2016 -
- part-time lecturer at the Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Feb 2017 - Jan 2018
- part-time lecturer at the Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Sep 2016 - Jan 2017
- postdoctoral researcher at ICE-TCS, Reykjavík University, Jan-Aug 2016

**Education**

- PhD in Mathematics under the supervision of Martin Skutella at TU Berlin, 2015
- MSc in Mathematics at TU Berlin, 2012
- BSc in Mathematics at Budapest University of Technology and Economics, 2010

PhD thesis: Complexity and algorithms in matching problems under preferences

# Publications

2021 [ nach oben ]

- Cseh, Ágnes; Juhos, Attila
**Pairwise Preferences in the Stable Marriage Problem**. ACM Transactions on Economics and Computation (TEAC) 2021: 1–28 - Cseh, Ágnes; Kavitha, Telikepalli
**Popular matchings in complete graphs**. Algorithmica 2021: 1–31 - Andersson, Tommy; Cseh, Ágnes; Ehlers, Lars; Erlanson, Albin
**Organizing time exchanges: Lessons from matching markets**. American Economic Journal: Microeconomics 2021: 338–73 - Aziz, Haris; Cseh, Agnes; Dickerson, John; McElfresh, Duncan
**Optimal Kidney Exchange with Immunosuppressants**. Conference on Artificial Intelligence (AAAI) 2021[ BibTeX ] - Kraiczy, Sonja; Cseh, Ágnes; Manlove, David
**On Weakly and Strongly Popular Rankings**. Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ] - Aziz, Haris; Chan, Hau; Cseh, Ágnes; Li, Bo; Ramezani, Fahimeh; Wang, Chenhao
**Multi-Robot Task Allocation—Complexity and Approximation**. Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ]

2020 [ nach oben ]

- Cseh, Ágnes; Fleiner, Tamás
**The Complexity of Cake Cutting with Unequal Shares**. ACM Transactions on Algorithms 2020: 1–21 - Cseh, Ágnes; Heeger, Klaus
**The stable marriage problem with ties and restricted edges**. Discrete Optimization 2020: 100571

2019 [ nach oben ]

- Cseh, Ágnes; Matuschke, Jannik
**New and Simple Algorithms for Stable Flow Problems**. Algorithmica 2019: 2557–2591 - Cechlárová, Katarína; Cseh, Ágnes; Manlove, David
**Selected open problems in Matching Under Preferences**. Bulletin of the European Association for Theoretical Computer Science 2019: 14–38 - Cseh, Ágnes; Skutella, Martin
**Paths to stable allocations**. International Journal of Game Theory 2019: 835–862 - Cseh, Ágnes; Irving, Robert W.; Manlove, David F.
**The Stable Roommates Problem with Short Lists**. Theory of Computing Systems 2019: 128–149 - Cseh, Ágnes; Juhos, Attila
**Pairwise Preferences in the Stable Marriage Problem**. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 21:1–21:16

2018 [ nach oben ]

- Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik
**Matchings with Lower Quotas: Algorithms and Complexity**. Algorithmica 2018: 185–208 - Cseh, Ágnes; Kavitha, Telikepalli
**Popular edges and dominant matchings**. Mathematical Programming 2018: 209–229 - Cseh, Ágnes; Kavitha, Telikepalli
**Popular Matchings in Complete Graphs**. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018: 17:1–17:14 - Cseh, Ágnes; Fleiner, Tamás
**The Complexity of Cake Cutting with Unequal Shares**. Symposium Algorithmic Game Theory (SAGT) 2018: 19–30

2017 [ nach oben ]

- Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
**Popular Matchings with Two-Sided Preferences and One-Sided Ties**. SIAM Journal on Discrete Mathematics 2017: 367–379 - Cseh, Ágnes; Matuschke, Jannik
**New and Simple Algorithms for Stable Flow Problems**. Workshop Graph-Theoretic Concepts in Computer Science (WG) 2017: 206–219

2016 [ nach oben ]

- Cseh, Ágnes
**Marriages are made in calculation**. Bulletin of the European Association for Theoretical Computer Science 2016: 180–183 - Cseh, Ágnes; Manlove, David F.
**Stable Marriage and Roommates problems with restricted edges: Complexity and approximability**. Discrete Optimization 2016: 62–89 - Cseh, Ágnes; Dean, Brian C.
**Improved algorithmic results for unsplittable stable allocation problems**. Journal of Combinatorial Optimization 2016: 657–671 - Cseh, Ágnes; Kavitha, Telikepalli
**Popular Edges and Dominant Matchings**. International Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016: 138–151 - Cseh, Ágnes; Irving, Robert W.; Manlove, David F.
**The Stable Roommates Problem with Short Lists**. Symposium Algorithmic Game Theory (SAGT) 2016: 207–219

2015 [ nach oben ]

- Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli
**Popular Matchings with Two-Sided Preferences and One-Sided Ties**. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 367–379 - Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik
**Many-to-one Matchings with Lower Quotas: Algorithms and Complexity**. International Symposium Algorithms and Computation (ISAAC) 2015: 176–187 - Cseh, Ágnes; Manlove, David F.
**Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability**. Symposium Algorithmic Game Theory (SAGT) 2015: 15–26

2014 [ nach oben ]

2013 [ nach oben ]