Covering a Symmetric Poset by Symmetric Chains. - Tamás Fleiner (Comb., 1997)

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. - Tamás Fleiner; Winfried Hochstättler; Monique Laurent; Martin Loebl (J. Comb. Theory B, 1999)

Coverings and structure of crossing families. - Tamás Fleiner; Tibor Jordán (Math. Program., 1999)

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. - Tamás Fleiner; Volker Kaibel; Günter Rote (Eur. J. Comb., 2000)

A Matroid Generalization of the Stable Matching Polytope. - Tamás Fleiner (IPCO, 2001)

Note - Uncrossing a Family of Set-Pairs. - Tamás Fleiner (Comb., 2001)

The Size of 3-Cross-Free Families. - Tamás Fleiner (Comb., 2001)

On a lemma of Scarf. - Ron Aharoni; Tamás Fleiner (J. Comb. Theory B, 2003)

A Fixed-Point Approach to Stable Matchings and Some Applications. - Tamás Fleiner (Math. Oper. Res., 2003)

On the stable b-matching polytope. - Tamás Fleiner (Math. Soc. Sci., 2003)

A constrained independent set problem for matroids. - Tamás Fleiner; András Frank; Satoru Iwata 001 (Oper. Res. Lett., 2004)

On a generalization of the stable roommates problem. - Katarína Cechlárová; Tamás Fleiner (ACM Trans. Algorithms, 2005)

Efficient algorithms for generalized Stable Marriage and Roommates problems. - Tamás Fleiner; Robert W. Irving; David F. Manlove (Theor. Comput. Sci., 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)

Housing Markets Through Graphs. - Katarína Cechlárová; Tamás Fleiner (Algorithmica, 2010)

The Stable Roommates Problem with Choice Functions. - Tamás Fleiner (Algorithmica, 2010)

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

Balanced list edge-colourings of bipartite graphs. - Tamás Fleiner; András Frank (Electron. Notes Discret. Math., 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)

Optimization of an SMD placement machine and flows in parametric networks. - Katarína Cechlárová; Tamás Fleiner (Kybernetika, 2011)

An algorithm for a super-stable roommates problem. - Tamás Fleiner; Robert W. Irving; David F. Manlove (Theor. Comput. Sci., 2011)

The nucleolus of the bankruptcy Problem by Hydraulic rationing. - Tamás Fleiner; Balázs R. Sziklai (IGTR, 2012)

On Stable Matchings and Flows. - Tamás Fleiner (Algorithms, 2014)

Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms. - Tamás Fleiner; Zsuzsanna Jankó (Algorithms, 2014)

Pareto optimality in many-to-many matching problems. - Katarína Cechlárová; Pavlos Eirinakis; Tamás Fleiner; Dimitrios Magos; Ioannis Mourtos; Eva Potpinková (Discret. Optim., 2014)

Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency. - Katarína Cechlárová; Tamás Fleiner; Eva Potpinková (Scientometrics, 2014)

Modelling practical placement of trainee teachers to schools. - Katarína Cechlárová; Tamás Fleiner; David F. Manlove; Iain McBride; Eva Potpinková (Central Eur. J. Oper. Res., 2015)

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

House-swapping with divorcing and engaged pairs. - Katarína Cechlárová; Tamás Fleiner; Zsuzsanna Jankó (Discret. Appl. Math., 2016)

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

A Matroid Approach to Stable Matchings with Lower Quotas. - Tamás Fleiner; Naoyuki Kamiyama (Math. Oper. Res., 2016)

Pareto Optimal Matchings in Many-to-Many Markets with Ties. - Katarína Cechlárová; Pavlos Eirinakis; Tamás Fleiner; Dimitrios Magos; David F. Manlove; Ioannis Mourtos; Eva Oceláková; Baharak Rastegari (Theory Comput. Syst., 2016)

Coloring signed graphs using DFS. - Tamás Fleiner; Gábor Wiener (Optim. Lett., 2016)

On Weighted Kernels of Two Posets. - Tamás Fleiner; Zsuzsanna Jankó (Order, 2016)

Trading networks with bilateral contracts. - Tamás Fleiner; Zsuzsanna Jankó; Akihisa Tamura; Alexander Teytelboym (EAI Endorsed Trans. Serious Games, 2016)

Stable matchings of teachers to schools. - Katarína Cechlárová; Tamás Fleiner; David F. Manlove; Iain McBride (Theor. Comput. Sci., 2016)

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. - Katarína Cechlárová; Tamás Fleiner; Ildikó Schlotter (ADT, 2017)

On the core and nucleolus of directed acyclic graph games. - Balázs R. Sziklai; Tamás Fleiner; Tamás Solymosi (Math. Program., 2017)

Pareto optimal matchings with lower quotas. - Katarína Cechlárová; Tamás Fleiner (Math. Soc. Sci., 2017)

Trading Networks with Frictions. - Tamás Fleiner; Ravi Jagadeesan; Zsuzsanna Jankó; Alexander Teytelboym (EC, 2018)

A Note on Restricted List Edge-Colourings. - Tamás Fleiner (Comb., 2018)

Pareto optimal coalitions of fixed size. - Ágnes Cseh; Tamás Fleiner; Petra Harján (CoRR, 2019)

The Complexity of Cake Cutting with Unequal Shares. - Ágnes Cseh; Tamás Fleiner (ACM Trans. Algorithms, 2020)

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 (WINE, 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)

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)

Complexity of stability in trading networks. - Tamás Fleiner; Zsuzsanna Jankó; Ildikó Schlotter; Alexander Teytelboym (Int. J. Game Theory, 2023)

A new approach to bipartite stable matching optimization. - Tamás Fleiner; András Frank; Tamás Király (CoRR, 2024)