( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Application of a Visual Computer Simulator into Collaborative Learning.

, , и . J. Comput. Inf. Technol., 14 (4): 267-273 (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.

Tanja Kaneko

Keiichi Kato

Gaël Kaneko

Kiosuke Kaneko

Keiichi Yamada

 

Другие публикации лиц с тем же именем

Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs., , и . CATA, стр. 21-26. ISCA, (2011)A Fault-tolerant Routing Algorithm of Burnt Pancake Graphs., и . PDPTA, стр. 307-313. CSREA Press, (2009)A Feedback Vertex Set on Pancake Graphs., и . PDPTA, стр. 532-540. CSREA Press, (2010)Fault-tolerant routing in burnt pancake graphs., и . Inf. Process. Lett., 110 (14-15): 535-538 (2010)On Solving the Container Problem in a Hypercube with Bit Constraint., и . SNPD (revised selected papers), том 612 из Studies in Computational Intelligence, стр. 77-92. Springer, (2015)Going Beyond Computer-Assisted Vocabulary Learning: Research Synthesis and Frameworks., , , и . HCI (23), том 12203 из Lecture Notes in Computer Science, стр. 610-623. Springer, (2020)Hamiltonian Cycles and Paths in Burnt Pancake Graphs., , и . PDCS, стр. 85-90. ISCA, (2005)Refining the Unrestricted Character Encoding for Japanese., и . CATA, том 58 из EPiC Series in Computing, стр. 292-300. EasyChair, (2019)A routing algorithm of pairwise disjoint paths in a burnt pancake graph., и . SoICT, стр. 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)