# 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 ]

- Optimal Kidney Exchange with Immunosuppressants. Conference on Artificial Intelligence (AAAI) 2021[ BibTeX ]
- On weakly and strongly popular rankings. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ]
- Multi-Robot Task Allocation—Complexity and Approximation. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2021[ BibTeX ]

2020 [ nach oben ]

- The Complexity of Cake Cutting with Unequal Shares. ACM Transactions on Algorithms 2020: 1-21
- The stable marriage problem with ties and restricted edges. Discrete Optimization 2020: 100571

2019 [ nach oben ]

- New and Simple Algorithms for Stable Flow Problems. Algorithmica 2019: 2557-2591
- Selected open problems in Matching Under Preferences. Bulletin of the European Association for Theoretical Computer Science 2019: 14-38
- Paths to stable allocations. International Journal of Game Theory 2019: 835-862
- The Stable Roommates Problem with Short Lists. Theory of Computing Systems 2019: 128-149
- Pairwise Preferences in the Stable Marriage Problem. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 21:1-21:16

2018 [ nach oben ]

- Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 2018: 185-208
- Popular edges and dominant matchings. Mathematical Programming 2018: 209-229
- Popular Matchings in Complete Graphs. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018: 17:1-17:14
- The Complexity of Cake Cutting with Unequal Shares. Symposium Algorithmic Game Theory (SAGT) 2018: 19-30

2017 [ nach oben ]

- Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM Journal on Discrete Mathematics 2017: 367-379
- New and Simple Algorithms for Stable Flow Problems. Workshop Graph-Theoretic Concepts in Computer Science (WG) 2017: 206-219

2016 [ nach oben ]

- Marriages are made in calculation. Bulletin of the European Association for Theoretical Computer Science 2016: 180-183
- Stable Marriage and Roommates problems with restricted edges: Complexity and approximability. Discrete Optimization 2016: 62-89
- Improved algorithmic results for unsplittable stable allocation problems. Journal of Combinatorial Optimization 2016: 657-671
- Popular Edges and Dominant Matchings. International Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016: 138-151
- The Stable Roommates Problem with Short Lists. Symposium Algorithmic Game Theory (SAGT) 2016: 207-219

2015 [ nach oben ]

- Popular Matchings with Two-Sided Preferences and One-Sided Ties. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 367-379
- Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. International Symposium Algorithms and Computation (ISAAC) 2015: 176-187
- Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability. Symposium Algorithmic Game Theory (SAGT) 2015: 15-26

2014 [ nach oben ]

- Paths to Stable Allocations. Symposium Algorithmic Game Theory (SAGT) 2014: 61-73

2013 [ nach oben ]

- Stable Flows over Time. Algorithms 2013: 532-545