1 citations · 2 across the 3 of their papers we have counts for
8 papers
Hypergraph characterization of split matroids
Kristóf Bérczi, Tamás Király, Tamás Schwarcz +2
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split mat…
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints
Yu Yokoi
We present a polynomial-time -approximation algorithm for the problem of finding a maximum-cardinality stable matching in a many-to-many matching model with ties and l…
Fair and Truthful Mechanism with Limited Subsidy
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase +5
The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guara…
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete…
Equitable Partitions into Matchings and Coverings in Mixed Graphs
Tamás Király, Yu Yokoi
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed…
A Generalized-Polymatroid Approach to Disjoint Common Independent Sets in Two Matroids
Kenjiro Takazawa, Yu Yokoi
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set into common independent sets, where $E…