"Almost Stable" Matchings in the Roommates Problem. - David J. Abraham; Péter Biró 001; David F. Manlove (WAOA, 2005)

Inapproximability of the kidney exchange problem. - Péter Biró 001; Katarína Cechlárová (Inf. Process. Lett., 2007)

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. - Péter Biró 001; Katarína Cechlárová; Tamás Fleiner (Int. J. Game Theory, 2008)

Maximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs. - Péter Biró 001; David F. Manlove; Romeo Rizzi (Discret. Math. Algorithms Appl., 2009)

Popular Matchings in the Marriage and Roommates Problems. - Péter Biró 001; Robert W. Irving; David F. Manlove (CIAC, 2010)

On Solution Concepts for Matching Games. - Péter Biró 001; Walter Kern; Daniël Paulusma (TAMC, 2010)

Three-Sided Stable Matchings with Cyclic Preferences. - Péter Biró 001; Eric McDermid (Algorithmica, 2010)

The integral stable allocation problem on graphs. - Péter Biró 001; Tamás Fleiner (Discret. Optim., 2010)

The College Admissions problem with lower and common quotas. - Péter Biró 001; Tamás Fleiner; Robert W. Irving; David F. Manlove (Theor. Comput. Sci., 2010)

Size versus stability in the marriage problem. - Péter Biró 001; David F. Manlove; Shubham Mittal 002 (Theor. Comput. Sci., 2010)

Stable matching with couples: An empirical study. - Péter Biró 001; Robert W. Irving; Ildikó Schlotter (ACM J. Exp. Algorithmics, 2011)

Computing solutions for matching games. - Péter Biró 001; Walter Kern; Daniël Paulusma (Int. J. Game Theory, 2012)

"Almost stable" matchings in the Roommates problem with bounded preference lists. - Péter Biró 001; David F. Manlove; Eric McDermid (Theor. Comput. Sci., 2012)

Matching with couples: a Multidisciplinary Survey. - Péter Biró 001; Flip Klijn (IGTR, 2013)

Analysis of stochastic matching markets. - Péter Biró 001; Gethin Norman (Int. J. Game Theory, 2013)

Integer Programming Methods for Special College Admissions Problems. - Péter Biró 001; Iain McBride (COCOA, 2014)

The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models. - Péter Biró 001; David F. Manlove; Iain McBride (SEA, 2014)

Editorial: Special Issue on Matching under Preferences. - Péter Biró 001; David F. Manlove (Algorithms, 2014)

Matching with sizes (or scheduling with processing set restrictions). - Péter Biró 001; Eric McDermid (Discret. Appl. Math., 2014)

Solutions for the stable roommates problem with payments. - Péter Biró 001; Matthijs Bomhoff; Petr A. Golovach; Walter Kern; Daniël Paulusma (Theor. Comput. Sci., 2014)

College admissions with stable score-limits. - Péter Biró 001; Sofya G. Kiselgof (Central Eur. J. Oper. Res., 2015)

Fair apportionment in the view of the Venice Commission's recommendation. - Péter Biró 001; László Á. Kóczy; Balázs R. Sziklai (Math. Soc. Sci., 2015)

Optimal Reallocation under Additive and Ordinal Preferences. - Haris Aziz 001; Péter Biró 001; Jérôme Lang; Julien Lesca; Jérôme Monnot (AAMAS, 2016)

Matching couples with Scarf's algorithm. - Péter Biró 001; Tamás Fleiner; Robert W. Irving (Ann. Math. Artif. Intell., 2016)

Fractional solutions for capacitated NTU-games, with applications to stable matchings. - Péter Biró 001; Tamás Fleiner (Discret. Optim., 2016)

Integer programming methods for special college admissions problems. - Kolos Csaba Ágoston; Péter Biró 001; Iain McBride (J. Comb. Optim., 2016)

A new solution concept for the roommate problem: Q-stable matchings. - Péter Biró 001; María Elena Iñarra García; Elena Molis (Math. Soc. Sci., 2016)

Modelling Preference Ties And Equal Treatment Policy. - Kolos Csaba Ágoston; Péter Biró 001 (ECMS, 2017)

Stable project allocation under distributional constraints. - Kolos Csaba Ágoston; Péter Biró 001; Richárd Szántó (CoRR, 2017)

The stable fixtures problem with payments. - Péter Biró 001; Walter Kern; Daniël Paulusma; Péter Wojuteczky (Games Econ. Behav., 2018)

Pareto Optimal Allocation under Compact Uncertain Preferences. - Haris Aziz 001; Péter Biró 001; Ronald de Haan; Baharak Rastegari (AAAI, 2019)

Generalized Matching Games for International Kidney Exchange. - Péter Biró 001; Walter Kern; Dömötör Pálvölgyi; Daniël Paulusma (AAMAS, 2019)

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity. - Haris Aziz 001; Péter Biró 001; Ronald de Haan; Baharak Rastegari (Artif. Intell., 2019)

Efficient reallocation under additive and responsive preferences. - Haris Aziz 001; Péter Biró 001; Jérôme Lang; Julien Lesca; Jérôme Monnot (Theor. Comput. Sci., 2019)

Summer Internship Matching with Funding Constraints. - Haris Aziz 001; Anton Baychkov; Péter Biró 001 (AAMAS, 2020)

Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes. - Péter Biró 001; Márton Gyetvai; Xenia Klimentova; João Pedro Pedroso; William Pettersson; Ana Viana (ECMS, 2020)

Stable Matching with Uncertain Linear Preferences. - Haris Aziz 001; Péter Biró 001; Serge Gaspers; Ronald de Haan; Nicholas Mattei; Baharak Rastegari (Algorithmica, 2020)

Seat transfers in the course allocation mechanism of Eötvös Loránd University. - Attila Rusznák; Péter Biró 001; Rita Fleiner (SACI, 2021)

IP solutions for international kidney exchange programmes. - Radu Stefan Mincu; Péter Biró 001; Márton Gyetvai; Alexandru Popa 001; Utkarsh Verma (Central Eur. J. Oper. Res., 2021)

Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301). - Haris Aziz 001; Péter Biró 001; Tamás Fleiner; Bettina Klaus (Dagstuhl Reports, 2021)

Complexity of finding Pareto-efficient allocations of highest welfare. - Péter Biró 001; Jens Gudmundsson (Eur. J. Oper. Res., 2021)

Modelling and optimisation in European Kidney Exchange Programmes. - Péter Biró 001; Joris van de Klundert; David F. Manlove; William Pettersson; Tommy Andersson; Lisa Burnapp; Pavel Chromy; Pablo Delgado; Piotr Dworczak; Bernadette Haase; Aline Hemke; Rachel Johnson; et al. (Eur. J. Oper. Res., 2021)

Matching Market Design with Constraints. - Haris Aziz 001; Péter Biró 001; Makoto Yokoo (AAAI, 2022)

Computing Balanced Solutions for Large International Kidney Exchange Schemes. - Márton Benedek; Péter Biró 001; Walter Kern; Daniël Paulusma (AAMAS, 2022)

The Large Core of College Admission Markets: Theory and Evidence. - Péter Biró 001; Avinatan Hassidim; Assaf Romm; Ran I. Shorrer; Sándor Sovago (EC, 2022)

The efficacy of tournament designs. - Balázs R. Sziklai; Péter Biró 001; László Csató (Comput. Oper. Res., 2022)

Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences. - Péter Biró 001; Gergely Csáji (CoRR, 2022)

College admissions with ties and common quotas: Integer programming approach. - Kolos Csaba Ágoston; Péter Biró 001; Endre Kováts; Zsuzsanna Jankó (Eur. J. Oper. Res., 2022)

Serial Rules in a Multi-Unit Shapley-Scarf Market. - Péter Biró 001; Flip Klijn; Szilvia Pápai (Games Econ. Behav., 2022)

Stable matching with uncertain pairwise preferences. - Haris Aziz 001; Péter Biró 001; Tamás Fleiner; Serge Gaspers; Ronald de Haan; Nicholas Mattei; Baharak Rastegari (Theor. Comput. Sci., 2022)

Partitioned Matching Games for International Kidney Exchange. - Márton Benedek; Péter Biró 001; Walter Kern; Dömötör Pálvölgyi; Daniël Paulusma (CoRR, 2023)

The Complexity of Matching Games: A Survey. - Márton Benedek; Péter Biró 001; Matthew Johnson 002; Daniël Paulusma; Xin Ye (J. Artif. Intell. Res., 2023)

Online voluntary mentoring: Optimising the assignment of students and mentors. - Péter Biró 001; Márton Gyetvai (Eur. J. Oper. Res., 2023)

Novel integer programming models for the stable kidney exchange problem. - Xenia Klimentova; Péter Biró 001; Ana Viana; Virginia Costa; João Pedro Pedroso (Eur. J. Oper. Res., 2023)

Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. - Márton Benedek; Péter Biró 001; Gergely Csáji; Matthew Johnson 002; Daniël Paulusma; Xin Ye (AAMAS, 2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization. - Haris Aziz 001; Gergely Csáji; Péter Biró 001 (CoRR, 2024)

Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. - Péter Biró 001; Gergely Csáji (Games Econ. Behav., 2024)

Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange. - Péter Biró 001; Flip Klijn; Xenia Klimentova; Ana Viana (Math. Oper. Res., 2024)

Cutoff stability under distributional constraints with an application to summer internship matching. - Haris Aziz 001; Anton Baychkov; Péter Biró 001 (Math. Program., 2024)

Optimization methods and algorithms. - Péter Biró 001; Sándor Bozóki; Tamás Király; Alexandru Kristály (Central Eur. J. Oper. Res., 2024)

Computing balanced solutions for large international kidney exchange schemes. - Márton Benedek; Péter Biró 001; Daniël Paulusma; Xin Ye (Auton. Agents Multi Agent Syst., 2024)

Overview of Hungarian operations research based on the VOCAL 2022 conference. - Botond Bertók; Péter Biró 001; Marianna E.-Nagy (Central Eur. J. Oper. Res., 2024)

Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator. - Kristóf Druzsin; Péter Biró 001; Xenia Klimentova; Rita Fleiner (Central Eur. J. Oper. Res., 2024)

Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator. - Lilla Matyasi; Péter Biró 001 (Central Eur. J. Oper. Res., 2024)

Stable Hypergraph Matching in Unimodular Hypergraphs. - Péter Biró 001; Gergely Csáji; Ildikó Schlotter (ICALP, 2025)

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing up Your Home? - Ildikó Schlotter; Péter Biró 001; Tamás Fleiner (Math. Oper. Res., 2025)