( en | de | ru )

 

Disambiguation of "Kaneko, Keiichi"

Author of the publication

copydeleteadd this publication to your clipboard
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs.

. IEICE Trans. Inf. Syst., 89-D (2): 647-653 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Kaneko

Keiichi Kato

Gaël Kaneko

Kiosuke Kaneko

Keiichi Omoto

 

Other publications of authors with the same name

Proposal of an Unrestricted Character Encoding for Japanese., and . DB&IS, volume 838 of Communications in Computer and Information Science, page 189-201. Springer, (2018)New Approaches for Software Watermarking by Register Allocation., and . SNPD, page 63-68. IEEE Computer Society, (2008)Design of a web-based visual simulator and its evaluation based on real computer education., , and . SimuTools, page 44. ICST/ACM, (2008)Internally-Disjoint Paths Problem in Bi-Rotator Graphs.. IEICE Trans. Inf. Syst., 88-D (7): 1678-1684 (2005)Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs.. IEICE Trans. Inf. Syst., 90-D (4): 716-721 (2007)Node-to-Node Disjoint Paths Problem in Möbius Cubes., and . IEICE Trans. Inf. Syst., 100-D (8): 1837-1843 (2017)A Pairing Method Based on Characteristics of Learners' Artifacts in Conceptual Modeling Exercises., , , and . IIAI-AAI, page 268-272. IEEE, (2018)Node-to-Set Disjoint Paths Routing in Dual-Cube., and . ISPAN, page 77-82. IEEE Computer Society, (2008)Fault-Tolerant Routing in (n, k) - Star Graphs., , , and . PDCAT, page 113-118. IEEE Computer Society, (2014)Ambient Conversation Support in Small Face-to-Face Group Meetings., and . SoICT, page 239-246. ACM, (2015)