New DRAM noise generation under half-Vcc precharge and its reduction using a transposed amplifier. - Masakazu Aoki; Shin'ichi Ikenaga; Yoshinobu Nakagome; Masashi Horiguchi; Yasushi Kawase; Yoshifumi Kawamoto; Kiyoo Itoh 001 (IEEE J. Solid State Circuits, 1989)

A circuit technology for sub-10-ns ECL 4-Mb BiCMOS DRAM's. - Takayuki Kawahara; Yoshiki Kawajiri; Goro Kitsukawa; Yoshinobu Nakagome; Kazuhiko Sagara; Yoshifumi Kawamoto; Takesada Akiba; Shisei Kato; Yasushi Kawase; Kiyoo Itoh 001 (IEEE J. Solid State Circuits, 1991)

Deep-submicrometer BiCMOS circuit technology for sub-10-ns ECL 4-Mb DRAM's. - Takayuki Kawahara; Yoshiki Kawajiri; Goro Kitsukawa; Kazuhiko Sagara; Yoshifumi Kawamoto; Takesada Akiba; Shisei Kato; Yasushi Kawase; Kiyoo Itoh 001 (IEEE J. Solid State Circuits, 1992)

256-Mb DRAM circuit technologies for file applications. - Goro Kitsukawa; Masashi Horiguchi; Yoshiki Kawajiri; Takayuki Kawahara; Takesada Akiba; Yasushi Kawase; Toshikazu Tachibana; Takeshi Sakai; Masakazu Aoki; Syoji Shukuri; Kazuhiko Sagara; Ryo Nagai; et al. (IEEE J. Solid State Circuits, 1993)

Online Knapsack Problem with Removal Cost. - Xin Han; Yasushi Kawase; Kazuhisa Makino (COCOON, 2012)

Nash Equilibria with Minimum Potential in Undirected Broadcast Games. - Yasushi Kawase; Kazuhisa Makino (WALCOM, 2012)

Randomized Algorithms for Removable Online Knapsack Problems. - Xin Han; Yasushi Kawase; Kazuhisa Makino (FAW-AAIM, 2013)

Unit Cost Buyback Problem. - Yasushi Kawase; Xin Han; Kazuhisa Makino (ISAAC, 2013)

Online Unweighted Knapsack Problem with Removal Cost. - Xin Han; Yasushi Kawase; Kazuhisa Makino (Algorithmica, 2014)

Online removable knapsack problem under convex function. - Xin Han; Yasushi Kawase; Kazuhisa Makino; He Guo 001 (Theor. Comput. Sci., 2014)

What Is a Network Community?: A Novel Quality Function and Detection Algorithms. - Atsushi Miyauchi 001; Yasushi Kawase (CIKM, 2015)

Proportional Cost Buyback Problem with Weight Bounds. - Yasushi Kawase; Xin Han; Kazuhisa Makino (COCOA, 2015)

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (ICALP (1), 2015)

The Secretary Problem with a Choice Function. - Yasushi Kawase (ISAAC, 2015)

Scalable sensor localization via ball-decomposition algorithm. - Yasushi Kawase; Takanori Maehara; Ken-ichi Kawarabayashi (Networking, 2015)

Z-score-based modularity for community detection in networks. - Atsushi Miyauchi 001; Yasushi Kawase (CoRR, 2015)

On packing arborescences in temporal networks. - Naoyuki Kamiyama; Yasushi Kawase (Inf. Process. Lett., 2015)

Randomized algorithms for online knapsack problems. - Xin Han; Yasushi Kawase; Kazuhisa Makino (Theor. Comput. Sci., 2015)

Surrogate Optimization for p-Norms. - Yasushi Kawase; Kazuhisa Makino (ISAAC, 2016)

The Densest Subgraph Problem with a Convex/Concave Size Function. - Yasushi Kawase; Atsushi Miyauchi 001 (ISAAC, 2016)

Additive Approximation Algorithms for Modularity Maximization. - Yasushi Kawase; Tomomi Matsui; Atsushi Miyauchi 001 (ISAAC, 2016)

Optimal Composition Ordering Problems for Piecewise Linear Functions. - Yasushi Kawase; Kazuhisa Makino; Kento Seimi (ISAAC, 2016)

Optimal Pricing for Submodular Valuations with Bounded Curvature. - Takanori Maehara; Yasushi Kawase; Hanna Sumita; Katsuya Tono; Ken-ichi Kawarabayashi (AAAI, 2017)

Optimal Stopping Rules for Sequential Hypothesis Testing. - Constantinos Daskalakis; Yasushi Kawase (ESA, 2017)

Near-Feasible Stable Matchings with Budget Constraints. - Yasushi Kawase; Atsushi Iwasaki (IJCAI, 2017)

Online Optimization of Video-Ad Allocation. - Hanna Sumita; Yasushi Kawase; Sumio Fujita; Takuro Fukunaga (IJCAI, 2017)

Optimal Matroid Partitioning Problems. - Yasushi Kawase; Kei Kimura; Kazuhisa Makino; Hanna Sumita (ISAAC, 2017)

Stochastic Input Models in Online Computing. - Yasushi Kawase (CoRR, 2017)

Approximately Stable Matchings With Budget Constraints. - Yasushi Kawase; Atsushi Iwasaki (AAAI, 2018)

Submodular Maximization with Uncertain Knapsack Capacity. - Yasushi Kawase; Hanna Sumita; Takuro Fukunaga (LATIN, 2018)

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

Tight Approximation for Unconstrained XOS Maximization. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (CoRR, 2018)

Randomized Strategies for Robust Combinatorial Optimization. - Yasushi Kawase; Hanna Sumita (AAAI, 2019)

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. - Yasushi Kawase; Yuko Kuroki; Atsushi Miyauchi 001 (IJCAI, 2019)

Online Knapsack Problems with a Resource Buffer. - Xin Han; Yasushi Kawase; Kazuhisa Makino; Haruki Yokomaku (ISAAC, 2019)

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. - Daisuke Hatano; Yuko Kuroki; Yasushi Kawase; Hanna Sumita; Naonori Kakimura; Ken-ichi Kawarabayashi (PRICAI (1), 2019)

Antimatroids induced by matchings. - Yasushi Kawase; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2019)

On the Max-Min Fair Stochastic Allocation of Indivisible Goods. - Yasushi Kawase; Hanna Sumita (AAAI, 2020)

Approximately Stable Matchings with General Constraints. - Yasushi Kawase; Atsushi Iwasaki (AAMAS, 2020)

Performance as a Constraint: An Improved Wisdom of Crowds Using Performance Regularization. - Jiyi Li; Yasushi Kawase; Yukino Baba; Hisashi Kashima (IJCAI, 2020)

A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. - Yusei Fujimori; Yasushi Kawase; Tomomi Matsui; Akiyoshi Shioura (Inf. Process. Lett., 2020)

Finding a path with two labels forbidden in group-labeled graphs. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (J. Comb. Theory B, 2020)

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

Subgame perfect equilibria under the deferred acceptance algorithm. - Yasushi Kawase; Keisuke Bando (Int. J. Game Theory, 2021)

Tight Approximation for Unconstrained XOS Maximization. - Yuval Filmus; Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (Math. Oper. Res., 2021)

Fair and Truthful Mechanism with Limited Subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (AAMAS, 2022)

Fair Ride Allocation on a Line. - Yuki Amano; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hirotaka Ono 001 (SAGT, 2022)

Online Max-min Fair Allocation. - Yasushi Kawase; Hanna Sumita (SAGT, 2022)

Online Scheduling on Identical Machines with a Metric State Space. - Hiromichi Goko; Akitoshi Kawamura; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita (STACS, 2022)

Optimal design of lottery with cumulative prospect theory. - Shunta Akiyama; Mitsuaki Obara; Yasushi Kawase (CoRR, 2022)

Fair Division with Two-Sided Preferences. - Ayumi Igarashi 001; Yasushi Kawase; Warut Suksompong; Hanna Sumita (IJCAI, 2023)

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

Reusing Cardboard for Packaging Boxes with a Computational Design System. - Kazuki Koyama; Koya Narumi; Ken Takaki; Yasushi Kawase; Ari Hautasaari; Yoshihiro Kawahara (UIST (Adjunct Volume), 2023)

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. - Yasushi Kawase; Atsushi Miyauchi 001; Hanna Sumita (WSDM, 2023)

Size-stochastic Knapsack Online Contention Resolution Schemes. - Toru Yoshinaga; Yasushi Kawase (CoRR, 2023)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. - Yasushi Kawase; Koichi Nishimura; Hanna Sumita (CoRR, 2023)

The Last Success Problem with a Single Sample. - Toru Yoshinaga; Yasushi Kawase (CoRR, 2023)

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. - Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Makoto Yokoo (AAAI, 2024)

Contiguous Allocation of Binary Valued Indivisible Items on a Path. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (AAMAS, 2024)

The Last Success Problem with Samples. - Toru Yoshinaga; Yasushi Kawase (ESA, 2024)

Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. - Yasushi Kawase; Koichi Nishimura; Hanna Sumita (ICALP, 2024)

Efficient and Strategy-proof Mechanism under General Constraints. - Kenzo Imamura; Yasushi Kawase (EC, 2024)

Contiguous Allocation of Indivisible Items on a Path. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (CoRR, 2024)

Efficient matching under general constraints. - Kenzo Imamura; Yasushi Kawase (Games Econ. Behav., 2024)

Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. - Yasushi Kawase; Hanna Sumita (Algorithmica, 2024)

Resource Allocation under the Latin Square Constraint. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (AAMAS, 2025)

Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings. - Keisuke Bando; Kenzo Imamura; Yasushi Kawase (EC, 2025)

Online Matching with Delays and Size-Based Costs. - Yasushi Kawase; Tomohiro Nakayoshi (STACS, 2025)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time. - Yasushi Kawase; Kazuhisa Makino; Vinh Long Phan; Hanna Sumita (WADS, 2025)

Online Contention Resolution Schemes for Size-Stochastic Knapsacks. - Toru Yoshinaga; Yasushi Kawase (WALCOM, 2025)

Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions. - Yasushi Kawase; Bodhayan Roy; Mohammad Azharuddin Sanpui (CoRR, 2025)

Two-Sided Fairness in Many-to-One Matching. - Ayumi Igarashi 001; Naoyuki Kamiyama; Yasushi Kawase; Warut Suksompong; Hanna Sumita; Yu Yokoi (CoRR, 2025)