Yu Yokoi

Orcid: 0000-0002-7316-5434

According to our database1, Yu Yokoi authored at least 30 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast primal-dual update against local weight update in linear assignment problem and its application.
Inf. Process. Lett., January, 2024

Arborescences, Colorful Forests, and Popularity.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals.
SIAM J. Comput., October, 2023

Matroid Intersection under Restricted Oracles.
SIAM J. Discret. Math., June, 2023

Hypergraph characterization of split matroids.
J. Comb. Theory, Ser. A, 2023

Hardness of braided quantum circuit optimization in the surface code.
CoRR, 2023

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Random Assignment of Indivisible Goods under Constraints.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Approximation by lexicographically maximal solutions in matching and matroid intersection problems.
Theor. Comput. Sci., 2022

Equitable partitions into matchings and coverings in mixed graphs.
Discret. Math., 2022

Solving the Maximum Popular Matching Problem with Matroid Constraints.
CoRR, 2022

Maintaining Optimality in Assignment Problem against Weight Updates around Vertices.
CoRR, 2022

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists.
CoRR, 2022

Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Fair and Truthful Mechanism with Limited Subsidy.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Subgame Perfect Equilibria of Sequential Matching Games.
ACM Trans. Economics and Comput., 2020

Finding a Stable Allocation in Polymatroid Intersection.
Math. Oper. Res., 2020

Envy-Free Matchings with Lower Quotas.
Algorithmica, 2020

A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Matroidal Choice Functions.
SIAM J. Discret. Math., 2019

A generalized-polymatroid approach to disjoint common independent sets in two matroids.
Discret. Math., 2019

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids.
CoRR, 2019

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow.
CoRR, 2019

List Supermodular Coloring with Shorter Lists.
Comb., 2019

2018
List Supermodular Coloring.
Comb., 2018

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas.
Math. Oper. Res., 2017

2015
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market.
Math. Oper. Res., 2015


  Loading...