A fixed-point approach to stable matchings and some applications T Fleiner Mathematics of Operations research 28 (1), 103-126, 2003 | 331 | 2003 |

The college admissions problem with lower and common quotas P Biró, T Fleiner, RW Irving, DF Manlove Theoretical Computer Science 411 (34-36), 3136-3153, 2010 | 243 | 2010 |

On a generalization of the stable roommates problem K Cechlárová, T Fleiner ACM Transactions on Algorithms (TALG) 1 (1), 143-156, 2005 | 98 | 2005 |

Trading networks with frictions T Fleiner, R Jagadeesan, Z Jankó, A Teytelboym Econometrica 87 (5), 1633-1661, 2019 | 78 | 2019 |

On a lemma of Scarf R Aharoni, T Fleiner Journal of Combinatorial Theory, Series B 87 (1), 72-80, 2003 | 68 | 2003 |

Efficient algorithms for generalized stable marriage and roommates problems T Fleiner, RW Irving, DF Manlove Theoretical computer science 381 (1-3), 162-176, 2007 | 67 | 2007 |

A matroid approach to stable matchings with lower quotas T Fleiner, N Kamiyama Mathematics of Operations Research 41 (2), 734-744, 2016 | 54 | 2016 |

On the stable b-matching polytope T Fleiner Mathematical Social Sciences 46 (2), 149-158, 2003 | 49 | 2003 |

A matroid generalization of the stable matching polytope T Fleiner International Conference on Integer Programming and Combinatorial …, 2001 | 48 | 2001 |

Trading networks with bilateral contracts T Fleiner, Z Jankó, A Tamura, A Teytelboym arXiv preprint arXiv:1510.01210, 2015 | 41 | 2015 |

Pareto optimality in many-to-many matching problems K Cechlárová, P Eirinakis, T Fleiner, D Magos, I Mourtos, E Potpinková Discrete Optimization 14, 160-169, 2014 | 37 | 2014 |

The kidney exchange game K Cechlárová, T Fleiner, D Manlove | 36 | 2005 |

Stable matching with uncertain pairwise preferences H Aziz, P Biró, T Fleiner, S Gaspers, R Haan | 35 | 2017 |

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems P Biró, K Cechlárová, T Fleiner International Journal of Game Theory 36 (3-4), 333-352, 2008 | 35 | 2008 |

Some results on stable matchings and fixed points T Fleiner Egerváry Res. Group, Budapest, Hungary, Tech. Rep. TR-2002-08, 2002 | 34 | 2002 |

Upper bounds on the maximal number of facets of 0/1-polytopes T Fleiner, V Kaibel, G Rote European Journal of Combinatorics 21 (1), 121-130, 2000 | 33 | 2000 |

On stable matchings and flows T Fleiner Algorithms 7 (1), 1-14, 2014 | 28 | 2014 |

A quick proof for the cactus representation of mincuts T Fleiner, A Frank EGRES Quick Proof 3, 2009, 2009 | 27 | 2009 |

A matroid approach to stable matchings with lower quotas T Fleiner, N Kamiyama Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 25 | 2012 |

The complexity of cake cutting with unequal shares Á Cseh, T Fleiner ACM Transactions on Algorithms (TALG) 16 (3), 1-21, 2020 | 23 | 2020 |