| Randomized algorithms for online knapsack problems X Han, Y Kawase, K Makino Theoretical Computer Science 562, 395-405, 2015 | 49 | 2015 |
| Z-score-based modularity for community detection in networks A Miyauchi, Y Kawase PloS one 11 (1), e0147805, 2016 | 46 | 2016 |
| The densest subgraph problem with a convex/concave size function Y Kawase, A Miyauchi Algorithmica 80, 3461-3480, 2018 | 36 | 2018 |
| Online unweighted knapsack problem with removal cost X Han, Y Kawase, K Makino Algorithmica 70 (1), 76-91, 2014 | 35 | 2014 |
| Online removable knapsack problem under convex function X Han, Y Kawase, K Makino, H Guo Theoretical Computer Science 540, 62-69, 2014 | 26 | 2014 |
| Graph mining meets crowdsourcing: Extracting experts for answer aggregation Y Kawase, Y Kuroki, A Miyauchi arXiv preprint arXiv:1905.08088, 2019 | 23 | 2019 |
| Near-feasible stable matchings with budget constraints Y Kawase, A Iwasaki arXiv preprint arXiv:1705.07643, 2017 | 22 | 2017 |
| Nash equilibria with minimum potential in undirected broadcast games Y Kawase, K Makino Theoretical Computer Science 482, 33-47, 2013 | 22 | 2013 |
| A fair and truthful mechanism with limited subsidy H Goko, A Igarashi, Y Kawase, K Makino, H Sumita, A Tamura, Y Yokoi, ... Games and Economic Behavior 144, 49-70, 2024 | 17 | 2024 |
| What is a network community? A novel quality function and detection algorithms A Miyauchi, Y Kawase Proceedings of the 24th ACM international on conference on information and …, 2015 | 17 | 2015 |
| Approximately stable matchings with budget constraints Y Kawase, A Iwasaki Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 16 | 2018 |
| Online knapsack problems with a resource buffer X Han, Y Kawase, K Makino, H Yokomaku arXiv preprint arXiv:1909.10016, 2019 | 14 | 2019 |
| Online Optimization of Video-Ad Allocation. H Sumita, Y Kawase, S Fujita, T Fukunaga, RA Center IJCAI, 423-429, 2017 | 13 | 2017 |
| Additive approximation algorithms for modularity maximization Y Kawase, T Matsui, A Miyauchi Journal of Computer and System Sciences 117, 182-201, 2021 | 12 | 2021 |
| Online max-min fair allocation Y Kawase, H Sumita International Symposium on Algorithmic Game Theory, 526-543, 2022 | 11 | 2022 |
| Randomized algorithms for removable online knapsack problems X Han, Y Kawase, K Makino Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2013 | 11 | 2013 |
| Fair division with two-sided preferences A Igarashi, Y Kawase, W Suksompong, H Sumita Games and Economic Behavior, 2024 | 10 | 2024 |
| On the max-min fair stochastic allocation of indivisible goods Y Kawase, H Sumita Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2070-2078, 2020 | 10 | 2020 |
| Randomized strategies for robust combinatorial optimization Y Kawase, H Sumita Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7876-7883, 2019 | 10 | 2019 |
| On packing arborescences in temporal networks N Kamiyama, Y Kawase Information Processing Letters 115 (2), 321-325, 2015 | 10 | 2015 |
Hanna SumitaTokyo Institute of Technology在 c.titech.ac.jp 的电子邮件经过验证
