default search action
Yu Yokoi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Hiromichi Goko, Ayumi Igarashi
, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144: 49-70 (2024) - [j16]Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
Fast primal-dual update against local weight update in linear assignment problem and its application. Inf. Process. Lett. 183: 106432 (2024) - [j15]Gergely Kál Csáji, Tamás Király, Yu Yokoi
Solving the Maximum Popular Matching Problem with Matroid Constraints. SIAM J. Discret. Math. 38(3): 2226-2242 (2024) - [c11]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. SODA 2024: 3724-3746 - [i21]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
Finding Spanning Trees with Perfect Matchings. CoRR abs/2407.02958 (2024) - [i20]Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Minimum Rank Oracle. CoRR abs/2407.03229 (2024) - [i19]Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024) - 2023
- [j14]Kristóf Bérczi
Hypergraph characterization of split matroids. J. Comb. Theory A 194: 105697 (2023) - [j13]Satoru Iwata
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. SIAM J. Comput. 52(5): 1230-1268 (2023) - [j12]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37(2): 1311-1330 (2023) - [c10]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. IJCAI 2023: 2792-2799 - [c9]Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA 2023: 103-113 - [i18]Kunihiro Wasa, Shin Nishio
Hardness of braided quantum circuit optimization in the surface code. CoRR abs/2302.00273 (2023) - [i17]Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter, Yu Yokoi:
Arborescences, Colorful Forests, and Popularity. CoRR abs/2310.19455 (2023) - 2022
- [j11]Tamás Király, Yu Yokoi
Equitable partitions into matchings and coverings in mixed graphs. Discret. Math. 345(1): 112651 (2022) - [j10]Kristóf Bérczi
Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910: 48-53 (2022) - [c8]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. AAMAS 2022: 534-542 - [c7]Kazuhisa Makino, Shuichi Miyazaki
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. SAGT 2022: 544-561 - [c6]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. STACS 2022: 31:1-31:20 - [i16]Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. CoRR abs/2202.04371 (2022) - [i15]Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties and Incomplete Lists. CoRR abs/2203.06660 (2022) - [i14]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. CoRR abs/2208.07666 (2022) - [i13]Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. CoRR abs/2208.09583 (2022) - [i12]Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. CoRR abs/2208.11325 (2022) - [i11]Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Solving the Maximum Popular Matching Problem with Matroid Constraints. CoRR abs/2209.02195 (2022) - [i10]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022) - 2021
- [c5]Yu Yokoi:
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. ISAAC 2021: 71:1-71:16 - [i9]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. CoRR abs/2105.01801 (2021) - [i8]Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. CoRR abs/2105.03093 (2021) - [i7]Yu Yokoi:
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. CoRR abs/2107.03076 (2021) - [i6]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR abs/2107.09897 (2021) - 2020
- [j9]Yu Yokoi
Envy-Free Matchings with Lower Quotas. Algorithmica 82(2): 188-211 (2020) - [j8]Satoru Iwata
Finding a Stable Allocation in Polymatroid Intersection. Math. Oper. Res. 45(1): 63-85 (2020) - [j7]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Subgame Perfect Equilibria of Sequential Matching Games. ACM Trans. Economics and Comput. 7(4): 21:1-21:30 (2020) - [c4]Satoru Iwata, Yu Yokoi:
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths. SODA 2020: 1933-1944
2010 – 2019
- 2019
- [j6]Yu Yokoi:
List Supermodular Coloring with Shorter Lists. Comb. 39(2): 459-475 (2019) - [j5]Kenjiro Takazawa
A generalized-polymatroid approach to disjoint common independent sets in two matroids. Discret. Math. 342(7): 2002-2011 (2019) - [j4]Yu Yokoi:
Matroidal Choice Functions. SIAM J. Discret. Math. 33(3): 1712-1724 (2019) - [i5]Satoru Iwata, Yu Yokoi:
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. CoRR abs/1909.07919 (2019) - [i4]Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi:
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. CoRR abs/1909.13261 (2019) - 2018
- [j3]Satoru Iwata, Yu Yokoi:
List Supermodular Coloring. Comb. 38(6): 1437-1456 (2018) - [c3]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC 2018: 131-148 - [i3]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR abs/1804.10353 (2018) - [i2]Tamás Király, Yu Yokoi:
Equitable Partitions into Matchings and Coverings in Mixed Graphs. CoRR abs/1811.07856 (2018) - 2017
- [j2]Yu Yokoi:
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas. Math. Oper. Res. 42(1): 238-255 (2017) - [c2]Yu Yokoi:
Envy-free Matchings with Lower Quotas. ISAAC 2017: 67:1-67:12 - [i1]Yu Yokoi:
Envy-Free Matchings with Lower Quotas. CoRR abs/1704.04888 (2017) - 2016
- [c1]Satoru Iwata, Yu Yokoi:
Finding a Stable Allocation in Polymatroid Intersection. SODA 2016: 1034-1047 - 2015
- [j1]Kazuo Murota, Yu Yokoi:
On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market. Math. Oper. Res. 40(2): 460-473 (2015)
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-08-23 18:32 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: