| 2020 | HCI | Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks. | Mohammad Nehal Hasnine, Masatoshi Ishikawa, Kousuke Mouri, Keiichi Kaneko |
| 2019 | CATA | Refining the Unrestricted Character Encoding for Japanese. | Antoine Bossard, Keiichi Kaneko |
| 2019 | HCI | Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts. | Fumiya Suzuki, Kousuke Mouri, Noriko Uosaki, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko |
| 2019 | ICCE | Supporting ubiquitous language learning with object and text detection technologies. | Kousuke Mouri, Noriko Uosaki, Chengjiu Yin, Atsushi Shimada, Mohammad Nehal Hasnine, Keiichi Kaneko, Hiroaki Ogata |
| 2019 | ISM | UCEJ Database Refinement and Applicability Proof. | Antoine Bossard, Keiichi Kaneko |
| 2019 | SIGITE | A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. | Antoine Bossard, Keiichi Kaneko |
| 2017 | ICCE | Real-time Analysis of Digital Textbooks: What Keywords Make Lecture Difficult? | Kousuke Mouri, Atsushi Shimada, Chengjiu Yin, Noriko Uosaki, Vachirawit Tengchaisri, Keiichi Kaneko |
| 2016 | UIC | A Method for Collecting Learners' Thinking Process in ER Modeling Exercises and Its Application Experiment. | Takafumi Tanaka, Hiroaki Hashiura, Atsuo Hazeyama, Seiichi Komiya, Yuki Hirai, Keiichi Kaneko |
| 2015 | SNPD | On Solving the Container Problem in a Hypercube with Bit Constraint. | Antoine Bossard, Keiichi Kaneko |
| 2014 | ICCS | The Container Problem in a Torus-connected Cycles Network. | Antoine Bossard, Keiichi Kaneko |
| 2014 | PDCAT | Fault-Tolerant Routing in (n, k) - Star Graphs. | Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko |
| 2014 | PDCAT | Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs. | Yo Nishiyama, Yuki Hirai, Keiichi Kaneko |
| 2013 | ICA3PP | Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. | Antoine Bossard, Keiichi Kaneko |
| 2011 | CATA | Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. | Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko |
| 2011 | ICA3PP | Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes. | Thuy Dinh Duong, Keiichi Kaneko |
| 2010 | ICA3PP | Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. | Antoine Bossard, Keiichi Kaneko, Shietung Peng |
| 2010 | ICA3PP | Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. | Nagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko |
| 2010 | PDCAT | Set-to-Set Disjoint-Path Routing in Metacube. | Shietung Peng, Keiichi Kaneko |
| 2010 | PDPTA | A Feedback Vertex Set on Pancake Graphs. | Sinyu Jung, Keiichi Kaneko |
| 2009 | PDCAT | Node-to-Set Disjoint-path Routing in Metacube. | Antoine Bossard, Keiichi Kaneko, Shietung Peng |
| 2009 | PDPTA | A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. | Tatsuya Iwasaki, Keiichi Kaneko |
| 2008 | ICALT | Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning. | Xin Jin, Masatoshi Ishikawa, Keiichi Kaneko, Haruko Miyakoda, Norihide Shinagawa |
| 2008 | PDCAT | Set-to-Set Disjoint Paths Routing in Dual-Cubes. | Keiichi Kaneko, Shietung Peng |
| 2008 | PDPTA | A New Configuration of an Incomplete Star Graph and its Routing Algorithm. | Tatsuya Iwasaki, Keiichi Kaneko |
| 2008 | SNPD | New Approaches for Software Watermarking by Register Allocation. | Hakun Lee, Keiichi Kaneko |
| 2007 | ICALT | Long-term Memory of Foreign-word Learning by Short Movies for iPods. | Satoko Amemiya, Kazunori Hasegawa, Keiichi Kaneko, Haruko Miyakoda, Wataru Tsukahara |
| 2007 | ICALT | A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education. | Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa |
| 2007 | PDCAT | Pairwise Disjoint Paths in Pancake Graphs. | Naoki Sawada, Keiichi Kaneko, Shietung Peng |
| 2007 | PDPTA | An (n, k)-Pancake Graph and its Properties. | Naoki Sawada, Keiichi Kaneko |
| 2006 | CATA | Design and Implementation of a Dependable Interpreter for Functional Programs. | Yosuke Takigiku, Yasuaki Oota, Keiichi Kaneko |
| 2006 | EuroPar | Computing the Diameter of 17-Pancake Graph Using a PC Cluster. | Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko |
| 2006 | PDCAT | Disjoint Paths Routing in Pancake Graphs. | Keiichi Kaneko, Shietung Peng |
| 2006 | PDPTA | Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. | Keiichi Kaneko |
| 2006 | PDPTA | Routing Problems in Incomplete Rotator Graphs. | Keiichi Kaneko |
| 2006 | SNPD | Routing Problems in Incomplete Pancake Graphs. | Keiichi Kaneko |
| 2005 | ISPA | Container Problem in Burnt Pancake Graphs. | Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko |
| 2004 | ISPA | Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. | Keiichi Kaneko |
| 2004 | PDCAT | Container Problem in Bi-rotator Graphs. | Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa |
| 2004 | PDPTA | Node-disjoint Paths in a Transposition Graph. | Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori |
| 2004 | PRDC | Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. | Keiichi Kaneko, Yasuto Suzuki |
| 2003 | SNPD | Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. | Keiichi Kaneko |
| 1999 | PRDC | LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. | Mikio Yagi, Keiichi Kaneko, Hideo Ito |