# Publications of Ágnes Cseh

The following listing contains all publications of Ágnes Cseh. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Thomas Bläsius, Dr. Katrin Casel, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Martin Krejca, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Ardalan Khazraei, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2020 [ to top ]

- 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 [ to top ]

- 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 [ to top ]

- 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 [ to top ]

- 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 [ to top ]

- 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 [ to top ]

- 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 [ to top ]

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

2013 [ to top ]

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