default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Fleiner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Tamás Fleiner, András Frank, Tamás Király:
A new approach to bipartite stable matching optimization. CoRR abs/2409.04885 (2024)- 2023
- [j41]Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym
:
Complexity of stability in trading networks. Int. J. Game Theory 52(3): 629-648 (2023) - 2022
- [j40]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable matching with uncertain pairwise preferences. Theor. Comput. Sci. 909: 1-11 (2022) - 2021
- [c12]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home? WINE 2021: 244-261 - [i8]Ildikó Schlotter, Péter Biró, Tamás Fleiner:
The core of housing markets from an agent's perspective: Is it worth sprucing up your home? CoRR abs/2110.06875 (2021) - [i7]Haris Aziz, Péter Biró, Tamás Fleiner, Bettina Klaus:
Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301). Dagstuhl Reports 11(6): 124-146 (2021) - 2020
- [j39]Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. ACM Trans. Algorithms 16(3): 29:1-29:21 (2020)
2010 – 2019
- 2019
- [i6]Ágnes Cseh, Tamás Fleiner, Petra Harján:
Pareto optimal coalitions of fixed size. CoRR abs/1901.06737 (2019) - 2018
- [j38]Tamás Fleiner:
A Note on Restricted List Edge-Colourings. Comb. 38(5): 1265-1267 (2018) - [c11]Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. SAGT 2018: 19-30 - [c10]Tamás Fleiner, Ravi Jagadeesan, Zsuzsanna Jankó, Alexander Teytelboym:
Trading Networks with Frictions. EC 2018: 615 - [c9]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading Networks with Bilateral Contracts. WINE 2018: 444 - [i5]Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter, Alexander Teytelboym:
Complexity of Stability in Trading Networks. CoRR abs/1805.08758 (2018) - 2017
- [j37]Balázs R. Sziklai, Tamás Fleiner, Tamás Solymosi:
On the core and nucleolus of directed acyclic graph games. Math. Program. 163(1-2): 243-271 (2017) - [j36]Katarína Cechlárová, Tamás Fleiner:
Pareto optimal matchings with lower quotas. Math. Soc. Sci. 88: 3-10 (2017) - [c8]Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter:
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. ADT 2017: 300-314 - [c7]Haris Aziz, Péter Biró, Tamás Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari:
Stable Matching with Uncertain Pairwise Preferences. AAMAS 2017: 344-352 - [i4]Ágnes Cseh, Tamás Fleiner:
The complexity of cake cutting with unequal shares. CoRR abs/1709.03152 (2017) - 2016
- [j35]Péter Biró, Tamás Fleiner, Robert W. Irving:
Matching couples with Scarf's algorithm. Ann. Math. Artif. Intell. 77(3-4): 303-316 (2016) - [j34]Katarína Cechlárová, Tamás Fleiner, Zsuzsanna Jankó:
House-swapping with divorcing and engaged pairs. Discret. Appl. Math. 206: 1-8 (2016) - [j33]Péter Biró, Tamás Fleiner:
Fractional solutions for capacitated NTU-games, with applications to stable matchings. Discret. Optim. 22: 241-254 (2016) - [j32]Tamás Fleiner, Naoyuki Kamiyama:
A Matroid Approach to Stable Matchings with Lower Quotas. Math. Oper. Res. 41(2): 734-744 (2016) - [j31]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59(4): 700-721 (2016) - [j30]Tamás Fleiner, Gábor Wiener:
Coloring signed graphs using DFS. Optim. Lett. 10(4): 865-869 (2016) - [j29]Tamás Fleiner, Zsuzsanna Jankó:
On Weighted Kernels of Two Posets. Order 33(1): 51-65 (2016) - [j28]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading networks with bilateral contracts. EAI Endorsed Trans. Serious Games 3(11): e1 (2016) - [j27]Katarína Cechlárová, Tamás Fleiner, David F. Manlove, Iain McBride:
Stable matchings of teachers to schools. Theor. Comput. Sci. 653: 15-25 (2016) - 2015
- [j26]Katarína Cechlárová, Tamás Fleiner, David F. Manlove, Iain McBride, Eva Potpinková:
Modelling practical placement of trainee teachers to schools. Central Eur. J. Oper. Res. 23(3): 547-562 (2015) - [c6]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT 2015: 27-39 - [i3]Katarína Cechlárová, Tamás Fleiner, David F. Manlove, Iain McBride:
Stable matchings of teachers to schools. CoRR abs/1501.05547 (2015) - [i2]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. CoRR abs/1507.02866 (2015) - [i1]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading Networks with Bilateral Contracts. CoRR abs/1510.01210 (2015) - 2014
- [j25]Tamás Fleiner:
On Stable Matchings and Flows. Algorithms 7(1): 1-14 (2014) - [j24]Tamás Fleiner, Zsuzsanna Jankó:
Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms. Algorithms 7(1): 32-59 (2014) - [j23]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková:
Pareto optimality in many-to-many matching problems. Discret. Optim. 14: 160-169 (2014) - [j22]Katarína Cechlárová, Tamás Fleiner, Eva Potpinková:
Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency. Scientometrics 99(2): 495-506 (2014) - 2012
- [j21]Tamás Fleiner, Balázs R. Sziklai:
The nucleolus of the bankruptcy Problem by Hydraulic rationing. IGTR 14(1) (2012) - [c5]Tamás Fleiner, Naoyuki Kamiyama:
A matroid approach to stable matchings with lower quotas. SODA 2012: 135-142 - 2011
- [j20]Katarína Cechlárová, Tamás Fleiner:
Optimization of an SMD placement machine and flows in parametric networks. Kybernetika 47(5): 722-731 (2011) - [j19]Tamás Fleiner, Robert W. Irving, David F. Manlove:
An algorithm for a super-stable roommates problem. Theor. Comput. Sci. 412(50): 7059-7065 (2011) - 2010
- [j18]Katarína Cechlárová, Tamás Fleiner:
Housing Markets Through Graphs. Algorithmica 58(1): 19-33 (2010) - [j17]Tamás Fleiner:
The Stable Roommates Problem with Choice Functions. Algorithmica 58(1): 82-101 (2010) - [j16]Péter Biró, Tamás Fleiner:
The integral stable allocation problem on graphs. Discret. Optim. 7(1-2): 64-73 (2010) - [j15]Tamás Fleiner, András Frank:
Balanced list edge-colourings of bipartite graphs. Electron. Notes Discret. Math. 36: 837-842 (2010) - [j14]Péter Biró, Tamás Fleiner, Robert W. Irving, David F. Manlove:
The College Admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34-36): 3136-3153 (2010) - [c4]Tamás Fleiner:
On Stable Matchings and Flows. WG 2010: 51-62
2000 – 2009
- 2008
- [j13]Péter Biró, Katarína Cechlárová, Tamás Fleiner:
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int. J. Game Theory 36(3-4): 333-352 (2008) - [c3]Tamás Fleiner:
The Stable Roommates Problem with Choice Functions. IPCO 2008: 385-400 - 2007
- [j12]Tamás Fleiner, Robert W. Irving, David F. Manlove:
Efficient algorithms for generalized Stable Marriage and Roommates problems. Theor. Comput. Sci. 381(1-3): 162-176 (2007) - 2005
- [j11]Katarína Cechlárová, Tamás Fleiner:
On a generalization of the stable roommates problem. ACM Trans. Algorithms 1(1): 143-156 (2005) - 2004
- [j10]Tamás Fleiner, András Frank, Satoru Iwata:
A constrained independent set problem for matroids. Oper. Res. Lett. 32(1): 23-26 (2004) - 2003
- [j9]Ron Aharoni, Tamás Fleiner:
On a lemma of Scarf. J. Comb. Theory B 87(1): 72-80 (2003) - [j8]Tamás Fleiner:
A Fixed-Point Approach to Stable Matchings and Some Applications. Math. Oper. Res. 28(1): 103-126 (2003) - [j7]Tamás Fleiner:
On the stable b-matching polytope. Math. Soc. Sci. 46(2): 149-158 (2003) - 2002
- [c2]Ron Aharoni, Tamás Fleiner:
On a Lemma of Scarf. IPCO 2002: 176-187 - 2001
- [j6]Tamás Fleiner:
Note - Uncrossing a Family of Set-Pairs. Comb. 21(1): 145-150 (2001) - [j5]Tamás Fleiner:
The Size of 3-Cross-Free Families. Comb. 21(3): 445-448 (2001) - [c1]Tamás Fleiner:
A Matroid Generalization of the Stable Matching Polytope. IPCO 2001: 105-114 - 2000
- [j4]Tamás Fleiner, Volker Kaibel, Günter Rote:
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. Eur. J. Comb. 21(1): 121-130 (2000)
1990 – 1999
- 1999
- [j3]Tamás Fleiner, Winfried Hochstättler, Monique Laurent, Martin Loebl:
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions. J. Comb. Theory B 77(1): 25-38 (1999) - [j2]Tamás Fleiner, Tibor Jordán:
Coverings and structure of crossing families. Math. Program. 84(3): 505-518 (1999) - 1997
- [j1]Tamás Fleiner:
Covering a Symmetric Poset by Symmetric Chains. Comb. 17(3): 339-344 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
