Fault-Tolerant Routing Algorithms for Hypercube Networks. - Keiichi Kaneko; Hideo Ito (IPPS/SPDP, 1999)

Generalized Hierarchical Completely-Connected Networks. - Toshinori Takabatake; Keiichi Kaneko; Hideo Ito (ISPAN, 1999)

LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. - Mikio Yagi; Keiichi Kaneko; Hideo Ito (PRDC, 1999)

Node-to-Set Disjoint Paths Problem in Rotator Graphs. - Keiichi Kaneko; Yasuto Suzuki (ASIAN, 2000)

Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. - Keiichi Kaneko (SNPD, 2003)

Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. - Keiichi Kaneko (ISPA, 2004)

Container Problem in Substring Reversal Graphs. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (ISPAN, 2004)

Container Problem in Bi-rotator Graphs. - Keiichi Kaneko; Yasuto Suzuki; Yukihiro Hasegawa (PDCAT, 2004)

Node-disjoint Paths in a Transposition Graph. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (PDPTA, 2004)

Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. - Keiichi Kaneko; Yasuto Suzuki (PRDC, 2004)

Hamiltonian Cycles and Paths in Burnt Pancake Graphs. - Yasuto Suzuki; Naoki Sawada; Keiichi Kaneko (PDCS, 2005)

Container Problem in Burnt Pancake Graphs. - Naoki Sawada; Yasuto Suzuki; Keiichi Kaneko (ISPA, 2005)

Computing the Diameters of 14- and 15-Pancake Graphs. - Yuusuke Kounoike; Keiichi Kaneko; Yuji Shinano (ISPAN, 2005)

Internally-Disjoint Paths Problem in Bi-Rotator Graphs. - Keiichi Kaneko (IEICE Trans. Inf. Syst., 2005)

Design and Implementation of a Dependable Interpreter for Functional Programs. - Yosuke Takigiku; Yasuaki Oota; Keiichi Kaneko (CATA, 2006)

Computing the Diameter of 17-Pancake Graph Using a PC Cluster. - Shogo Asai; Yuusuke Kounoike; Yuji Shinano; Keiichi Kaneko (Euro-Par, 2006)

Disjoint Paths Routing in Pancake Graphs. - Keiichi Kaneko; Shietung Peng (PDCAT, 2006)

Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. - Keiichi Kaneko (PDPTA, 2006)

Routing Problems in Incomplete Rotator Graphs. - Keiichi Kaneko (PDPTA, 2006)

Routing Problems in Incomplete Pancake Graphs. - Keiichi Kaneko (SNPD, 2006)

Application of a Visual Computer Simulator into Collaborative Learning. - Yoshiro Imai; Keiichi Kaneko; Masaki Nakagawa (J. Comput. Inf. Technol., 2006)

An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs. - Keiichi Kaneko (IEICE Trans. Inf. Syst., 2006)

Node-Disjoint Paths Algorithm in a Transposition Graph. - Yasuto Suzuki; Keiichi Kaneko; Mario Nakamori (IEICE Trans. Inf. Syst., 2006)

An algorithm for disjoint paths in bubble-sort graphs. - Yasuto Suzuki; Keiichi Kaneko (Syst. Comput. Jpn., 2006)

A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. - Tatsuro Watanabe; Keiichi Kaneko; Shietung Peng (PDCS, 2007)

Long-term Memory of Foreign-word Learning by Short Movies for iPods. - Satoko Amemiya; Kazunori Hasegawa; Keiichi Kaneko; Haruko Miyakoda; Wataru Tsukahara (ICALT, 2007)

A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education. - Yoshiro Imai; Keiichi Kaneko; Masaki Nakagawa (ICALT, 2007)

Pairwise Disjoint Paths in Pancake Graphs. - Naoki Sawada; Keiichi Kaneko; Shietung Peng (PDCAT, 2007)

An (n, k)-Pancake Graph and its Properties. - Naoki Sawada; Keiichi Kaneko (PDPTA, 2007)

Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs. - Keiichi Kaneko (IEICE Trans. Inf. Syst., 2007)

An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. - Keiichi Kaneko; Naoki Sawada (IEICE Trans. Inf. Syst., 2007)

Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning. - Xin Jin; Masatoshi Ishikawa; Keiichi Kaneko; Haruko Miyakoda; Norihide Shinagawa (ICALT, 2008)

Node-to-Set Disjoint Paths Routing in Dual-Cube. - Keiichi Kaneko; Shietung Peng (ISPAN, 2008)

Autonomous and collaborative learning environment for vocabulary acquirement. - Keiichi Kaneko; Kazunori Hasegawa; Xin Jin; Masatoshi Ishikawa; Norihide Shinagawa; Haruko Miyakoda (ITI, 2008)

Set-to-Set Disjoint Paths Routing in Dual-Cubes. - Keiichi Kaneko; Shietung Peng (PDCAT, 2008)

A New Configuration of an Incomplete Star Graph and its Routing Algorithm. - Tatsuya Iwasaki; Keiichi Kaneko (PDPTA, 2008)

Design of a web-based visual simulator and its evaluation based on real computer education. - Yoshiro Imai; Keiichi Kaneko; Masaki Nakagawa (SimuTools, 2008)

New Approaches for Software Watermarking by Register Allocation. - Hakun Lee; Keiichi Kaneko (SNPD, 2008)

The Container Problem in Bubble-Sort Graphs. - Yasuto Suzuki; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2008)

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ISPAN, 2009)

Automatic creation of materials for vocabulary learning based on pictures by mobile phones of learners. - Masatoshi Ishikawa; Keiichi Kaneko; Haruko Miyakoda; Norihide Shinagawa (ITI, 2009)

Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation. - Hakun Lee; Keiichi Kaneko (ITNG, 2009)

Node-to-Set Disjoint-path Routing in Metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (PDCAT, 2009)

A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. - Tatsuya Iwasaki; Keiichi Kaneko (PDPTA, 2009)

Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICA3PP (1), 2010)

Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. - Nagateru Iwasawa; Tatsuro Watanabe; Tatsuya Iwasaki; Keiichi Kaneko (ICA3PP (2), 2010)

Set-to-Set Disjoint-Path Routing in Metacube. - Shietung Peng; Keiichi Kaneko (PDCAT, 2010)

A Feedback Vertex Set on Pancake Graphs. - Sinyu Jung; Keiichi Kaneko (PDPTA, 2010)

Effective Materials for Abstract Words in Foreign Vocabulary Learning. - Takahiro Kayama; Keiichi Kaneko; Haruko Miyakoda; Masatoshi Ishikawa (WMUTE, 2010)

Fault-tolerant routing in burnt pancake graphs. - Tatsuya Iwasaki; Keiichi Kaneko (Inf. Process. Lett., 2010)

Set-to-set disjoint-path routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko (C3S2E, 2011)

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. - Nagateru Iwasawa; Antoine Bossard; Keiichi Kaneko (CATA, 2011)

A routing algorithm of pairwise disjoint paths in a burnt pancake graph. - Tatsuya Iwasaki; Keiichi Kaneko (SoICT, 2011)

A Multilingual Chat System with Image Presentation for Detecting Mistranslation. - Eri Hosogai; Tsubasa Mukai; Sinyu Jung; Yasufumi Kowase; Antoine Bossard; Yong Xu; Masatoshi Ishikawa; Keiichi Kaneko (J. Comput. Inf. Technol., 2011)

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Comput. J., 2011)

Effective learning material for mobile devices: Visual data vs. Aural data vs. Text data. - Haruko Miyakoda; Keiichi Kaneko; Masatoshi Ishikawa (J. Lang. Technol. Comput. Linguistics, 2011)

Node-to-set disjoint-path routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (ICCS, 2011)

A learning system for matrix operations by interactive drilling. - Chisato Tada; Naoya Wada; Keiichi Kaneko (ITI, 2012)

The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2012)

Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2012)

Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. - Antoine Bossard; Keiichi Kaneko (ICA3PP (2), 2013)

A support system for probability learning based on scaffolding approach. - Yuki Ishikawa; Yuki Hirai; Keiichi Kaneko (ITI, 2013)

On Hypercube Routing and Fault Tolerance with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (CANDAR, 2014)

The Container Problem in a Torus-connected Cycles Network. - Antoine Bossard; Keiichi Kaneko (ICCS, 2014)

Fault-Tolerant Routing in (n, k) - Star Graphs. - Takara Ito; Manabu Myojin; Yuki Hirai; Keiichi Kaneko (PDCAT, 2014)

Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs. - Yo Nishiyama; Yuki Hirai; Keiichi Kaneko (PDCAT, 2014)

Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. - Antoine Bossard; Keiichi Kaneko (Comput. J., 2014)

Fault-tolerant routing based on approximate directed routable probabilities for hypercubes. - Thuy Dinh Duong; Keiichi Kaneko (Future Gener. Comput. Syst., 2014)

Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. - Antoine Bossard; Keiichi Kaneko (J. Inf. Sci. Eng., 2014)

k-pairwise disjoint paths routing in perfect hierarchical hypercubes. - Antoine Bossard; Keiichi Kaneko (J. Supercomput., 2014)

A learning system of Quadratic Functions based on scaffolding support. - Tatsuya Ishida; Yuki Hirai; Keiichi Kaneko (ITHET, 2015)

On Solving the Container Problem in a Hypercube with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (SNPD (revised selected papers), 2015)

Ambient Conversation Support in Small Face-to-Face Group Meetings. - Yuki Hirai; Keiichi Kaneko (SoICT, 2015)

Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. - Antoine Bossard; Keiichi Kaneko (Int. J. Appl. Math. Comput. Sci., 2015)

Node-to-set disjoint paths routing in a metacube. - Antoine Bossard; Keiichi Kaneko; Shietung Peng (Int. J. High Perform. Comput. Netw., 2015)

Hypercube Fault Tolerant Routing with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (Int. J. Netw. Comput., 2015)

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. - Antoine Bossard; Keiichi Kaneko (Int. J. Networked Distributed Comput., 2015)

Set-to-Set Disjoint Paths in Tori. - Keiichi Kaneko; Antoine Bossard (CANDAR, 2016)

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 (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld, 2016)

Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. - Antoine Bossard; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2016)

Node-to-Set Disjoint Paths Problem in a Möbius Cube. - David Kocik; Yuki Hirai; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2016)

Real-time Analysis of Digital Textbooks: What Keywords Make Lecture Difficult? - Kousuke Mouri; Atsushi Shimada 001; Chengjiu Yin; Noriko Uosaki; Vachirawit Tengchaisri; Keiichi Kaneko (ICCE, 2017)

An Algorithm to Evaluate Appropriateness of Still Images for Learning Concrete Nouns of a New Foreign Language. - Mohammad Nehal Hasnine; Masatoshi Ishikawa; Yuki Hirai; Haruko Miyakoda; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2017)

Node-to-Node Disjoint Paths Problem in Möbius Cubes. - David Kocik; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2017)

A Support System for Solving Problems of Two-Triangle Congruence Using 'Backward Chaining'. - Ryosuke Onda; Yuki Hirai; Kay Penny; Bipin Indurkhya; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2017)

Stochastic Fault-Tolerant Routing in Dual-Cubes. - Junsuk Park; Nobuhiro Seki; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2017)

A Set-to-Set Disjoint Paths Routing Algorithm in Tori. - Keiichi Kaneko; Antoine Bossard (Int. J. Netw. Comput., 2017)

Proposal of an Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (DB&IS, 2018)

Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (DB&IS (Selected Papers), 2018)

Node-to-node Disjoint Paths in Twisted Crossed Cubes. - Hiroki Nagashima; Kousuke Mouri; Keiichi Kaneko (IAIT, 2018)

Fault-tolerant Routing Methods in Crossed Cubes. - Koji Otake; Kousuke Mouri; Keiichi Kaneko (IAIT, 2018)

A Pairing Method Based on Characteristics of Learners' Artifacts in Conceptual Modeling Exercises. - Daiuske Ike; Takafumi Tanaka; Kousuke Mouri; Keiichi Kaneko (IIAI-AAI, 2018)

Design and Development of a Subtitle Summarization System for Vocabulary Learning. - Hiroharu Kawashima; Takafumi Tanaka; Kousuke Mouri; Keiichi Kaneko (IIAI-AAI, 2018)

Redesign of a Data Collection in Digital Textbook Systems. - Kousuke Mouri; Noriko Uosaki; Atsushi Shimada 001; Chengjiu Yin; Keiichi Kaneko; Hiroaki Ogata (IIAI-AAI, 2018)

On the Torus Pairwise Disjoint-Path Routing Problem. - Antoine Bossard; Keiichi Kaneko (iThings/GreenCom/CPSCom/SmartData, 2018)

Stochastic Link-Fault-Tolerant Routing In A Torus. - Seiya Kuramochi; Yu-on Chatchakan; Kousuke Mouri; Keiichi Kaneko (JCSSE, 2018)

Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises. - Takafumi Tanaka; Hiroaki Hashiura; Atsuo Hazeyama; Seiichi Komiya; Yuki Hirai; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2018)

Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph. - Yo Nishiyama; Yuko Sasaki; Yuki Hirai; Hironori Nakajo; Keiichi Kaneko (J. Inf. Sci. Eng., 2018)

Torus Pairwise Disjoint-Path Routing. - Antoine Bossard; Keiichi Kaneko (Sensors, 2018)

A stochastic link-fault-tolerant routing algorithm in folded hypercubes. - Bui Thi Thuan; Lam Boi Ngoc; Keiichi Kaneko (J. Supercomput., 2018)

Refining the Unrestricted Character Encoding for Japanese. - Antoine Bossard; Keiichi Kaneko (CATA, 2019)

Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts. - Fumiya Suzuki; Kousuke Mouri; Noriko Uosaki; Atsushi Shimada 001; Chengjiu Yin; Keiichi Kaneko (HCI (22), 2019)

Supporting ubiquitous language learning with object and text detection technologies. - Kousuke Mouri; Noriko Uosaki; Chengjiu Yin; Atsushi Shimada 001; Mohammad Nehal Hasnine; Keiichi Kaneko; Hiroaki Ogata (ICCE, 2019)

Design of a Location-based Word Recommendation System Based on Association Rule Mining Analysis. - Mohammad Nehal Hasnine; Gökhan Akçapinar; Brendan Flanagan; Kousuke Mouri; Hiroaki Ogata; Keiichi Kaneko; Noriko Uosaki (IIAI-AAI, 2019)

Development of an Answer Verification System for Helping Visually Impaired People to Learn a Spreadsheet Software. - Isao Hiramatsu; Kousuke Mouri; Bipin Indurkhya; Keiichi Kaneko (IIAI-AAI, 2019)

A System for Grouping Texts and Objects in Slide Layout. - Fumiya Suzuki; Kousuke Mouri; Atsushi Shimada 001; Noriko Uosaki; Chengjiu Yin; Keiichi Kaneko (IIAI-AAI, 2019)

UCEJ Database Refinement and Applicability Proof. - Antoine Bossard; Keiichi Kaneko (ISM, 2019)

A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. - Antoine Bossard; Keiichi Kaneko (SIGITE, 2019)

Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks. - Mohammad Nehal Hasnine; Masatoshi Ishikawa; Kousuke Mouri; Keiichi Kaneko (HCI (23), 2020)

Pairwise Disjoint Paths Routing in Tori. - Keiichi Kaneko; Son Van Nguyen; Huynh Thi Thanh Binh (IEEE Access, 2020)

Node-Disjoint Paths Problems in Directed Bijective Connection Graphs. - Keiichi Kaneko (IEICE Trans. Inf. Syst., 2020)

Closing the Experiential Learning Loops Using Learning Analytics Cycle: Towards Authentic Experience Sharing for Vocabulary Learning. - Mohammad Nehal Hasnine; Hiroaki Ogata; Gökhan Akçapinar; Kousuke Mouri; Keiichi Kaneko (Int. J. Distance Educ. Technol., 2020)

Cluster-Fault Tolerant Routing in a Torus. - Antoine Bossard; Keiichi Kaneko (Sensors, 2020)

Educational data mining for discovering hidden browsing patterns using non-negative matrix factorization. - Kousuke Mouri; Fumiya Suzuki; Atsushi Shimada 001; Noriko Uosaki; Chengjiu Yin; Keiichi Kaneko; Hiroaki Ogata (Interact. Learn. Environ., 2021)

An automatic quiz generation system utilizing digital textbook logs. - Kousuke Mouri; Noriko Uosaki; Mohammad Nehal Hasnine; Atsushi Shimada 001; Chengjiu Yin; Keiichi Kaneko; Hiroaki Ogata (Interact. Learn. Environ., 2021)

An Implementation of Coding Rule Checking Function for C Programming Study. - Htoo Htoo Sandi Kyaw; Keiichi Kaneko; Nobuo Funabiki; Kiyoshi Ueda (LifeTech, 2022)

Set-to-Set Disjoint Paths Problem in Möbius Cubes. - Hiroyuki Ichida; Keiichi Kaneko (IEEE Access, 2022)

Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. - Keiichi Kaneko; Antoine Bossard; Frederick C. Harris Jr. (IEEE Access, 2022)

Minimal Paths in a Bicube. - Masaaki Okada; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2022)

On the Crossing Number of a Torus Network. - Antoine Bossard; Keiichi Kaneko; Frederick C. Harris Jr. (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Feedback Node Sets in Pancake Graphs and Burnt Pancake Graphs. - Sinyu Jung; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2023)

Analysis of Code Writing Problem Solution Results in C Programming Course. - Htoo Htoo Sandi Kyaw; Keiichi Kaneko; Nobuo Funabiki (ICCE, 2024)

Node-to-Node and Node-to-Set Disjoint Paths Problems in Bicubes. - Arata Kaneko; Htoo Htoo Sandi Kyaw; Kunihiro Fujiyoshi; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2024)

Set-to-set disjoint paths in a folded hypercube. - Hiroyuki Ichida; Keiichi Kaneko (Theor. Comput. Sci., 2024)

Node-to-Set Disjoint Paths Problem in Cross-Cubes. - Rikuya Sasaki; Hiroyuki Ichida; Htoo Htoo Sandi Kyaw; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2024)

Implementation of Gamified Programming Learning Assistant System. - Htoo Htoo Sandi Kyaw; Keiichi Kaneko; Nobuo Funabiki; Wen-Chung Kao (ICCE, 2025)

Fault-Tolerant Routing in Bicubes. - Yitong Wang; Htoo Htoo Sandi Kyaw; Kunihiro Fujiyoshi; Keiichi Kaneko (IEICE Trans. Inf. Syst., 2025)