Yota Otachi
Yota Otachi
Verified email at - Homepage
Cited by
Cited by
Linear-time algorithm for sliding tokens on trees
ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ...
Theoretical Computer Science 600, 132-142, 2015
Extending partial representations of proper and unit interval graphs
P Klavík, J Kratochvíl, Y Otachi, I Rutter, T Saitoh, M Saumell, T Vyskočil
Scandinavian Workshop on Algorithm Theory, 253-264, 2014
Extending partial representations of interval graphs
P Klavík, J Kratochvíl, Y Otachi, T Saitoh, T Vyskočil
Algorithmica 78 (3), 945-967, 2017
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
Depth-first search using O(n) bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
International Symposium on Algorithms and Computation, 553-564, 2014
Sliding token on bipartite permutation graphs
E Fox-Epstein, DA Hoang, Y Otachi, R Uehara
Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65, 662-686, 2021
Subgraph isomorphism in graph classes
S Kijima, Y Otachi, T Saitoh, T Uno
Discrete Mathematics 312 (21), 3164-3173, 2012
Exploring the gap between treedepth and vertex cover through vertex integrity
T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Otachi
Theoretical Computer Science 918, 60-76, 2022
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
Completely independent spanning trees in (partial) k-trees
M Matsushita, Y Otachi, T Araki
Discussiones Mathematicae Graph Theory 35 (3), 427-437, 2015
On spanning tree congestion of graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete mathematics 309 (13), 4215-4224, 2009
Reconfiguration of cliques in a graph
T Ito, H Ono, Y Otachi
Theory and Applications of Models of Computation: 12th Annual Conference …, 2015
Random generation and enumeration of bipartite permutation graphs
T Saitoh, Y Otachi, K Yamanaka, R Uehara
Journal of Discrete Algorithms 10, 84-97, 2012
Efficient Enumeration of Ordered Trees with k Leaves
K Yamanaka, Y Otachi, S Nakano
WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009
Finding diverse trees, paths, and more
T Hanaka, Y Kobayashi, K Kurita, Y Otachi
Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3778-3786, 2021
On the classes of interval graphs of limited nesting and count of lengths
P Klavík, Y Otachi, J Šejnoha
Algorithmica 81 (4), 1490-1511, 2019
Safe sets in graphs: Graph classes and structural parameters
R Águeda, N Cohen, S Fujita, S Legay, Y Manoussakis, Y Matsui, ...
Journal of Combinatorial Optimization 36, 1221-1242, 2018
Polynomial-time algorithm for sliding tokens on trees
ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ...
International Symposium on Algorithms and Computation, 389-400, 2014
Parameterized complexity of the spanning tree congestion problem
HL Bodlaender, FV Fomin, PA Golovach, Y Otachi, EJ van Leeuwen
Algorithmica 64, 85-111, 2012
The system can't perform the operation now. Try again later.
Articles 1–20