#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1997

2017

- This year (5)
- Last 5 years (20)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Tamás Fleiner
- Math. Oper. Res.
- 2003

We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that links together seemingly distant results, like the stable marriage… (More)

- Ron Aharoni, Tamás Fleiner
- IPCO
- 2002

The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics has already been… (More)

- Tamás Fleiner
- IPCO
- 2001

- Péter Biró, Tamás Fleiner, Robert W. Irving, David Manlove
- Theor. Comput. Sci.
- 2010

We study two generalised stable matching problems motivated by the current matching scheme used in the higher education sector in Hungary. The first problem is an extension of the College Admissions… (More)

- Tamás Fleiner
- WG
- 2010

We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. We prove that there always exists a stable flow and… (More)

- Katarína Cechlárová, Tamás Fleiner
- ACM Trans. Algorithms
- 2005

We consider two generalizations of the stable roommates problem: a) we allow parallel edges in the underlying graph, and b) we study a problem with multiple partners. We reduce both problems to the… (More)

- Kataŕına Cechlárová, Tamás Fleiner, David Manlove
- 2005

The most effective treatment for kidney failure that is currently known is transplantation. As the number of cadaveric donors is not sufficient and kidneys from living donors are often not suitable… (More)

- Tamás Fleiner
- Combinatorica
- 1997

Here P = ( V , _ , M ) is a symmetric poser if (V,___) is a finite poset and M is a perfect matching on V such that u ___ v and uu~,vv~C M implies u~> v ~. By u-< v we mean that vys A subset… (More)

- Péter Biró, Tamás Fleiner, Robert W. Irving
- Annals of Mathematics and Artificial Intelligence
- 2015

Scarf’s algorithm (Scarf, H. E. Econometrica 35, 50–69 1967) provides fractional core elements for NTU-games. Biró and Fleiner [4] showed that Scarf’s algorithm can be extended for capacitated… (More)

- Tamás Fleiner, Naoyuki Kamiyama
- SODA
- 2012

In SODA’10, Huang introduced the laminar classified stable matching problem (LCSM for short) that is motivated by academic hiring. This problem is an extension of the wellknown hospitals/residents… (More)