default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeiichi Kaneko
Person information
- affiliation: Tokyo University of Agriculture and Technology, Japan
- affiliation (1997 - 1999): Chiba University, Faculty of Engineering, Japan
- affiliation (PhD 1994): University of Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j47]Rikuya Sasaki, Hiroyuki Ichida, Htoo Htoo Sandi Kyaw, Keiichi Kaneko
:
Node-to-Set Disjoint Paths Problem in Cross-Cubes. IEICE Trans. Inf. Syst. 107(1): 53-59 (2024)- [j46]Arata Kaneko, Htoo Htoo Sandi Kyaw, Kunihiro Fujiyoshi, Keiichi Kaneko:
Node-to-Node and Node-to-Set Disjoint Paths Problems in Bicubes. IEICE Trans. Inf. Syst. 107(9): 1133-1139 (2024) - [j45]Hiroyuki Ichida, Keiichi Kaneko:
Set-to-set disjoint paths in a folded hypercube. Theor. Comput. Sci. 1000: 114562 (2024) - 2023
- [j44]Antoine Bossard, Keiichi Kaneko, Frederick C. Harris Jr.:
On the Crossing Number of a Torus Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(1): 35-44 (2023) - [j43]Sinyu Jung, Keiichi Kaneko:
Feedback Node Sets in Pancake Graphs and Burnt Pancake Graphs. IEICE Trans. Inf. Syst. 106(10): 1677-1685 (2023) - 2022
- [j42]Keiichi Kaneko, Antoine Bossard, Frederick C. Harris Jr.:
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. IEEE Access 10: 72731-72742 (2022) - [j41]Hiroyuki Ichida, Keiichi Kaneko:
Set-to-Set Disjoint Paths Problem in Möbius Cubes. IEEE Access 10: 83075-83084 (2022) - [j40]Masaaki Okada, Keiichi Kaneko:
Minimal Paths in a Bicube. IEICE Trans. Inf. Syst. 105-D(8): 1383-1392 (2022) - 2021
- [j39]Kousuke Mouri, Noriko Uosaki, Mohammad Nehal Hasnine, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata:
An automatic quiz generation system utilizing digital textbook logs. Interact. Learn. Environ. 29(5): 743-756 (2021) - [j38]Kousuke Mouri, Fumiya Suzuki, Atsushi Shimada, Noriko Uosaki, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata:
Educational data mining for discovering hidden browsing patterns using non-negative matrix factorization. Interact. Learn. Environ. 29(7): 1176-1188 (2021) - 2020
- [j37]Keiichi Kaneko, Son Van Nguyen, Huynh Thi Thanh Binh:
Pairwise Disjoint Paths Routing in Tori. IEEE Access 8: 192206-192217 (2020) - [j36]Keiichi Kaneko:
Node-Disjoint Paths Problems in Directed Bijective Connection Graphs. IEICE Trans. Inf. Syst. 103-D(1): 93-100 (2020) - [j35]Mohammad Nehal Hasnine, Hiroaki Ogata, Gökhan Akçapinar, Kousuke Mouri, Keiichi Kaneko:
Closing the Experiential Learning Loops Using Learning Analytics Cycle: Towards Authentic Experience Sharing for Vocabulary Learning. Int. J. Distance Educ. Technol. 18(3): 78-98 (2020) - [j34]Antoine Bossard, Keiichi Kaneko:
Cluster-Fault Tolerant Routing in a Torus. Sensors 20(11): 3286 (2020) - 2018
- [j33]Takafumi Tanaka, Hiroaki Hashiura, Atsuo Hazeyama, Seiichi Komiya, Yuki Hirai, Keiichi Kaneko:
Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises. IEICE Trans. Inf. Syst. 101-D(7): 1801-1810 (2018) - [j32]Yo Nishiyama, Yuko Sasaki, Yuki Hirai, Hironori Nakajo, Keiichi Kaneko:
Fault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph. J. Inf. Sci. Eng. 34(6): 1353-1366 (2018) - [j31]Antoine Bossard, Keiichi Kaneko:
Torus Pairwise Disjoint-Path Routing. Sensors 18(11): 3912 (2018) - [j30]Bui Thi Thuan, Lam Boi Ngoc, Keiichi Kaneko:
A stochastic link-fault-tolerant routing algorithm in folded hypercubes. J. Supercomput. 74(10): 5539-5557 (2018) - 2017
- [j29]David Kocik, Keiichi Kaneko:
Node-to-Node Disjoint Paths Problem in Möbius Cubes. IEICE Trans. Inf. Syst. 100-D(8): 1837-1843 (2017) - [j28]Junsuk Park, Nobuhiro Seki, Keiichi Kaneko:
Stochastic Fault-Tolerant Routing in Dual-Cubes. IEICE Trans. Inf. Syst. 100-D(8): 1920-1921 (2017) - [j27]Mohammad Nehal Hasnine, Masatoshi Ishikawa, Yuki Hirai, Haruko Miyakoda, Keiichi Kaneko:
An Algorithm to Evaluate Appropriateness of Still Images for Learning Concrete Nouns of a New Foreign Language. IEICE Trans. Inf. Syst. 100-D(9): 2156-2164 (2017) - [j26]Ryosuke Onda, Yuki Hirai, Kay Penny, Bipin Indurkhya, Keiichi Kaneko:
A Support System for Solving Problems of Two-Triangle Congruence Using 'Backward Chaining'. IEICE Trans. Inf. Syst. 100-D(10): 2567-2577 (2017) - [j25]Keiichi Kaneko, Antoine Bossard:
A Set-to-Set Disjoint Paths Routing Algorithm in Tori. Int. J. Netw. Comput. 7(2): 173-186 (2017) - 2016
- [j24]David Kocik, Yuki Hirai, Keiichi Kaneko:
Node-to-Set Disjoint Paths Problem in a Möbius Cube. IEICE Trans. Inf. Syst. 99-D(3): 708-713 (2016) - [j23]Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. IEICE Trans. Inf. Syst. 99-D(11): 2821-2823 (2016) - 2015
- [j22]Antoine Bossard, Keiichi Kaneko:
Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. Int. J. Appl. Math. Comput. Sci. 25(4): 723-735 (2015) - [j21]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. 8(4): 315-323 (2015) - [j20]Antoine Bossard, Keiichi Kaneko:
Hypercube Fault Tolerant Routing with Bit Constraint. Int. J. Netw. Comput. 5(2): 272-289 (2015) - [j19]Antoine Bossard, Keiichi Kaneko:
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. Int. J. Networked Distributed Comput. 3(4): 202-213 (2015) - 2014
- [j18]Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. 57(2): 332-337 (2014) - [j17]Thuy Dinh Duong, Keiichi Kaneko:
Fault-tolerant routing based on approximate directed routable probabilities for hypercubes. Future Gener. Comput. Syst. 37: 88-96 (2014) - [j16]Antoine Bossard, Keiichi Kaneko:
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng. 30(4): 1087-1093 (2014) - [j15]Antoine Bossard, Keiichi Kaneko:
k-pairwise disjoint paths routing in perfect hierarchical hypercubes. J. Supercomput. 67(2): 485-495 (2014) - 2012
- [j14]Antoine Bossard, Keiichi Kaneko:
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. 55(6): 769-775 (2012) - [j13]Antoine Bossard, Keiichi Kaneko:
Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. Comput. J. 55(12): 1440-1446 (2012) - 2011
- [j12]Eri Hosogai, Tsubasa Mukai, Sinyu Jung, Yasufumi Kowase, Antoine Bossard, Yong Xu, Masatoshi Ishikawa, Keiichi Kaneko:
A Multilingual Chat System with Image Presentation for Detecting Mistranslation. J. Comput. Inf. Technol. 19(4): 247-253 (2011) - [j11]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. 54(8): 1372-1381 (2011) - [j10]Haruko Miyakoda, Keiichi Kaneko, Masatoshi Ishikawa:
Effective learning material for mobile devices: Visual data vs. Aural data vs. Text data. J. Lang. Technol. Comput. Linguistics 26(1): 39-51 (2011) - 2010
- [j9]Tatsuya Iwasaki, Keiichi Kaneko:
Fault-tolerant routing in burnt pancake graphs. Inf. Process. Lett. 110(14-15): 535-538 (2010) - 2008
- [j8]Yasuto Suzuki, Keiichi Kaneko:
The Container Problem in Bubble-Sort Graphs. IEICE Trans. Inf. Syst. 91-D(4): 1003-1009 (2008) - 2007
- [j7]Keiichi Kaneko, Naoki Sawada:
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. IEICE Trans. Inf. Syst. 90-D(1): 306-313 (2007) - [j6]Keiichi Kaneko:
Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs. IEICE Trans. Inf. Syst. 90-D(4): 716-721 (2007) - 2006
- [j5]Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa:
Application of a Visual Computer Simulator into Collaborative Learning. J. Comput. Inf. Technol. 14(4): 267-273 (2006) - [j4]Keiichi Kaneko:
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Trans. Inf. Syst. 89-D(2): 647-653 (2006) - [j3]Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori:
Node-Disjoint Paths Algorithm in a Transposition Graph. IEICE Trans. Inf. Syst. 89-D(10): 2600-2605 (2006) - [j2]Yasuto Suzuki, Keiichi Kaneko:
An algorithm for disjoint paths in bubble-sort graphs. Syst. Comput. Jpn. 37(12): 27-32 (2006) - 2005
- [j1]Keiichi Kaneko:
Internally-Disjoint Paths Problem in Bi-Rotator Graphs. IEICE Trans. Inf. Syst. 88-D(7): 1678-1684 (2005)
Conference and Workshop Papers
- 2024
- [c77]Htoo Htoo Sandi Kyaw, Keiichi Kaneko, Nobuo Funabiki:
Analysis of Code Writing Problem Solution Results in C Programming Course. ICCE 2024: 1-5 - 2022
- [c76]Htoo Htoo Sandi Kyaw, Keiichi Kaneko, Nobuo Funabiki, Kiyoshi Ueda:
An Implementation of Coding Rule Checking Function for C Programming Study. LifeTech 2022: 133-134 - 2020
- [c75]Mohammad Nehal Hasnine, Masatoshi Ishikawa, Kousuke Mouri, Keiichi Kaneko:
Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks. HCI (23) 2020: 610-623 - 2019
- [c74]Antoine Bossard, Keiichi Kaneko:
Refining the Unrestricted Character Encoding for Japanese. CATA 2019: 292-300 - [c73]Fumiya Suzuki, Kousuke Mouri, Noriko Uosaki, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko:
Elicitation of Appropriate Scratching Zones Based on Lecture Slide Layouts. HCI (22) 2019: 430-441 - [c72]Isao Hiramatsu, Kousuke Mouri, Bipin Indurkhya, Keiichi Kaneko:
Development of an Answer Verification System for Helping Visually Impaired People to Learn a Spreadsheet Software. IIAI-AAI 2019: 190-195 - [c71]Mohammad Nehal Hasnine, Gökhan Akçapinar, Brendan Flanagan, Kousuke Mouri, Hiroaki Ogata, Keiichi Kaneko, Noriko Uosaki:
Design of a Location-based Word Recommendation System Based on Association Rule Mining Analysis. IIAI-AAI 2019: 250-253 - [c70]Fumiya Suzuki, Kousuke Mouri, Atsushi Shimada, Noriko Uosaki, Chengjiu Yin, Keiichi Kaneko:
A System for Grouping Texts and Objects in Slide Layout. IIAI-AAI 2019: 1043-1044 - [c69]Antoine Bossard, Keiichi Kaneko:
UCEJ Database Refinement and Applicability Proof. ISM 2019: 64-71 - [c68]Antoine Bossard, Keiichi Kaneko:
A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. SIGITE 2019: 63-68 - 2018
- [c67]Antoine Bossard, Keiichi Kaneko:
Unrestricted Character Encoding for Japanese. DB&IS (Selected Papers) 2018: 161-175 - [c66]Antoine Bossard, Keiichi Kaneko:
Proposal of an Unrestricted Character Encoding for Japanese. DB&IS 2018: 189-201 - [c65]Hiroki Nagashima, Kousuke Mouri, Keiichi Kaneko:
Node-to-node Disjoint Paths in Twisted Crossed Cubes. IAIT 2018: 5:1-5:8 - [c64]Koji Otake, Kousuke Mouri, Keiichi Kaneko:
Fault-tolerant Routing Methods in Crossed Cubes. IAIT 2018: 10:1-10:8 - [c63]Daiuske Ike, Takafumi Tanaka, Kousuke Mouri, Keiichi Kaneko:
A Pairing Method Based on Characteristics of Learners' Artifacts in Conceptual Modeling Exercises. IIAI-AAI 2018: 268-272 - [c62]Hiroharu Kawashima, Takafumi Tanaka, Kousuke Mouri, Keiichi Kaneko:
Design and Development of a Subtitle Summarization System for Vocabulary Learning. IIAI-AAI 2018: 362-365 - [c61]Kousuke Mouri, Noriko Uosaki, Atsushi Shimada, Chengjiu Yin, Keiichi Kaneko, Hiroaki Ogata:
Redesign of a Data Collection in Digital Textbook Systems. IIAI-AAI 2018: 942-943 - [c60]Antoine Bossard, Keiichi Kaneko:
On the Torus Pairwise Disjoint-Path Routing Problem. iThings/GreenCom/CPSCom/SmartData 2018: 1739-1746 - [c59]Seiya Kuramochi, Yu-on Chatchakan, Kousuke Mouri, Keiichi Kaneko:
Stochastic Link-Fault-Tolerant Routing In A Torus. JCSSE 2018: 1-6 - 2016
- [c58]Keiichi Kaneko, Antoine Bossard:
Set-to-Set Disjoint Paths in Tori. CANDAR 2016: 91-97 - [c57]Takafumi Tanaka, Hiroaki Hashiura, Atsuo Hazeyama, Seiichi Komiya, Yuki Hirai, Keiichi Kaneko:
A Method for Collecting Learners' Thinking Process in ER Modeling Exercises and Its Application Experiment. UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld 2016: 482-488 - 2015
- [c56]Tatsuya Ishida, Yuki Hirai, Keiichi Kaneko:
A learning system of Quadratic Functions based on scaffolding support. ITHET 2015: 1-6 - [c55]Antoine Bossard, Keiichi Kaneko:
On Solving the Container Problem in a Hypercube with Bit Constraint. SNPD (revised selected papers) 2015: 77-92 - [c54]Yuki Hirai, Keiichi Kaneko:
Ambient Conversation Support in Small Face-to-Face Group Meetings. SoICT 2015: 239-246 - 2014
- [c53]Antoine Bossard, Keiichi Kaneko:
On Hypercube Routing and Fault Tolerance with Bit Constraint. CANDAR 2014: 40-49 - [c52]Antoine Bossard, Keiichi Kaneko:
The Container Problem in a Torus-connected Cycles Network. ICCS 2014: 2182-2191 - [c51]Yo Nishiyama, Yuki Hirai, Keiichi Kaneko:
Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs. PDCAT 2014: 76-81 - [c50]Takara Ito, Manabu Myojin, Yuki Hirai, Keiichi Kaneko:
Fault-Tolerant Routing in (n, k) - Star Graphs. PDCAT 2014: 113-118 - 2013
- [c49]Antoine Bossard, Keiichi Kaneko:
Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. ICA3PP (2) 2013: 11-21 - [c48]Yuki Ishikawa, Yuki Hirai, Keiichi Kaneko:
A support system for probability learning based on scaffolding approach. ITI 2013: 205-210 - 2012
- [c47]Chisato Tada, Naoya Wada, Keiichi Kaneko:
A learning system for matrix operations by interactive drilling. ITI 2012: 261-266 - 2011
- [c46]Antoine Bossard, Keiichi Kaneko:
Set-to-set disjoint-path routing in perfect hierarchical hypercubes. C3S2E 2011: 51-57 - [c45]Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko:
Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. CATA 2011: 21-26 - [c44]Thuy Dinh Duong, Keiichi Kaneko:
Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes. ICA3PP (1) 2011: 106-116 - [c43]Tatsuya Iwasaki, Keiichi Kaneko:
A routing algorithm of pairwise disjoint paths in a burnt pancake graph. SoICT 2011: 62-66 - [c42]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS 2011: 442-451 - 2010
- [c41]Nagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki, Keiichi Kaneko:
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. ICA3PP (2) 2010: 264-274 - [c40]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) 2010: 511-519 - [c39]Shietung Peng, Keiichi Kaneko:
Set-to-Set Disjoint-Path Routing in Metacube. PDCAT 2010: 128-137 - [c38]Sinyu Jung, Keiichi Kaneko:
A Feedback Vertex Set on Pancake Graphs. PDPTA 2010: 532-540 - [c37]Takahiro Kayama, Keiichi Kaneko, Haruko Miyakoda, Masatoshi Ishikawa:
Effective Materials for Abstract Words in Foreign Vocabulary Learning. WMUTE 2010: 207-209 - 2009
- [c36]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN 2009: 23-28 - [c35]Masatoshi Ishikawa, Keiichi Kaneko, Haruko Miyakoda, Norihide Shinagawa:
Automatic creation of materials for vocabulary learning based on pictures by mobile phones of learners. ITI 2009: 391-396 - [c34]Hakun Lee, Keiichi Kaneko:
Two New Algorithms for Software Watermarking by Register Allocation and their Empirical Evaluation. ITNG 2009: 217-222 - [c33]Antoine Bossard, Keiichi Kaneko, Shietung Peng:
Node-to-Set Disjoint-path Routing in Metacube. PDCAT 2009: 57-62 - [c32]Tatsuya Iwasaki, Keiichi Kaneko:
A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs. PDPTA 2009: 307-313 - 2008
- [c31]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 - [c30]Keiichi Kaneko, Shietung Peng:
Node-to-Set Disjoint Paths Routing in Dual-Cube. ISPAN 2008: 77-82 - [c29]Keiichi Kaneko, Kazunori Hasegawa, Xin Jin, Masatoshi Ishikawa, Norihide Shinagawa, Haruko Miyakoda:
Autonomous and collaborative learning environment for vocabulary acquirement. ITI 2008: 147-152 - [c28]Keiichi Kaneko, Shietung Peng:
Set-to-Set Disjoint Paths Routing in Dual-Cubes. PDCAT 2008: 129-136 - [c27]Tatsuya Iwasaki, Keiichi Kaneko:
A New Configuration of an Incomplete Star Graph and its Routing Algorithm. PDPTA 2008: 116-122 - [c26]Yoshiro Imai, Keiichi Kaneko, Masaki Nakagawa:
Design of a web-based visual simulator and its evaluation based on real computer education. SimuTools 2008: 44 - [c25]Hakun Lee, Keiichi Kaneko:
New Approaches for Software Watermarking by Register Allocation. SNPD 2008: 63-68 - 2007
- [c24]Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng:
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs. PDCS 2007: 200-205 - [c23]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 - [c22]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 - [c21]Naoki Sawada, Keiichi Kaneko, Shietung Peng:
Pairwise Disjoint Paths in Pancake Graphs. PDCAT 2007: 376-382 - [c20]Naoki Sawada, Keiichi Kaneko:
An (n, k)-Pancake Graph and its Properties. PDPTA 2007: 173-179 - 2006
- [c19]Yosuke Takigiku, Yasuaki Oota, Keiichi Kaneko:
Design and Implementation of a Dependable Interpreter for Functional Programs. CATA 2006: 7-12 - [c18]Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko:
Computing the Diameter of 17-Pancake Graph Using a PC Cluster. Euro-Par 2006: 1114-1124 - [c17]Keiichi Kaneko, Shietung Peng:
Disjoint Paths Routing in Pancake Graphs. PDCAT 2006: 254-259 - [c16]Keiichi Kaneko:
Hamiltonian Paths and Cycles in Faulty Burnt Pancake Graphs. PDPTA 2006: 253-259 - [c15]Keiichi Kaneko:
Routing Problems in Incomplete Rotator Graphs. PDPTA 2006: 778-784 - [c14]Keiichi Kaneko:
Routing Problems in Incomplete Pancake Graphs. SNPD 2006: 151-156 - 2005
- [c13]Yasuto Suzuki, Naoki Sawada, Keiichi Kaneko:
Hamiltonian Cycles and Paths in Burnt Pancake Graphs. PDCS 2005: 85-90 - [c12]Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko:
Container Problem in Burnt Pancake Graphs. ISPA 2005: 479-490 - [c11]Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano:
Computing the Diameters of 14- and 15-Pancake Graphs. ISPAN 2005: 490-495 - 2004
- [c10]Keiichi Kaneko:
Node-to-Set Disjoint Paths Problem in Bi-rotator Graphs. ISPA 2004: 556-567 - [c9]Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori:
Container Problem in Substring Reversal Graphs. ISPAN 2004: 563-568 - [c8]Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa:
Container Problem in Bi-rotator Graphs. PDCAT 2004: 149-154 - [c7]Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori:
Node-disjoint Paths in a Transposition Graph. PDPTA 2004: 298-304 - [c6]Keiichi Kaneko, Yasuto Suzuki:
Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs. PRDC 2004: 173-182 - 2003
- [c5]Keiichi Kaneko:
Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. SNPD 2003: 285-292 - 2000
- [c4]Keiichi Kaneko, Yasuto Suzuki:
Node-to-Set Disjoint Paths Problem in Rotator Graphs. ASIAN 2000: 119-132 - 1999
- [c3]Keiichi Kaneko, Hideo Ito:
Fault-Tolerant Routing Algorithms for Hypercube Networks. IPPS/SPDP 1999: 218-224 - [c2]Toshinori Takabatake, Keiichi Kaneko, Hideo Ito:
Generalized Hierarchical Completely-Connected Networks. ISPAN 1999: 68-73 - [c1]Mikio Yagi, Keiichi Kaneko, Hideo Ito:
LLT and LTn Schemes: Error Recovery Schemes in Mobile Environments. PRDC 1999: 23-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
