Keiichi Kaneko

130 papers B 3C 20Misc 14Journal 49Unranked 44

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Automatic Scoring System for Digitized Handwritten Answers. IEEE Access Tomo Asakura, Hung Tuan Nguyen, Thanh-Nghia Truong, Yoichi Tsuchida, Takahiro Yamamoto, Hiroshi Miyazawa, Nam Tuan Ly, Masato Nemoto, Masamitsu Ito, Toshihiko Horie, Keiichi Kaneko, Masaki Nakagawa
2025	J	`jnl`	Fault-Tolerant Routing in Bicubes. IEICE Trans. Inf. Syst. Yitong Wang, Htoo Htoo Sandi Kyaw, Kunihiro Fujiyoshi, Keiichi Kaneko
2025	C	`conf`	Implementation of Gamified Programming Learning Assistant System. ICCE Htoo Htoo Sandi Kyaw, Keiichi Kaneko, Nobuo Funabiki, Wen-Chung Kao
2025	—	`conf`	Pairwise Disjoint Paths Routing in Bicubes. CANDARW Yitong Wang, Keiichi Kaneko
2024	C	`conf`	Analysis of Code Writing Problem Solution Results in C Programming Course. ICCE Htoo Htoo Sandi Kyaw, Keiichi Kaneko, Nobuo Funabiki
2024	J	`jnl`	Node-to-Node and Node-to-Set Disjoint Paths Problems in Bicubes. IEICE Trans. Inf. Syst. Arata Kaneko, Htoo Htoo Sandi Kyaw, Kunihiro Fujiyoshi, Keiichi Kaneko
2024	J	`jnl`	Node-to-Set Disjoint Paths Problem in Cross-Cubes. IEICE Trans. Inf. Syst. Rikuya Sasaki, Hiroyuki Ichida, Htoo Htoo Sandi Kyaw, Keiichi Kaneko
2024	J	`jnl`	Set-to-set disjoint paths in a folded hypercube. Theor. Comput. Sci. Hiroyuki Ichida, Keiichi Kaneko
2023	J	`jnl`	Feedback Node Sets in Pancake Graphs and Burnt Pancake Graphs. IEICE Trans. Inf. Syst. Sinyu Jung, Keiichi Kaneko
2023	J	`jnl`	On the Crossing Number of a Torus Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Antoine Bossard, Keiichi Kaneko, Frederick C. Harris Jr.
2022	—	`conf`	An Implementation of Coding Rule Checking Function for C Programming Study. LifeTech Htoo Htoo Sandi Kyaw, Keiichi Kaneko, Nobuo Funabiki, Kiyoshi Ueda
2022	J	`jnl`	Minimal Paths in a Bicube. IEICE Trans. Inf. Syst. Masaaki Okada, Keiichi Kaneko
2022	J	`jnl`	Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. IEEE Access Keiichi Kaneko, Antoine Bossard, Frederick C. Harris Jr.
2022	J	`jnl`	Set-to-Set Disjoint Paths Problem in Möbius Cubes. IEEE Access Hiroyuki Ichida, Keiichi Kaneko
2021	J	`jnl`	An automatic quiz generation system utilizing digital textbook logs. Interact. Learn. Environ. Kousuke Mouri, Noriko Uosaki, Mohammad Nehal Hasnine, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata
2021	J	`jnl`	Educational data mining for discovering hidden browsing patterns using non-negative matrix factorization. Interact. Learn. Environ. Kousuke Mouri, Fumiya Suzuki, Atsushi Shimada, Noriko Uosaki, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata
2020	J	`jnl`	Closing the Experiential Learning Loops Using Learning Analytics Cycle: Towards Authentic Experience Sharing for Vocabulary Learning. Int. J. Distance Educ. Technol. Mohammad Nehal Hasnine, Hiroaki Ogata, Gökhan Akçapinar, Kousuke Mouri, Keiichi Kaneko
2020	J	`jnl`	Cluster-Fault Tolerant Routing in a Torus. Sensors Antoine Bossard, Keiichi Kaneko
2020	—	`conf`	Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks. HCI (23) Mohammad Nehal Hasnine, Masatoshi Ishikawa, Kousuke Mouri, Keiichi Kaneko
2020	J	`jnl`	Node-Disjoint Paths Problems in Directed Bijective Connection Graphs. IEICE Trans. Inf. Syst. Keiichi Kaneko
2020	J	`jnl`	Pairwise Disjoint Paths Routing in Tori. IEEE Access Keiichi Kaneko, Son Van Nguyen, Huynh Thi Thanh Binh
2019	Misc	`conf`	A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. SIGITE Antoine Bossard, Keiichi Kaneko
2019	—	`conf`	A System for Grouping Texts and Objects in Slide Layout. IIAI-AAI Fumiya Suzuki, Kousuke Mouri, Atsushi Shimada, Noriko Uosaki, Chengjiu Yin, Keiichi Kaneko
2019	—	`conf`	Design of a Location-based Word Recommendation System Based on Association Rule Mining Analysis. IIAI-AAI Mohammad Nehal Hasnine, Gökhan Akçapinar, Brendan Flanagan, Kousuke Mouri, Hiroaki Ogata, Keiichi Kaneko, Noriko Uosaki
2019	—	`conf`	Development of an Answer Verification System for Helping Visually Impaired People to Learn a Spreadsheet Software. IIAI-AAI Isao Hiramatsu, Kousuke Mouri, Bipin Indurkhya, Keiichi Kaneko
2019	—	`conf`	Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts. HCI (22) Fumiya Suzuki, Kousuke Mouri, Noriko Uosaki, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko
2019	Misc	`conf`	Refining the Unrestricted Character Encoding for Japanese. CATA Antoine Bossard, Keiichi Kaneko
2019	C	`conf`	Supporting ubiquitous language learning with object and text detection technologies. ICCE Kousuke Mouri, Noriko Uosaki, Chengjiu Yin, Atsushi Shimada, Mohammad Nehal Hasnine, Keiichi Kaneko, Hiroaki Ogata
2019	C	`conf`	UCEJ Database Refinement and Applicability Proof. ISM Antoine Bossard, Keiichi Kaneko
2018	—	`conf`	A Pairing Method Based on Characteristics of Learners' Artifacts in Conceptual Modeling Exercises. IIAI-AAI Daiuske Ike, Takafumi Tanaka, Kousuke Mouri, Keiichi Kaneko
2018	J	`jnl`	A stochastic link-fault-tolerant routing algorithm in folded hypercubes. J. Supercomput. Bui Thi Thuan, Lam Boi Ngoc, Keiichi Kaneko
2018	—	`conf`	Design and Development of a Subtitle Summarization System for Vocabulary Learning. IIAI-AAI Hiroharu Kawashima, Takafumi Tanaka, Kousuke Mouri, Keiichi Kaneko
2018	—	`conf`	Fault-tolerant Routing Methods in Crossed Cubes. IAIT Koji Otake, Kousuke Mouri, Keiichi Kaneko
2018	J	`jnl`	Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph. J. Inf. Sci. Eng. Yo Nishiyama, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, Keiichi Kaneko
2018	J	`jnl`	Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises. IEICE Trans. Inf. Syst. Takafumi Tanaka, Hiroaki Hashiura, Atsuo Hazeyama, Seiichi Komiya, Yuki Hirai, Keiichi Kaneko
2018	—	`conf`	Node-to-node Disjoint Paths in Twisted Crossed Cubes. IAIT Hiroki Nagashima, Kousuke Mouri, Keiichi Kaneko
2018	—	`conf`	On the Torus Pairwise Disjoint-Path Routing Problem. iThings/GreenCom/CPSCom/SmartData Antoine Bossard, Keiichi Kaneko
2018	Misc	`conf`	Proposal of an Unrestricted Character Encoding for Japanese. DB&IS Antoine Bossard, Keiichi Kaneko
2018	—	`conf`	Redesign of a Data Collection in Digital Textbook Systems. IIAI-AAI Kousuke Mouri, Noriko Uosaki, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata
2018	—	`conf`	Stochastic Link-Fault-Tolerant Routing In A Torus. JCSSE Seiya Kuramochi, Yu-on Chatchakan, Kousuke Mouri, Keiichi Kaneko
2018	J	`jnl`	Torus Pairwise Disjoint-Path Routing. Sensors Antoine Bossard, Keiichi Kaneko
2018	—	`conf`	Unrestricted Character Encoding for Japanese. DB&IS (Selected Papers) Antoine Bossard, Keiichi Kaneko
2017	J	`jnl`	A Set-to-Set Disjoint Paths Routing Algorithm in Tori. Int. J. Netw. Comput. Keiichi Kaneko, Antoine Bossard
2017	J	`jnl`	A Support System for Solving Problems of Two-Triangle Congruence Using 'Backward Chaining'. IEICE Trans. Inf. Syst. Ryosuke Onda, Yuki Hirai, Kay Penny, Bipin Indurkhya, Keiichi Kaneko
2017	J	`jnl`	An Algorithm to Evaluate Appropriateness of Still Images for Learning Concrete Nouns of a New Foreign Language. IEICE Trans. Inf. Syst. Mohammad Nehal Hasnine, Masatoshi Ishikawa, Yuki Hirai, Haruko Miyakoda, Keiichi Kaneko
2017	J	`jnl`	Node-to-Node Disjoint Paths Problem in Möbius Cubes. IEICE Trans. Inf. Syst. David Kocik, Keiichi Kaneko
2017	C	`conf`	Real-time Analysis of Digital Textbooks: What Keywords Make Lecture Difficult? ICCE Kousuke Mouri, Atsushi Shimada, Chengjiu Yin, Noriko Uosaki, Vachirawit Tengchaisri, Keiichi Kaneko
2017	J	`jnl`	Stochastic Fault-Tolerant Routing in Dual-Cubes. IEICE Trans. Inf. Syst. Junsuk Park, Nobuhiro Seki, Keiichi Kaneko
2016	—	`conf`	A Method for Collecting Learners' Thinking Process in ER Modeling Exercises and Its Application Experiment. UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld Takafumi Tanaka, Hiroaki Hashiura, Atsuo Hazeyama, Seiichi Komiya, Yuki Hirai, Keiichi Kaneko
2016	J	`jnl`	Node-to-Set Disjoint Paths Problem in a Möbius Cube. IEICE Trans. Inf. Syst. David Kocik, Yuki Hirai, Keiichi Kaneko
2016	J	`jnl`	Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. IEICE Trans. Inf. Syst. Antoine Bossard, Keiichi Kaneko
2016	—	`conf`	Set-to-Set Disjoint Paths in Tori. CANDAR Keiichi Kaneko, Antoine Bossard
2015	J	`jnl`	A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. Int. J. Networked Distributed Comput. Antoine Bossard, Keiichi Kaneko
2015	—	`conf`	A learning system of Quadratic Functions based on scaffolding support. ITHET Tatsuya Ishida, Yuki Hirai, Keiichi Kaneko
2015	—	`conf`	Ambient Conversation Support in Small Face-to-Face Group Meetings. SoICT Yuki Hirai, Keiichi Kaneko
2015	J	`jnl`	Hypercube Fault Tolerant Routing with Bit Constraint. Int. J. Netw. Comput. Antoine Bossard, Keiichi Kaneko
2015	J	`jnl`	Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. Antoine Bossard, Keiichi Kaneko, Shietung Peng
2015	—	`conf`	On Solving the Container Problem in a Hypercube with Bit Constraint. SNPD (revised selected papers) Antoine Bossard, Keiichi Kaneko
2015	J	`jnl`	Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. Int. J. Appl. Math. Comput. Sci. Antoine Bossard, Keiichi Kaneko
2014	C	`conf`	Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs. PDCAT Yo Nishiyama, Yuki Hirai, Keiichi Kaneko
2014	C	`conf`	Fault-Tolerant Routing in (n, k) - Star Graphs. PDCAT Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko
2014	J	`jnl`	Fault-tolerant routing based on approximate directed routable probabilities for hypercubes. Future Gener. Comput. Syst. Thuy Dinh Duong, Keiichi Kaneko
2014	—	`conf`	On Hypercube Routing and Fault Tolerance with Bit Constraint. CANDAR Antoine Bossard, Keiichi Kaneko
2014	J	`jnl`	Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. Antoine Bossard, Keiichi Kaneko
2014	Misc	`conf`	The Container Problem in a Torus-connected Cycles Network. ICCS Antoine Bossard, Keiichi Kaneko
2014	J	`jnl`	Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng. Antoine Bossard, Keiichi Kaneko
2014	J	`jnl`	k-pairwise disjoint paths routing in perfect hierarchical hypercubes. J. Supercomput. Antoine Bossard, Keiichi Kaneko
2013	—	`conf`	A support system for probability learning based on scaffolding approach. ITI Yuki Ishikawa, Yuki Hirai, Keiichi Kaneko
2013	—	`conf`	Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. ICA3PP (2) Antoine Bossard, Keiichi Kaneko
2012	—	`conf`	A learning system for matrix operations by interactive drilling. ITI Chisato Tada, Naoya Wada, Keiichi Kaneko
2012	J	`jnl`	Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. Comput. J. Antoine Bossard, Keiichi Kaneko
2012	J	`jnl`	The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. Antoine Bossard, Keiichi Kaneko
2011	J	`jnl`	A Multilingual Chat System with Image Presentation for Detecting Mistranslation. J. Comput. Inf. Technol. Eri Hosogai, Tsubasa Mukai, Sinyu Jung, Yasufumi Kowase, Antoine Bossard, Yong Xu, Masatoshi Ishikawa, Keiichi Kaneko
2011	J	`jnl`	A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011	—	`conf`	A routing algorithm of pairwise disjoint paths in a burnt pancake graph. SoICT Tatsuya Iwasaki, Keiichi Kaneko
2011	J	`jnl`	Effective learning material for mobile devices: Visual data vs. Aural data vs. Text data. J. Lang. Technol. Comput. Linguistics Haruko Miyakoda, Keiichi Kaneko, Masatoshi Ishikawa
2011	—	`conf`	Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes. ICA3PP (1) Thuy Dinh Duong, Keiichi Kaneko
2011	Misc	`conf`	Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS Antoine Bossard, Keiichi Kaneko, Shietung Peng
2011	Misc	`conf`	Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. CATA Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko
2011	—	`conf`	Set-to-set disjoint-path routing in perfect hierarchical hypercubes. C3S2E Antoine Bossard, Keiichi Kaneko
2010	Misc	`conf`	A Feedback Vertex Set on Pancake Graphs. PDPTA Sinyu Jung, Keiichi Kaneko
2010	—	`conf`	Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. ICA3PP (2) Nagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko
2010	—	`conf`	Effective Materials for Abstract Words in Foreign Vocabulary Learning. WMUTE Takahiro Kayama, Keiichi Kaneko, Haruko Miyakoda, Masatoshi Ishikawa
2010	—	`conf`	Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) Antoine Bossard, Keiichi Kaneko, Shietung Peng
2010	J	`jnl`	Fault-tolerant routing in burnt pancake graphs. Inf. Process. Lett. Tatsuya Iwasaki, Keiichi Kaneko
2010	C	`conf`	Set-to-Set Disjoint-Path Routing in Metacube. PDCAT Shietung Peng, Keiichi Kaneko
2009	Misc	`conf`	A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. PDPTA Tatsuya Iwasaki, Keiichi Kaneko
2009	—	`conf`	A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009	—	`conf`	Automatic creation of materials for vocabulary learning based on pictures by mobile phones of learners. ITI Masatoshi Ishikawa, Keiichi Kaneko, Haruko Miyakoda, Norihide Shinagawa
2009	C	`conf`	Node-to-Set Disjoint-path Routing in Metacube. PDCAT Antoine Bossard, Keiichi Kaneko, Shietung Peng
2009	—	`conf`	Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation. ITNG Hakun Lee, Keiichi Kaneko
2008	Misc	`conf`	A New Configuration of an Incomplete Star Graph and its Routing Algorithm. PDPTA Tatsuya Iwasaki, Keiichi Kaneko
2008	—	`conf`	Autonomous and collaborative learning environment for vocabulary acquirement. ITI Keiichi Kaneko, Kazunori Hasegawa, Xin Jin, Masatoshi Ishikawa, Norihide Shinagawa, Haruko Miyakoda
2008	B	`conf`	Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning. ICALT Xin Jin, Masatoshi Ishikawa, Keiichi Kaneko, Haruko Miyakoda, Norihide Shinagawa
2008	—	`conf`	Design of a web-based visual simulator and its evaluation based on real computer education. SimuTools Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa
2008	C	`conf`	New Approaches for Software Watermarking by Register Allocation. SNPD Hakun Lee, Keiichi Kaneko
2008	—	`conf`	Node-to-Set Disjoint Paths Routing in Dual-Cube. ISPAN Keiichi Kaneko, Shietung Peng
2008	C	`conf`	Set-to-Set Disjoint Paths Routing in Dual-Cubes. PDCAT Keiichi Kaneko, Shietung Peng
2008	J	`jnl`	The Container Problem in Bubble-Sort Graphs. IEICE Trans. Inf. Syst. Yasuto Suzuki, Keiichi Kaneko
2007	—	`conf`	A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. PDCS Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
2007	B	`conf`	A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education. ICALT Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa
2007	Misc	`conf`	An (n, k)-Pancake Graph and its Properties. PDPTA Naoki Sawada, Keiichi Kaneko
2007	J	`jnl`	An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. IEICE Trans. Inf. Syst. Keiichi Kaneko, Naoki Sawada
2007	J	`jnl`	Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs. IEICE Trans. Inf. Syst. Keiichi Kaneko
2007	B	`conf`	Long-term Memory of Foreign-word Learning by Short Movies for iPods. ICALT Satoko Amemiya, Kazunori Hasegawa, Keiichi Kaneko, Haruko Miyakoda, Wataru Tsukahara
2007	C	`conf`	Pairwise Disjoint Paths in Pancake Graphs. PDCAT Naoki Sawada, Keiichi Kaneko, Shietung Peng
2006	J	`jnl`	An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Trans. Inf. Syst. Keiichi Kaneko
2006	J	`jnl`	An algorithm for disjoint paths in bubble-sort graphs. Syst. Comput. Jpn. Yasuto Suzuki, Keiichi Kaneko
2006	J	`jnl`	Application of a Visual Computer Simulator into Collaborative Learning. J. Comput. Inf. Technol. Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa
2006	—	`conf`	Computing the Diameter of 17-Pancake Graph Using a PC Cluster. Euro-Par Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko
2006	Misc	`conf`	Design and Implementation of a Dependable Interpreter for Functional Programs. CATA Yosuke Takigiku, Yasuaki Oota, Keiichi Kaneko
2006	C	`conf`	Disjoint Paths Routing in Pancake Graphs. PDCAT Keiichi Kaneko, Shietung Peng
2006	Misc	`conf`	Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. PDPTA Keiichi Kaneko
2006	J	`jnl`	Node-Disjoint Paths Algorithm in a Transposition Graph. IEICE Trans. Inf. Syst. Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
2006	C	`conf`	Routing Problems in Incomplete Pancake Graphs. SNPD Keiichi Kaneko
2006	Misc	`conf`	Routing Problems in Incomplete Rotator Graphs. PDPTA Keiichi Kaneko
2005	—	`conf`	Computing the Diameters of 14- and 15-Pancake Graphs. ISPAN Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano
2005	C	`conf`	Container Problem in Burnt Pancake Graphs. ISPA Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko
2005	—	`conf`	Hamiltonian Cycles and Paths in Burnt Pancake Graphs. PDCS Yasuto Suzuki, Naoki Sawada, Keiichi Kaneko
2005	J	`jnl`	Internally-Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Trans. Inf. Syst. Keiichi Kaneko
2004	C	`conf`	Container Problem in Bi-rotator Graphs. PDCAT Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa
2004	—	`conf`	Container Problem in Substring Reversal Graphs. ISPAN Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
2004	Misc	`conf`	Node-disjoint Paths in a Transposition Graph. PDPTA Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori
2004	C	`conf`	Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. PRDC Keiichi Kaneko, Yasuto Suzuki
2004	C	`conf`	Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. ISPA Keiichi Kaneko
2003	C	`conf`	Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. SNPD Keiichi Kaneko
2000	—	`conf`	Node-to-Set Disjoint Paths Problem in Rotator Graphs. ASIAN Keiichi Kaneko, Yasuto Suzuki
1999	—	`conf`	Fault-Tolerant Routing Algorithms for Hypercube Networks. IPPS/SPDP Keiichi Kaneko, Hideo Ito
1999	—	`conf`	Generalized Hierarchical Completely-Connected Networks. ISPAN Toshinori Takabatake, Keiichi Kaneko, Hideo Ito
1999	C	`conf`	LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. PRDC Mikio Yagi, Keiichi Kaneko, Hideo Ito