Keiichi Kaneko

2008
37	EE	Xin Jin, Masatoshi Ishikawa, Keiichi Kaneko, Haruko Miyakoda, Norihide Shinagawa: Design and Management of Material Sharing System for Ubiquitous Vocabulary Learning. ICALT 2008: 338-340
36	EE	Keiichi Kaneko, Shietung Peng: Node-to-Set Disjoint Paths Routing in Dual-Cube. ISPAN 2008: 77-82
35	EE	Keiichi Kaneko, Shietung Peng: Set-to-Set Disjoint Paths Routing in Dual-Cubes. PDCAT 2008: 129-136
34		Tatsuya Iwasaki, Keiichi Kaneko: A New Configuration of an Incomplete Star Graph and its Routing Algorithm. PDPTA 2008: 116-122
33	EE	Hakun Lee, Keiichi Kaneko: New Approaches for Software Watermarking by Register Allocation. SNPD 2008: 63-68
32	EE	Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa: Design of a web-based visual simulator and its evaluation based on real computer education. SimuTools 2008: 44
31	EE	Yasuto Suzuki, Keiichi Kaneko: The Container Problem in Bubble-Sort Graphs. IEICE Transactions 91-D(4): 1003-1009 (2008)
2007
30	EE	Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa: A Web-based Visual Simulator with Communication Support and its Application to Computer Architecture Education. ICALT 2007: 147-151
29	EE	Satoko Amemiya, Kazunori Hasegawa, Keiichi Kaneko, Haruko Miyakoda, Wataru Tsukahara: Long-term Memory of Foreign-word Learning by Short Movies for iPods. ICALT 2007: 561-563
28		Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng: A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. ISCA PDCS 2007: 200-205
27	EE	Naoki Sawada, Keiichi Kaneko, Shietung Peng: Pairwise Disjoint Paths in Pancake Graphs. PDCAT 2007: 376-382
26		Naoki Sawada, Keiichi Kaneko: An (n, k)-Pancake Graph and its Properties. PDPTA 2007: 173-179
25	EE	Keiichi Kaneko, Naoki Sawada: An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. IEICE Transactions 90-D(1): 306-313 (2007)
24	EE	Keiichi Kaneko: Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs. IEICE Transactions 90-D(4): 716-721 (2007)
2006
23		Yosuke Takigiku, Yasuaki Oota, Keiichi Kaneko: Design and Implementation of a Dependable Interpreter for Functional Programs. Computers and Their Applications 2006: 7-12
22	EE	Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko: Computing the Diameter of 17-Pancake Graph Using a PC Cluster. Euro-Par 2006: 1114-1124
21	EE	Keiichi Kaneko, Shietung Peng: Disjoint Paths Routing in Pancake Graphs. PDCAT 2006: 254-259
20		Keiichi Kaneko: Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. PDPTA 2006: 253-259
19		Keiichi Kaneko: Routing Problems in Incomplete Rotator Graphs. PDPTA 2006: 778-784
18	EE	Keiichi Kaneko: Routing Problems in Incomplete Pancake Graphs. SNPD 2006: 151-156
17	EE	Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori: Node-Disjoint Paths Algorithm in a Transposition Graph. IEICE Transactions 89-D(10): 2600-2605 (2006)
16	EE	Keiichi Kaneko: An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Transactions 89-D(2): 647-653 (2006)
15	EE	Yasuto Suzuki, Keiichi Kaneko: An algorithm for disjoint paths in bubble-sort graphs. Systems and Computers in Japan 37(12): 27-32 (2006)
2005
14		Yasuto Suzuki, Naoki Sawada, Keiichi Kaneko: Hamiltonian Cycles and Paths in Burnt Pancake Graphs. ISCA PDCS 2005: 85-90
13	EE	Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko: Container Problem in Burnt Pancake Graphs. ISPA 2005: 479-490
12	EE	Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano: Computing the Diameters of 14- and 15-Pancake Graphs. ISPAN 2005: 490-495
11	EE	Keiichi Kaneko: Internally-Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Transactions 88-D(7): 1678-1684 (2005)
2004
10	EE	Keiichi Kaneko: Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. ISPA 2004: 556-567
9	EE	Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori: Container Problem in Substring Reversal Graphs. ISPAN 2004: 563-568
8	EE	Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa: Container Problem in Bi-rotator Graphs. PDCAT 2004: 149-154
7		Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori: Node-disjoint Paths in a Transposition Graph. PDPTA 2004: 298-304
6	EE	Keiichi Kaneko, Yasuto Suzuki: Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. PRDC 2004: 173-182
2003
5		Keiichi Kaneko: Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. SNPD 2003: 285-292
2000
4	EE	Keiichi Kaneko, Yasuto Suzuki: Node-to-Set Disjoint Paths Problem in Rotator Graphs. ASIAN 2000: 119-132
1999
3	EE	Keiichi Kaneko, Hideo Ito: Fault-Tolerant Routing Algorithms for Hypercube Networks. IPPS/SPDP 1999: 218-224
2	EE	Toshinori Takabatake, Keiichi Kaneko, Hideo Ito: Generalized Hierarchical Completely-Connected Networks. ISPAN 1999: 68-73
1	EE	Mikio Yagi, Keiichi Kaneko, Hideo Ito: LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. PRDC 1999: 23-

Coauthor Index

1	Satoko Amemiya	[29]
2	Shogo Asai	[22]
3	Kazunori Hasegawa	[29]
4	Yukihiro Hasegawa	[8]
5	Yoshiro Imai	[30] [32]
6	Masatoshi Ishikawa	[37]
7	Hideo Ito	[1] [2] [3]
8	Tatsuya Iwasaki	[34]
9	Xin Jin	[37]
10	Yuusuke Kounoike	[12] [22]
11	Hakun Lee	[33]
12	Haruko Miyakoda	[29] [37]
13	Masaki Nakagawa	[30] [32]
14	Mario Nakamori	[7] [9] [17]
15	Yasuaki Oota	[23]
16	Shietung Peng	[21] [27] [28] [35] [36]
17	Naoki Sawada	[13] [14] [25] [26] [27]
18	Norihide Shinagawa	[37]
19	Yuji Shinano	[12] [22]
20	Yasuto Suzuki	[4] [6] [7] [8] [9] [13] [14] [15] [17] [31]
21	Toshinori Takabatake	[2]
22	Yosuke Takigiku	[23]
23	Wataru Tsukahara	[29]
24	Tatsuro Watanabe	[28]
25	Mikio Yagi	[1]

Colors in the list of coauthors