default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasushi Kawase
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. Algorithmica 86(2): 566-584 (2024)- [j23]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) - [j22]Kenzo Imamura, Yasushi Kawase:
Efficient matching under general constraints. Games Econ. Behav. 145: 197-207 (2024) - [j21]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair division with two-sided preferences. Games Econ. Behav. 147: 268-287 (2024) - [c40]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI 2024: 9824-9831 - [c39]Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui:
Contiguous Allocation of Binary Valued Indivisible Items on a Path. AAMAS 2024: 2327-2329 - [c38]Toru Yoshinaga, Yasushi Kawase:
The Last Success Problem with Samples. ESA 2024: 105:1-105:15 - [c37]Yasushi Kawase, Koichi Nishimura, Hanna Sumita:
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. ICALP 2024: 96:1-96:19 - [i32]Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui:
Contiguous Allocation of Indivisible Items on a Path. CoRR abs/2401.04318 (2024) - [i31]Yasushi Kawase, Tomohiro Nakayoshi:
Online Matching with Delays and Size-based Costs. CoRR abs/2408.08658 (2024) - 2023
- [c36]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. IJCAI 2023: 2756-2764 - [c35]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. IJCAI 2023: 2792-2799 - [c34]Kazuki Koyama, Koya Narumi, Ken Takaki, Yasushi Kawase, Ari Hautasaari, Yoshihiro Kawahara:
Reusing Cardboard for Packaging Boxes with a Computational Design System. UIST (Adjunct Volume) 2023: 15:1-15:3 - [c33]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM 2023: 886-894 - [i30]Toru Yoshinaga, Yasushi Kawase:
Size-stochastic Knapsack Online Contention Resolution Schemes. CoRR abs/2305.08622 (2023) - [i29]Yasushi Kawase, Koichi Nishimura, Hanna Sumita:
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. CoRR abs/2306.05986 (2023) - [i28]Toru Yoshinaga, Yasushi Kawase:
The Last Success Problem with a Single Sample. CoRR abs/2308.09356 (2023) - [i27]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR abs/2308.11230 (2023) - 2022
- [c32]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 - [c31]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - [c30]Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. SAGT 2022: 526-543 - [c29]Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita:
Online Scheduling on Identical Machines with a Metric State Space. STACS 2022: 32:1-32:21 - [i26]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. CoRR abs/2206.05879 (2022) - [i25]Yasushi Kawase, Hanna Sumita, Yu Yokoi:
Random Assignment of Indivisible Goods under Constraints. CoRR abs/2208.07666 (2022) - [i24]Shunta Akiyama, Mitsuaki Obara, Yasushi Kawase:
Optimal design of lottery with cumulative prospect theory. CoRR abs/2209.00822 (2022) - [i23]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR abs/2211.03306 (2022) - 2021
- [j20]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. Algorithmica 83(6): 1653-1676 (2021) - [j19]Yasushi Kawase, Keisuke Bando:
Subgame perfect equilibria under the deferred acceptance algorithm. Int. J. Game Theory 50(2): 503-546 (2021) - [j18]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117: 182-201 (2021) - [j17]Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46(4): 1599-1610 (2021) - [i22]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) - [i21]Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. CoRR abs/2111.07235 (2021) - 2020
- [j16]Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura:
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162: 105991 (2020) - [j15]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory B 143: 65-122 (2020) - [j14]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) - [c28]Yasushi Kawase, Hanna Sumita:
On the Max-Min Fair Stochastic Allocation of Indivisible Goods. AAAI 2020: 2070-2078 - [c27]Yasushi Kawase:
Approximately Stable Matchings with General Constraints. AAMAS 2020: 602-610 - [c26]Jiyi Li, Yasushi Kawase, Yukino Baba, Hisashi Kashima:
Performance as a Constraint: An Improved Wisdom of Crowds Using Performance Regularization. IJCAI 2020: 1534-1541 - [i20]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. CoRR abs/2007.08045 (2020)
2010 – 2019
- 2019
- [j13]Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids induced by matchings. Discret. Appl. Math. 257: 342-349 (2019) - [j12]Yasushi Kawase, Kazuhisa Makino:
Surrogate optimization for p-norms. Discret. Optim. 34 (2019) - [j11]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Unit Cost Buyback Problem. Theory Comput. Syst. 63(6): 1185-1206 (2019) - [j10]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33(3): 1121-1145 (2019) - [j9]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Proportional cost buyback problem with weight bounds. Theor. Comput. Sci. 774: 51-64 (2019) - [c25]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization. AAAI 2019: 7876-7883 - [c24]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI 2019: 1272-1279 - [c23]Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku:
Online Knapsack Problems with a Resource Buffer. ISAAC 2019: 28:1-28:14 - [c22]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) 2019: 568-582 - [i19]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR abs/1905.08088 (2019) - [i18]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR abs/1906.05998 (2019) - [i17]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings with General Constraints. CoRR abs/1907.04163 (2019) - [i16]Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku:
Online Knapsack Problems with a Resource Buffer. CoRR abs/1909.10016 (2019) - 2018
- [j8]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. Algorithmica 80(7): 2134-2159 (2018) - [j7]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica 80(12): 3461-3480 (2018) - [c21]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings With Budget Constraints. AAAI 2018: 1113-1120 - [c20]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. LATIN 2018: 653-668 - [c19]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC 2018: 131-148 - [i15]Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular maximization with uncertain knapsack capacity. CoRR abs/1803.02565 (2018) - [i14]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR abs/1804.10353 (2018) - [i13]Yasushi Kawase, Hanna Sumita:
Randomized Strategies for Robust Combinatorial Optimization. CoRR abs/1805.07809 (2018) - [i12]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR abs/1807.00109 (2018) - [i11]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. CoRR abs/1811.09045 (2018) - 2017
- [c18]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI 2017: 622-628 - [c17]Constantinos Daskalakis, Yasushi Kawase:
Optimal Stopping Rules for Sequential Hypothesis Testing. ESA 2017: 32:1-32:14 - [c16]Yasushi Kawase, Atsushi Iwasaki:
Near-Feasible Stable Matchings with Budget Constraints. IJCAI 2017: 242-248 - [c15]Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga:
Online Optimization of Video-Ad Allocation. IJCAI 2017: 423-429 - [c14]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. ISAAC 2017: 51:1-51:13 - [i10]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. CoRR abs/1703.03603 (2017) - [i9]Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids Induced by Matchings. CoRR abs/1705.05510 (2017) - [i8]Yasushi Kawase, Atsushi Iwasaki:
Near-feasible stable matchings with budget constraints. CoRR abs/1705.07643 (2017) - [i7]Yasushi Kawase:
Stochastic Input Models in Online Computing. CoRR abs/1709.07601 (2017) - [i6]Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. CoRR abs/1710.00950 (2017) - [i5]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings with Budget Constraints. CoRR abs/1711.07359 (2017) - 2016
- [c13]Yasushi Kawase, Kazuhisa Makino:
Surrogate Optimization for p-Norms. ISAAC 2016: 41:1-41:13 - [c12]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. ISAAC 2016: 42:1-42:13 - [c11]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. ISAAC 2016: 43:1-43:13 - [c10]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. ISAAC 2016: 44:1-44:12 - [i4]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. CoRR abs/1601.03316 (2016) - [i3]Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. CoRR abs/1601.05480 (2016) - [i2]Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi:
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR abs/1611.07605 (2016) - 2015
- [j6]Naoyuki Kamiyama, Yasushi Kawase:
On packing arborescences in temporal networks. Inf. Process. Lett. 115(2): 321-325 (2015) - [j5]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562: 395-405 (2015) - [c9]Atsushi Miyauchi, Yasushi Kawase:
What Is a Network Community?: A Novel Quality Function and Detection Algorithms. CIKM 2015: 1471-1480 - [c8]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Proportional Cost Buyback Problem with Weight Bounds. COCOA 2015: 794-808 - [c7]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) 2015: 797-809 - [c6]Yasushi Kawase:
The Secretary Problem with a Choice Function. ISAAC 2015: 129-139 - [c5]Yasushi Kawase, Takanori Maehara, Ken-ichi Kawarabayashi:
Scalable sensor localization via ball-decomposition algorithm. Networking 2015: 1-9 - [i1]Atsushi Miyauchi, Yasushi Kawase:
Z-score-based modularity for community detection in networks. CoRR abs/1501.01909 (2015) - 2014
- [j4]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Unweighted Knapsack Problem with Removal Cost. Algorithmica 70(1): 76-91 (2014) - [j3]Xin Han, Yasushi Kawase, Kazuhisa Makino, He Guo:
Online removable knapsack problem under convex function. Theor. Comput. Sci. 540: 62-69 (2014) - 2013
- [j2]Yasushi Kawase, Kazuhisa Makino:
Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482: 33-47 (2013) - [c4]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Randomized Algorithms for Removable Online Knapsack Problems. FAW-AAIM 2013: 60-71 - [c3]Yasushi Kawase, Xin Han, Kazuhisa Makino:
Unit Cost Buyback Problem. ISAAC 2013: 435-445 - 2012
- [c2]Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Knapsack Problem with Removal Cost. COCOON 2012: 61-73 - [c1]Yasushi Kawase, Kazuhisa Makino:
Nash Equilibria with Minimum Potential in Undirected Broadcast Games. WALCOM 2012: 217-228
1980 – 1989
- 1989
- [j1]Masakazu Aoki, Shin'ichi Ikenaga, Yoshinobu Nakagome, Masashi Horiguchi, Yasushi Kawase, Yoshifumi Kawamoto, Kiyoo Itoh:
New DRAM noise generation under half-V/sub cc/ precharge and its reduction using a transposed amplifier. IEEE J. Solid State Circuits 24(4): 889-894 (1989)
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-11-13 23:46 CET 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:
