default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁgnes Cseh
Person information
- affiliation: University of Bayreuth, Faculty of Mathematics, Physics, and Computer Sciences, Germany
- affiliation (former): Hasso Plattner Institute, Potsdam, Germany
- affiliation (former): Hungarian Academy of Sciences, Institute of Economics, Hungary
- affiliation (PhD 2015): TU Berlin, Institute of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Michael McKay, Ágnes Cseh, David F. Manlove:
Envy-freeness in 3D hedonic games. Auton. Agents Multi Agent Syst. 38(2): 37 (2024)- [j21]Klaus Heeger, Ágnes Cseh
:
Popular matchings with weighted voters. Games Econ. Behav. 144: 300-328 (2024) - 2023
- [j20]Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28(2): 138-165 (2023) - [j19]Sonja Kraiczy, Ágnes Cseh, David F. Manlove:
On weakly and strongly popular rankings. Discret. Appl. Math. 340: 134-152 (2023) - [j18]Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino:
A quest for a fair schedule: The International Young Physicists' Tournament. J. Sched. 26(1): 3-18 (2023) - [c20]Ágnes Cseh, Pascal Führlich, Pascal Lenzner:
The Swiss Gambit. AAMAS 2023: 2505-2507 - [c19]Haris Aziz, Gergely Csáji, Ágnes Cseh:
Computational Complexity of k-Stable Matchings. SAGT 2023: 311-328 - [i27]Ágnes Cseh, Pascal Führlich, Pascal Lenzner:
The Swiss Gambit. CoRR abs/2302.10595 (2023) - [i26]Haris Aziz, Gergely Csáji, Ágnes Cseh:
Computational complexity of k-stable matchings. CoRR abs/2307.03794 (2023) - 2022
- [j17]Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada:
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 27(3): 249-283 (2022) - [j16]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36(1): 188-213 (2022) - [c18]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS 2022: 300-308 - [c17]Ágnes Cseh, Jannik Peters:
Three-Dimensional Popular Matching with Cyclic Preferences. AAMAS 2022: 309-317 - [c16]Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP 2022: 16:1-16:19 - [c15]Pascal Führlich, Ágnes Cseh, Pascal Lenzner:
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. EC 2022: 1101-1102 - [i25]Ildikó Schlotter, Ágnes Cseh:
Maximum-utility popular matchings with bounded instability. CoRR abs/2205.02189 (2022) - [i24]Ágnes Cseh, Michael McKay, David F. Manlove:
Envy-freeness in 3D Hedonic Games. CoRR abs/2209.07440 (2022) - 2021
- [j15]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. Algorithmica 83(5): 1493-1523 (2021) - [j14]Ágnes Cseh, Attila Juhos:
Pairwise Preferences in the Stable Marriage Problem. ACM Trans. Economics and Comput. 9(1): 7:1-7:28 (2021) - [c14]Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh:
Optimal Kidney Exchange with Immunosuppressants. AAAI 2021: 21-29 - [c13]Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang:
Multi-Robot Task Allocation-Complexity and Approximation. AAMAS 2021: 133-141 - [c12]Sonja Kraiczy, Ágnes Cseh, David F. Manlove:
On Weakly and Strongly Popular Rankings. AAMAS 2021: 1563-1565 - [c11]Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada:
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP 2021: 22:1-22:19 - [i23]Sonja Kraiczy, Ágnes Cseh, David F. Manlove:
On absolutely and simply popular rankings. CoRR abs/2102.01361 (2021) - [i22]Haris Aziz, Ágnes Cseh, John P. Dickerson, Duncan C. McElfresh:
Optimal Kidney Exchange with Immunosuppressants. CoRR abs/2103.02253 (2021) - [i21]Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang:
Multi-Robot Task Allocation - Complexity and Approximation. CoRR abs/2103.12370 (2021) - [i20]Ágnes Cseh, Jannik Peters:
Three-Dimensional Popular Matching with Cyclic Preferences. CoRR abs/2105.09115 (2021) - [i19]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto optimal and popular house allocation with lower and upper quotas. CoRR abs/2107.03801 (2021) - [i18]Erika R. Bérczi-Kovács, Ágnes Cseh, Kata Kosztolányi, Attila Mályusz:
Polynomially tractable cases in the popular roommates problem. CoRR abs/2107.06694 (2021) - [i17]Klaus Heeger, Ágnes Cseh:
Popular matchings with weighted voters. CoRR abs/2110.05901 (2021) - [i16]Pascal Führlich, Ágnes Cseh, Pascal Lenzner:
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. CoRR abs/2112.10522 (2021) - 2020
- [j13]Ágnes Cseh, Klaus Heeger:
The stable marriage problem with ties and restricted edges. Discret. Optim. 36: 100571 (2020) - [j12]Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. ACM Trans. Algorithms 16(3): 29:1-29:21 (2020) - [i15]Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino:
A quest for a fair schedule: The Young Physicists' Tournament. CoRR abs/2006.02184 (2020)
2010 – 2019
- 2019
- [j11]Ágnes Cseh, Jannik Matuschke:
New and Simple Algorithms for Stable Flow Problems. Algorithmica 81(6): 2557-2591 (2019) - [j10]Katarína Cechlárová, Ágnes Cseh, David F. Manlove:
Selected open problems in Matching Under Preferences. Bull. EATCS 128 (2019) - [j9]Ágnes Cseh, Martin Skutella:
Paths to stable allocations. Int. J. Game Theory 48(3): 835-862 (2019) - [j8]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Short Lists. Theory Comput. Syst. 63(1): 128-149 (2019) - [c10]Ágnes Cseh, Attila Juhos:
Pairwise Preferences in the Stable Marriage Problem. STACS 2019: 21:1-21:16 - [i14]Ágnes Cseh, Tamás Fleiner, Petra Harján:
Pareto optimal coalitions of fixed size. CoRR abs/1901.06737 (2019) - [i13]Ágnes Cseh, Klaus Heeger:
The stable marriage problem with ties and restricted edges. CoRR abs/1907.10458 (2019) - 2018
- [j7]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80(1): 185-208 (2018) - [j6]Ágnes Cseh, Telikepalli Kavitha:
Popular edges and dominant matchings. Math. Program. 172(1-2): 209-229 (2018) - [c9]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. FSTTCS 2018: 17:1-17:14 - [c8]Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. SAGT 2018: 19-30 - [i12]Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. CoRR abs/1807.01112 (2018) - [i11]Ágnes Cseh, Attila Juhos:
Pairwise preferences in the stable marriage problem. CoRR abs/1810.00392 (2018) - [i10]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Popularity, stability, and the dominant matching polytope. CoRR abs/1811.06897 (2018) - 2017
- [j5]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. SIAM J. Discret. Math. 31(4): 2348-2377 (2017) - [c7]Ágnes Cseh, Jannik Matuschke:
New and Simple Algorithms for Stable Flow Problems. WG 2017: 206-219 - [i9]Ágnes Cseh, Tamás Fleiner:
The complexity of cake cutting with unequal shares. CoRR abs/1709.03152 (2017) - 2016
- [j4]Ágnes Cseh, David F. Manlove:
Stable Marriage and Roommates problems with restricted edges: Complexity and approximability. Discret. Optim. 20: 62-89 (2016) - [j3]Ágnes Cseh:
Marriages are made in calculation. Bull. EATCS 120 (2016) - [j2]Ágnes Cseh, Brian C. Dean:
Improved algorithmic results for unsplittable stable allocation problems. J. Comb. Optim. 32(3): 657-671 (2016) - [c6]Ágnes Cseh, Telikepalli Kavitha:
Popular Edges and Dominant Matchings. IPCO 2016: 138-151 - [c5]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates Problem with Short Lists. SAGT 2016: 207-219 - [i8]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular matchings with two-sided preferences and one-sided ties. CoRR abs/1603.07168 (2016) - [i7]Ágnes Cseh, Robert W. Irving, David F. Manlove:
The Stable Roommates problem with short lists. CoRR abs/1605.04609 (2016) - 2015
- [c4]Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. ICALP (1) 2015: 367-379 - [c3]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC 2015: 176-187 - [c2]Ágnes Cseh, David F. Manlove:
Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability. SAGT 2015: 15-26 - [i6]Ágnes Cseh, Telikepalli Kavitha:
Popular Edges and Dominant Matchings. CoRR abs/1508.00614 (2015) - 2014
- [c1]Ágnes Cseh, Martin Skutella:
Paths to Stable Allocations. SAGT 2014: 61-73 - [i5]Ágnes Cseh, Brian C. Dean:
Improved Algorithmic Results for Unsplittable Stable Allocation Problems. CoRR abs/1411.6818 (2014) - [i4]Ágnes Cseh, David F. Manlove:
Stable marriage and roommates problems with restricted edges: complexity and approximability. CoRR abs/1412.0271 (2014) - [i3]Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke:
The Student/Project Allocation problem with group projects. CoRR abs/1412.0325 (2014) - 2013
- [j1]Ágnes Cseh, Jannik Matuschke, Martin Skutella:
Stable Flows over Time. Algorithms 6(3): 532-545 (2013) - [i2]Ágnes Cseh:
Stable flows with restricted edges. CoRR abs/1309.3701 (2013) - 2012
- [i1]Ágnes Cseh:
Paths to stable allocations. CoRR abs/1211.2169 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
