Tamás Fleiner

According to our database1, Tamás Fleiner authored at least 47 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Complexity of stability in trading networks.
Int. J. Game Theory, September, 2023

2022
Stable matching with uncertain pairwise preferences.
Theor. Comput. Sci., 2022

2021
Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301).
Dagstuhl Reports, 2021

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home?
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020
The Complexity of Cake Cutting with Unequal Shares.
ACM Trans. Algorithms, 2020

2019
Pareto optimal coalitions of fixed size.
CoRR, 2019

2018
A Note on Restricted List Edge-Colourings.
Comb., 2018

Trading Networks with Frictions.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Pareto optimal matchings with lower quotas.
Math. Soc. Sci., 2017

On the core and nucleolus of directed acyclic graph games.
Math. Program., 2017

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
Stable matchings of teachers to schools.
Theor. Comput. Sci., 2016

Trading networks with bilateral contracts.
EAI Endorsed Trans. Serious Games, 2016

On Weighted Kernels of Two Posets.
Order, 2016

Coloring signed graphs using DFS.
Optim. Lett., 2016

Pareto Optimal Matchings in Many-to-Many Markets with Ties.
Theory Comput. Syst., 2016

A Matroid Approach to Stable Matchings with Lower Quotas.
Math. Oper. Res., 2016

Fractional solutions for capacitated NTU-games, with applications to stable matchings.
Discret. Optim., 2016

House-swapping with divorcing and engaged pairs.
Discret. Appl. Math., 2016

Matching couples with Scarf's algorithm.
Ann. Math. Artif. Intell., 2016

2015
Modelling practical placement of trainee teachers to schools.
Central Eur. J. Oper. Res., 2015

2014
Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency.
Scientometrics, 2014

Pareto optimality in many-to-many matching problems.
Discret. Optim., 2014

Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms.
Algorithms, 2014

On Stable Matchings and Flows.
Algorithms, 2014

2012
The nucleolus of the bankruptcy Problem by Hydraulic rationing.
IGTR, 2012

2011
An algorithm for a super-stable roommates problem.
Theor. Comput. Sci., 2011

Optimization of an SMD placement machine and flows in parametric networks.
Kybernetika, 2011

2010
The College Admissions problem with lower and common quotas.
Theor. Comput. Sci., 2010

Balanced list edge-colourings of bipartite graphs.
Electron. Notes Discret. Math., 2010

The integral stable allocation problem on graphs.
Discret. Optim., 2010

The Stable Roommates Problem with Choice Functions.
Algorithmica, 2010

Housing Markets Through Graphs.
Algorithmica, 2010

2008
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems.
Int. J. Game Theory, 2008

2007
Efficient algorithms for generalized Stable Marriage and Roommates problems.
Theor. Comput. Sci., 2007

2005
On a generalization of the stable roommates problem.
ACM Trans. Algorithms, 2005

2004
A constrained independent set problem for matroids.
Oper. Res. Lett., 2004

2003
On the stable b-matching polytope.
Math. Soc. Sci., 2003

A Fixed-Point Approach to Stable Matchings and Some Applications.
Math. Oper. Res., 2003

On a lemma of Scarf.
J. Comb. Theory, Ser. B, 2003

2001
The Size of 3-Cross-Free Families.
Comb., 2001

Note - Uncrossing a Family of Set-Pairs.
Comb., 2001

A Matroid Generalization of the Stable Matching Polytope.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.
Eur. J. Comb., 2000

1999
Coverings and structure of crossing families.
Math. Program., 1999

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
J. Comb. Theory, Ser. B, 1999

1997
Covering a Symmetric Poset by Symmetric Chains.
Comb., 1997


  Loading...