3 papers
math.CO2024
Rainbow Arborescence Conjecture
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi +1
The famous Ryser--Brualdi--Stein conjecture asserts that every Latin square contains a partial transversal of size . Since its appearance, the conjecture has attr…
cs.GT2024
A new approach to bipartite stable matching optimization
Tamás Fleiner, András Frank, Tamás Király
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for comp…
cs.GT2024
The NTU Partitioned Matching Game for International Kidney Exchange Programs
Gergely Csáji, Tamás Király, Zsuzsa Mészáros-Karkus
Motivated by the real-world problem of international kidney exchange (IKEP), recent literature introduced a generalized transferable utility matching game featuring a partition of…