Ágnes Cseh

CV EN  / CV HU last updated: June 2017
PhD thesis, title: Complexity and algorithms in matching problems under preferences

Research interests: graph algorithms, game theory, complexity, combinatorial optimization, stable matchings, popular matchings. 
E-mail: cseh.agnes (at) krtk.mta.hu


Book chapter:
  • Popular matchings. In Trends in Computational Social Choice, editor: Ulle Endriss. In preparation.

Peer-reviewed papers:

TitleCoauthors Conference Journal 
New algorithms for cake cutting with equal and unequal sharesT. Fleiner and E. RomsicsJap-Hun Symp. on Discrete Math. 2017 
New and simple algorithms for stable flow problemsJ. MatuschkeWG 2017submitted
The Stable Roommates problem with short lists
R. W. Irving and D. F. ManloveSAGT 2016accepted to Theory of Computing Systems
Popular edges and dominant matchingsT. KavithaIPCO 2016Mathematical Programming (online first)
Matchings with lower quotas: algorithms and complexityA. Arulselvan, M. Groß, D.F. Manlove and J. MatuschkeISAAC 2015Algorithmica (online first)
Stable marriage and roommates problems with restricted edges: complexity and approximability D.F. ManloveSAGT 2015Discrete Optimization, 20:62-89, 2016
Popular matchings with two-sided preferences and one-sided tiesC-C. Huang and T. KavithaICALP 2015accepted to SIDMA
Improved algorithmic results for unsplittable stable allocation problemsB.C. DeanMATCH-UP 2015Journal of Combinatorial Optimization, 1-15, 2015
Paths to stable allocationsM. SkutellaSAGT 2014
Stable flows over timeJ. Matuschke and M. SkutellaMATCH-UP 2012Algorithms (MATCH-UP Special Issue), 6:532-545, 2013

Miscellaneous publications:

Subpages (1): Teaching / Oktatás