On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market. - Kazuo Murota; Yu Yokoi (Math. Oper. Res., 2015)

A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas. - Yu Yokoi (Math. Oper. Res., 2017)

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. - Yasushi Kawase; Yutaro Yamaguchi 001; Yu Yokoi (EC, 2018)

List Supermodular Coloring. - Satoru Iwata 001; Yu Yokoi (Comb., 2018)

List Supermodular Coloring with Shorter Lists. - Yu Yokoi (Comb., 2019)

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. - Satoru Iwata 001; Yu Yokoi (CoRR, 2019)

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. - Satoru Fujishige; Kenjiro Takazawa; Yu Yokoi (CoRR, 2019)

A generalized-polymatroid approach to disjoint common independent sets in two matroids. - Kenjiro Takazawa; Yu Yokoi (Discret. Math., 2019)

Matroidal Choice Functions. - Yu Yokoi (SIAM J. Discret. Math., 2019)

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths. - Satoru Iwata 001; Yu Yokoi (SODA, 2020)

Envy-Free Matchings with Lower Quotas. - Yu Yokoi (Algorithmica, 2020)

Finding a Stable Allocation in Polymatroid Intersection. - Satoru Iwata 001; Yu Yokoi (Math. Oper. Res., 2020)

Subgame Perfect Equilibria of Sequential Matching Games. - Yasushi Kawase; Yutaro Yamaguchi 001; Yu Yokoi (ACM Trans. Economics and Comput., 2020)

An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. - Yu Yokoi (ISAAC, 2021)

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. - Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (SAGT, 2022)

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. - Hiromichi Goko; Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (STACS, 2022)

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. - Kazuhisa Makino; Shuichi Miyazaki; Yu Yokoi (CoRR, 2022)

Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. - Kohei Morita; Shinya Shiroshita; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2022)

Equitable partitions into matchings and coverings in mixed graphs. - Tamás Király; Yu Yokoi (Discret. Math., 2022)

Approximation by lexicographically maximal solutions in matching and matroid intersection problems. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (Theor. Comput. Sci., 2022)

Random Assignment of Indivisible Goods under Constraints. - Yasushi Kawase; Hanna Sumita; Yu Yokoi (IJCAI, 2023)

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. - Gergely Kál Csáji; Tamás Király; Yu Yokoi (SOSA, 2023)

Hardness of braided quantum circuit optimization in the surface code. - Kunihiro Wasa; Shin Nishio; Koki Suetsugu; Michael Hanks; Ashley Stephens; Yu Yokoi; Kae Nemoto (CoRR, 2023)

Hypergraph characterization of split matroids. - Kristóf Bérczi; Tamás Király; Tamás Schwarcz; Yutaro Yamaguchi 001; Yu Yokoi (J. Comb. Theory A, 2023)

Matroid Intersection under Restricted Oracles. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (SIAM J. Discret. Math., 2023)

Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. - Satoru Iwata 001; Yu Yokoi (SIAM J. Comput., 2023)

Arborescences, Colorful Forests, and Popularity. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (SODA, 2024)

Matroid Intersection under Minimum Rank Oracle. - Mihály Bárász; Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Popular Maximum-Utility Matchings with Matroid Constraints. - Gergely Csáji; Tamás Király; Kenjiro Takazawa; Yu Yokoi (CoRR, 2024)

Rainbow Arborescence Conjecture. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

A fair and truthful mechanism with limited subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (Games Econ. Behav., 2024)

Solving the Maximum Popular Matching Problem with Matroid Constraints. - Gergely Kál Csáji; Tamás Király; Yu Yokoi (SIAM J. Discret. Math., 2024)

Fast primal-dual update against local weight update in linear assignment problem and its application. - Kohei Morita; Shinya Shiroshita; Yutaro Yamaguchi 001; Yu Yokoi (Inf. Process. Lett., 2024)

Finding spanning trees with perfect matchings. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001; Yutaro Yamaguchi 001; Yu Yokoi (Discret. Appl. Math., 2025)

Popular Arborescences and Their Matroid Generalization. - Telikepalli Kavitha; Kazuhisa Makino; Ildikó Schlotter; Yu Yokoi (ACM Trans. Algorithms, 2025)