A Monolithic Approach and a Type-by-Type Approach for Non-Factoid Question-answering - Yokohama National University at NTCIR-6 QAC. - Tatsunori Mori; Mitsuru Sato; Madoka Ishioroshi; Yugo Nishikawa; Shigenori Nakano; Kei Kimura (NTCIR, 2007)

Maximum lifetime coverage problems with battery recovery effects. - Norie Fu; Vorapong Suppakitpaisarn; Kei Kimura; Naonori Kakimura (GLOBECOM, 2014)

Trichotomy for integer linear systems based on their sign patterns. - Kei Kimura; Kazuhisa Makino (Discret. Appl. Math., 2016)

The Fewest Clues Problem of Picross 3D. - Kei Kimura; Takuya Kamehashi; Toshihiro Fujito (FUN, 2018)

Linear Satisfiability Preserving Assignments (Extended Abstract). - Kei Kimura; Kazuhisa Makino (IJCAI, 2018)

Linear Satisfiability Preserving Assignments. - Kei Kimura; Kazuhisa Makino (J. Artif. Intell. Res., 2018)

Maximum lifetime coverage problem with battery recovery effect. - Norie Fu; Naonori Kakimura; Kei Kimura; Vorapong Suppakitpaisarn (Sustain. Comput. Informatics Syst., 2018)

A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition. - Takuya Tamori; Kei Kimura (WALCOM, 2019)

NP-Completeness of Fill-a-Pix and ΣP2-Completeness of Its Fewest Clues Problem. - Yuta Higuchi; Kei Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Approximating Partially Bounded Degree Deletion on Directed Graphs. - Toshihiro Fujito; Kei Kimura; Yuki Mizuno (J. Graph Algorithms Appl., 2019)

Stronger Hardness Results on the Computational Complexity of Picross 3D. - Kei Kimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

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

Quantaloidal approach to constraint satisfaction. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura (ACT, 2021)

Trichotomy for the reconfiguration problem of integer linear systems. - Kei Kimura; Akira Suzuki 001 (Theor. Comput. Sci., 2021)

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura; Akira Suzuki 001 (ISAAC, 2022)

Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization. - Kei Kimura; Kotaro Nakayama (ISCO, 2022)

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. - Kei Kimura; Kazuhisa Makino (ISAAC, 2023)

Fairness and Efficiency Trade-off in Two-sided Matching. - Sung-Ho Cho; Kei Kimura; Kiki Liu; Kwei-guu Liu; Zhengjie Liu; Zhaohong Sun 001; Kentaro Yahiro; Makoto Yokoo (AAMAS, 2024)

Analyzing Incentives and Fairness in Ordered Weighted Average for Facility Location Games. - Kento Yoshida; Kei Kimura; Taiki Todo; Makoto Yokoo (ECAI, 2024)

Online $ textrm{L}^{ atural }$-Convex Minimization. - Ken Yokoyama; Shinji Ito; Tatsuya Matsuoka; Kei Kimura; Makoto Yokoo (ECML/PKDD (5), 2024)

Characterizing the integer points in 2-decomposable polyhedra by closedness under operations. - Kei Kimura; Kazuhisa Makino; Shota Yamada 001; Ryo Yoshizumi (CoRR, 2024)

Online L♮-Convex Minimization. - Ken Yokoyama; Shinji Ito; Tatsuya Matsuoka; Kei Kimura; Makoto Yokoo (CoRR, 2024)

Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks. - Sukanya Samanta; Kei Kimura; Makoto Yokoo (CoRR, 2024)

Tighter Adaptive IBEs and VRFs: Revisiting Waters' Artificial Abort. - Goichiro Hanaoka; Shuichi Katsumata; Kei Kimura; Kaoru Takemure; Shota Yamada 001 (IACR Cryptol. ePrint Arch., 2024)

Incentive Design in Hedonic Games with Permission Structures. - Yuta Akahoshi; Yao Zhang; Kei Kimura; Taiki Todo; Makoto Yokoo (ICAART (1), 2025)

Weighted Envy-free Allocation with Subsidy. - Haris Aziz 001; Xin Huang; Kei Kimura; Indrajit Saha; Zhaohong Sun 001; Mashbat Suzuki; Makoto Yokoo (AAMAS, 2025)

Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs. - Ryoto Ando; Kei Kimura; Taiki Todo; Makoto Yokoo (WALCOM, 2025)

Parameterized complexity of weighted target set selection. - Takahiro Suzuki; Kei Kimura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)

Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy. - Noga Klein Elmalem; Haris Aziz 001; Rica Gonen; Xin Huang; Kei Kimura; Indrajit Saha; Erel Segal-Halevi; Zhaohong Sun 001; Mashbat Suzuki; Makoto Yokoo (CoRR, 2025)

A New Relaxation of Fairness in Two-Sided Matching Respecting Acquaintance Relationships. - Ryota Takeshima; Kei Kimura; Ayumu Kuroki; Temma Wakasugi; Makoto Yokoo (CoRR, 2025)

Multi-stage generalized deferred acceptance mechanism: Strategyproof mechanism for handling general hereditary constraints. - Kei Kimura; Kweiguu Liu; Zhaohong Sun 001; Kentaro Yahiro; Makoto Yokoo (Auton. Agents Multi Agent Syst., 2025)