Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

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.

[ 2019 ] [ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2013 ]

2019 [ nach oben ]

  • Cseh, Ágnes; Matuschke, JannikNew and Simple Algorithms for Stable Flow Problems. Algorithmica 2019
     
  • Cechlárová, Katarína; Cseh, Ágnes; Manlove, DavidSelected open problems in Matching Under Preferences. Bulletin of the European Association for Theoretical Computer Science 2019
     
  • Cseh, Ágnes; Skutella, MartinPaths to stable allocations. International Journal of Game Theory 2019
     
  • Cseh, Ágnes; Irving, Robert W.; Manlove, David F.The Stable Roommates Problem with Short Lists. Theory of Computing Systems 2019
     
  • Cseh, Ágnes; Juhos, AttilaPairwise Preferences in the Stable Marriage Problem. Symposium Theoretical Aspects of Computer Science (STACS) 2019
     

2018 [ nach oben ]

  • Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, JannikMatchings with Lower Quotas: Algorithms and Complexity. Algorithmica 2018
     
  • Cseh, Ágnes; Kavitha, TelikepalliPopular edges and dominant matchings. Mathematical Programming 2018
     
  • Cseh, Ágnes; Kavitha, TelikepalliPopular Matchings in Complete Graphs. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2018
     
  • Cseh, Ágnes; Fleiner, TamásThe Complexity of Cake Cutting with Unequal Shares. Symposium Algorithmic Game Theory (SAGT) 2018
     

2017 [ nach oben ]

  • Cseh, Ágnes; Huang, Chien{-}Chung; Kavitha, TelikepalliPopular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM Journal on Discrete Mathematics 2017
     
  • Cseh, Ágnes; Matuschke, JannikNew and Simple Algorithms for Stable Flow Problems. Workshop Graph-Theoretic Concepts in Computer Science (WG) 2017
     

2016 [ nach oben ]

  • Cseh, ÁgnesMarriages are made in calculation. Bulletin of the European Association for Theoretical Computer Science 2016
     
  • Cseh, Ágnes; Manlove, David F.Stable Marriage and Roommates problems with restricted edges: Complexity and approximability. Discrete Optimization 2016
     
  • Cseh, Ágnes; Dean, Brian C.Improved algorithmic results for unsplittable stable allocation problems. Journal of Combinatorial Optimization 2016
     
  • Cseh, Ágnes; Kavitha, TelikepalliPopular Edges and Dominant Matchings. International Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016
     
  • Cseh, Ágnes; Irving, Robert W.; Manlove, David F.The Stable Roommates Problem with Short Lists. Symposium Algorithmic Game Theory (SAGT) 2016
     

2015 [ nach oben ]

  • Cseh, Ágnes; Huang, Chien-Chung; Kavitha, TelikepalliPopular Matchings with Two-Sided Preferences and One-Sided Ties. International Colloquium on Automata, Languages and Programming (ICALP) 2015
     
  • Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, JannikMany-to-one Matchings with Lower Quotas: Algorithms and Complexity. International Symposium Algorithms and Computation (ISAAC) 2015
     
  • Cseh, Ágnes; Manlove, David F.Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability. Symposium Algorithmic Game Theory (SAGT) 2015
     

2014 [ nach oben ]

  • Cseh, Ágnes; Skutella, MartinPaths to Stable Allocations. Symposium Algorithmic Game Theory (SAGT) 2014
     

2013 [ nach oben ]

  • Cseh, Ágnes; Matuschke, Jannik; Skutella, MartinStable Flows over Time. Algorithms 2013