Ágnes Cseh


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

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


Publications

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

Peer-reviewed papers:

TitleCoauthors Conference Journal 
The complexity of cake cutting with unequal sharesT. Fleinersubmitted 
New and simple algorithms for stable flow problemsJ. MatuschkeWG 2017submitted
The Stable Roommates problem with short lists
R. W. Irving and D. F. ManloveSAGT 2016Theory of Computing Systems (SAGT Special Issue) (online first)
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, 80(1):185-208, 2018
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 2015SIAM Journal on Discrete Mathematics, 31(4):2348-2377, 2017
Improved algorithmic results for unsplittable stable allocation problemsB.C. DeanMATCH-UP 2015Journal of Combinatorial Optimization32:657-671, 2016
Paths to stable allocationsM. SkutellaSAGT 2014submitted
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