( en | de | ru )

 

Disambiguation of "Kaneko, Keiichi"

Author of the publication

copydeleteadd this publication to your clipboard
A Pairing Method Based on Characteristics of Learners' Artifacts in Conceptual Modeling Exercises.

, , , and . IIAI-AAI, page 268-272. IEEE, (2018)

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 Yamada

 

Other publications of authors with the same name

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs., , and . CATA, page 21-26. ISCA, (2011)A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs., and . PDPTA, page 307-313. CSREA Press, (2009)A Feedback Vertex Set on Pancake Graphs., and . PDPTA, page 532-540. CSREA Press, (2010)Fault-tolerant routing in burnt pancake graphs., and . Inf. Process. Lett., 110 (14-15): 535-538 (2010)On Solving the Container Problem in a Hypercube with Bit Constraint., and . SNPD (revised selected papers), volume 612 of Studies in Computational Intelligence, page 77-92. Springer, (2015)Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks., , , and . HCI (23), volume 12203 of Lecture Notes in Computer Science, page 610-623. Springer, (2020)Hamiltonian Cycles and Paths in Burnt Pancake Graphs., , and . PDCS, page 85-90. ISCA, (2005)Refining the Unrestricted Character Encoding for Japanese., and . CATA, volume 58 of EPiC Series in Computing, page 292-300. EasyChair, (2019)A routing algorithm of pairwise disjoint paths in a burnt pancake graph., and . SoICT, page 62-66. ACM, (2011)An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs.. IEICE Trans. Inf. Syst., 89-D (2): 647-653 (2006)