Kaneko, Keiichi
406  results:
Search for persons X
?
1

Analysis of Code Writing Problem Solution Results in C Prog..:

, In: 2024 IEEE International Conference on Consumer Electronics (ICCE),
 
?
2

Node-to-Set Disjoint Paths Problem in Cross-Cubes:

SASAKI, Rikuya ; ICHIDA, Hiroyuki ; KYAW, Htoo Htoo Sandi.
IEICE Transactions on Information and Systems.  E107.D (2024)  1 - p. 53-59 , 2024
 
?
3

Set-to-set disjoint paths in a folded hypercube:

Ichida, Hiroyuki ; Kaneko, Keiichi
Theoretical Computer Science.  1000 (2024)  - p. 114562 , 2024
 
?
4

On the Crossing Number of a Torus Network:

BOSSARD, Antoine ; KANEKO, Keiichi ; HARRIS, JR., Frederick C.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E106.A (2023)  1 - p. 35-44 , 2023
 
?
5

Feedback Node Sets in Pancake Graphs and Burnt Pancake Grap..:

JUNG, Sinyu ; KANEKO, Keiichi
IEICE Transactions on Information and Systems.  E106.D (2023)  10 - p. 1677-1685 , 2023
 
?
7

Fault-tolerant Routing Methods in Bicubes:

, In: 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE),
 
?
10

An Implementation of Coding Rule Checking Function for C Pr..:

, In: 2022 IEEE 4th Global Conference on Life Sciences and Technologies (LifeTech),
 
?
12

Minimal Paths in a Bicube:

OKADA, Masaaki ; KANEKO, Keiichi
IEICE Transactions on Information and Systems.  E105.D (2022)  8 - p. 1383-1392 , 2022
 
?
13

A Shortest-Path Routing Algorithm in Bicubes:

, In: Advances in Parallel & Distributed Processing, and Applications; Transactions on Computational Science and Computational Intelligence,
Okada, Masaaki ; Kaneko, Keiichi - p. 525-539 , 2021
 
?
14

Node-Disjoint Paths Problems in Directed Bijective Connecti..:

KANEKO, Keiichi
IEICE Transactions on Information and Systems.  E103.D (2020)  1 - p. 93-100 , 2020
 
?
15

Going Beyond Computer-Assisted Vocabulary Learning: Researc..:

, In: Distributed, Ambient and Pervasive Interactions; Lecture Notes in Computer Science,
 
1-15