Publications
Book chapter + survey paper
Selected open problems in Matching Under Preferences. With K. Cechlárová and D.F. Manlove. Bulletin of EATCS, number 128, June 2019.
Popular matchings. In Trends in Computational Social Choice, editor: Ulle Endriss. AI Access, 2017.
Peer-reviewed papers
Popular matchings with weighted voters. With K. Heeger. MATCH-UP 2022. Games and Economic Behavior, 144:300–328, 2024.
Computational complexity of k-stable matchings. With H. Aziz and G. Csáji. SAGT 2023.
The Swiss Gambit. With P. Führlich and P. Lenzner. Extended abstract, AAMAS 2023.
A quest for a fair schedule: The Young Physicists' Tournament. With K. Cechlárová, Zs. Jankó, M. Kireš, and L. Miňo. Journal of Scheduling, 26:3–18, 2023.
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. With P. Führlich and P. Lenzner. EC 2022. Journal of Quantitative Analysis of Sports, 2024.
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. With G. Escamocher and L. Quesada. CP 2022. Constraints 28, 138–165, 2023.
Three-Dimensional Popular Matching with Cyclic Preferences. With J. Peters. AAMAS 2022.
Pareto optimal and popular house allocation with lower and upper quotas. With T. Friedrich and J. Peters. AAMAS 2022.
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. With G. Escamocher, B. Genç, and L. Quesada. CP 2021. Constraints, 27, 249–283, 2022.
Understanding popular matchings via stable matchings. With Y. Faenza, T. Kavitha, and V. Powers. SIAM Journal on Discrete Mathematics, 36(1), 188–213, 2022.
On weakly and strongly popular rankings. With S. Kraiczy and D. Manlove. Extended abstract, AAMAS 2021. Discrete Applied Mathematics, 340:134-152, 2023.
Multi-Robot Task Allocation—Complexity and Approximation. With H. Aziz, H. Chan, B. Li, F. Ramezani, and C. Wang. AAMAS 2021.
Optimal Kidney Exchange with Immunosuppressants. With H. Aziz, J. Dickerson, and D. McElfresh. AAAI 2021.
Organizing Time Exchanges: Lessons from Matching Markets. With T. Andersson, L. Ehlers, and A. Erlanson. American Economic Journal: Microeconomics, 13 (1), 338-373, 2021.
The stable marriage problem with ties and restricted edges. With K. Heeger. Discrete Optimization, 36:100571, 2020.
Pareto optimal coalitions of fixed size. With T. Fleiner and P. Harján. MATCH-UP 2019. Journal of Mechanism and Institution Design, 4(1):87-108 , 2019.
Pairwise preferences in the stable marriage problem. With A. Juhos. STACS 2019, Transactions on Economics and Computation, article no. 7, 2021.
Popular Matchings in Complete Graphs. With T. Kavitha. FSTTCS 2018, Algorithmica, 83(5), 1493-1523, 2021.
The complexity of cake cutting with unequal shares. With T. Fleiner. SAGT 2018, Best Paper Award. ACM Transactions on Algorithms, 16:3, Article 29, June 2020.
New and simple algorithms for stable flow problems. With J. Matuschke. WG 2017. Algorithmica, 81(6), 2557-2591, 2019.
The Stable Roommates problem with short lists. With R. W. Irving and D. F. Manlove. SAGT 2016. Theory of Computing Systems, SAGT Special Issue, 63(1): 128-149, 2019.
Popular Edges and Dominant Matchings. With T. Kavitha. IPCO 2016. Mathematical Programming, 172(1), 209-229, 2018.
Popular matchings with two-sided preferences and one-sided ties. With C.-C. Huang and T. Kavitha. ICALP 2015. SIAM Journal on Discrete Mathematics, 31(4) :2348-2377, 2017.
Matchings with lower quotas: Algorithms and complexity. With A. Arulselvan, M. Groß, D. F. Manlove, and J. Matuschke. ISAAC 2015. Algorithmica, 80(1):185-208, 2018.
Stable marriage and roommates problems with restricted edges: complexity and approximability. With D. F. Manlove. SAGT 2015. Discrete Optimization, 20:62-89, 2016.
Improved Algorithmic Results for Unsplittable Stable Allocation Problems. With B. C. Dean. MATCH-UP 2015. Journal of Combinatorial Optimization, 32:657-671, 2016.
Paths to stable allocations. With M. Skutella. SAGT 2014. International Journal of Game Theory, 48(3), 835-862, 2019.
Stable flows over time. With J. Matuschke and M. Skutella. MATCH-UP 2012. Algorithms (MATCH-UP Special Issue), 6:532-545, 2013.
Preprints
Polynomially tractable cases in the popular roommates problem. With E. Bérczi-Kovács, K. Kosztolányi, and A. Mályusz.
Maximum-utility popular matchings with bounded instability. With I. Schlotter.
Envy-freeness in 3D Hedonic Games. With M. McKay and D. Manlove.
Popular science publications
Neue Initiative für Crossover-Nierenspenden. DIATRA 2-2020.
A hazai egyetemi ponthatárok összefüggései. A felvételi rendszer matematikája. Élet és tudomány, 73. évf (2018) 46. sz. 1458-1460. o.
Hogyan lesz minden játékos elégedett? A tortaszeletelés tudománya. Élet és tudomány, 73. évf (2018) 28. sz. 870-872.o. Winner entry of the 2018 Science Communication Competition of the magazine.
Matematika a párkapcsolatokban. Tiltott frigyek, házasságszédelgés és válás. Élet és tudomány, 73. évf (2018). 4. sz. 111-113.o.
Dénes Kőnig: On graphs and their application to determinant and set theory. English translation of the original paper appeared in Hungarian and German in 1916, on the occasion of its centenary, December 2016.
Marriages are made in calculations. English translation of the winner entry of the Klaus Tschira Award 2016. Foreword by Luca Aceto. Published in the Bulletin of EATCS, number 120, p. 179-183, October 2016.
Heiraten nach Plan. Winner entry of the Klaus Tschira Award 2016 in Mathematics. Published in bild der wissenschaft, p. 20-23, October 2016.
Was Ehestifter und Nierenspender verbindet. The Noble Matchmakers. Article in Mitteilungen der Deutschen Mathematiker-Vereinigung, vol. 20, issue 4, p. 212-214, 2012.