Follow
Toshiki Saitoh
Toshiki Saitoh
Verified email at ces.kyutech.ac.jp
Title
Cited by
Cited by
Year
Swapping labeled tokens on graphs
K Yamanaka, ED Demaine, T Ito, J Kawahara, M Kiyomi, Y Okamoto, ...
Theoretical Computer Science 586, 81-94, 2015
1062015
Extending partial representations of interval graphs
P Klavík, J Kratochvíl, Y Otachi, T Saitoh, T Vyskočil
Algorithmica 78, 945-967, 2017
74*2017
Ia-expressing microglial cells in experimental allergic encephalomyelitis in rats
H Konno, T Yamamoto, Y Iwasaki, T Saitoh, H Suzuki, H Terunuma
Acta neuropathologica 77 (5), 472-479, 1989
611989
Extending partial representations of subclasses of chordal graphs
P Klavík, J Kratochvíl, Y Otachi, T Saitoh
Theoretical Computer Science 576, 85-101, 2015
572015
Finding all solutions and instances of numberlink and slitherlink by ZDDs
R Yoshinaka, T Saitoh, J Kawahara, K Tsuruma, H Iwashita, S Minato
Algorithms 5 (20), 176-213, 2012
522012
Subgraph isomorphism in graph classes
S Kijima, Y Otachi, T Saitoh, T Uno
Discrete Mathematics 312 (21), 3164-3173, 2012
392012
The time complexity of the token swapping problem and its parallel variants
J Kawahara, T Saitoh, R Yoshinaka
WALCOM: Algorithms and Computation: 11th International Conference and …, 2017
342017
Exact algorithms for the max-min dispersion problem
T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ...
International Workshop on Frontiers in Algorithmics, 263-272, 2018
322018
Random generation and enumeration of proper interval graphs
T Saitoh, K Yamanaka, M Kiyomi, R Uehara
IEICE TRANSACTIONS on Information and Systems 93 (7), 1816-1823, 2010
292010
Random generation and enumeration of bipartite permutation graphs
T Saitoh, Y Otachi, K Yamanaka, R Uehara
Journal of Discrete Algorithms 10, 84-97, 2012
262012
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
K Yamazaki, T Saitoh, M Kiyomi, R Uehara
Theoretical Computer Science 806, 310-322, 2020
232020
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
S Shimizu, K Yamaguchi, T Saitoh, S Masuda
Discrete Applied Mathematics 223, 120-134, 2017
202017
Swapping colored tokens on graphs
K Yamanaka, T Horiyama, D Kirkpatrick, Y Otachi, T Saitoh, R Uehara, ...
Workshop on Algorithms and Data Structures, 619-628, 2015
202015
Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs
J Kawahara, T Saitoh, H Suzuki, R Yoshinaka
Computational Intelligence in Information Systems: Proceedings of the …, 2017
192017
Complexity of the stamp folding problem
T Umesato, T Saitoh, R Uehara, H Ito
International Conference on Combinatorial Optimization and Applications, 311-321, 2011
192011
Swapping colored tokens on graphs
K Yamanaka, T Horiyama, JM Keil, D Kirkpatrick, Y Otachi, T Saitoh, ...
Theoretical Computer Science 729, 1-10, 2018
182018
The time complexity of permutation routing via matching, token swapping and a variant
J Kawahara, T Saitoh, R Yoshinaka
arXiv preprint arXiv:1612.02948, 2016
162016
Intersection dimension of bipartite graphs
S Chaplick, P Hell, Y Otachi, T Saitoh, R Uehara
Theory and Applications of Models of Computation: 11th Annual Conference …, 2014
152014
Some improvements on kumlander-s maximum weight clique extraction algorithm
S Shimizu, K Yamaguchi, T Saitoh, S Masuda
International Journal of Computer and Information Engineering 6 (12), 1776-1780, 2012
152012
Voronoi game on a path
M Kiyomi, T Saitoh, R Uehara
IEICE TRANSACTIONS on Information and Systems 94 (6), 1185-1189, 2011
142011
The system can't perform the operation now. Try again later.
Articles 1–20