Yasuto Suzuki

According to our database, Yasuto Suzuki authored at least 10 papers between 2000 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

The Container Problem in Bubble-Sort Graphs.

Yasuto Suzuki, Keiichi Kaneko

IEICE Trans. Inf. Syst., 2008

2006

An algorithm for disjoint paths in bubble-sort graphs.

Yasuto Suzuki, Keiichi Kaneko

Syst. Comput. Jpn., 2006

Node-Disjoint Paths Algorithm in a Transposition Graph.

Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori

IEICE Trans. Inf. Syst., 2006

2005

Container Problem in Burnt Pancake Graphs.

Naoki Sawada, Yasuto Suzuki, Keiichi Kaneko

Proceedings of the Parallel and Distributed Processing and Applications, 2005

Hamiltonian Cycles and Paths in Burnt Pancake Graphs.

Yasuto Suzuki, Naoki Sawada, Keiichi Kaneko

Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004

Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs.

Keiichi Kaneko, Yasuto Suzuki

Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004

Node-disjoint Paths in a Transposition Graph.

Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Container Problem in Bi-rotator Graphs.

Keiichi Kaneko, Yasuto Suzuki, Yukihiro Hasegawa

Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

Container Problem in Substring Reversal Graphs.

Yasuto Suzuki, Keiichi Kaneko, Mario Nakamori

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2000

Node-to-Set Disjoint Paths Problem in Rotator Graphs.

Keiichi Kaneko, Yasuto Suzuki

Proceedings of the Advances in Computing Science, 2000