Seguir
Yota Otachi
Yota Otachi
Dirección de correo verificada de nagoya-u.jp - Página principal
Título
Citado por
Citado por
Año
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
59*2014
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
Algorithmica 77 (4), 1071-1104, 2017
482017
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
462015
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
462015
Depth-First Search Using Bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
International Symposium on Algorithms and Computation, 553-564, 2014
462014
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
452015
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
292017
Sliding token on bipartite permutation graphs
E Fox-Epstein, DA Hoang, Y Otachi, R Uehara
International Symposium on Algorithms and Computation, 237-247, 2015
292015
Subgraph isomorphism in graph classes
S Kijima, Y Otachi, T Saitoh, T Uno
Discrete Mathematics 312 (21), 3164-3173, 2012
272012
On spanning tree congestion of graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete mathematics 309 (13), 4215-4224, 2009
262009
Completely independent spanning trees in (partial) k-trees.
M Matsushita, Y Otachi, T Araki
Discussiones Mathematicae: Graph Theory 35 (3), 2015
242015
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
192014
Parameterized complexity of the spanning tree congestion problem
HL Bodlaender, FV Fomin, PA Golovach, Y Otachi, EJ van Leeuwen
Algorithmica 64 (1), 85-111, 2012
192012
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Y Otachi, Y Okamoto, K Yamazaki
Discrete Applied Mathematics 155 (17), 2383-2390, 2007
192007
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65 (4), 662-686, 2021
182021
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
182018
Reconfiguration of cliques in a graph
T Ito, H Ono, Y Otachi
International Conference on Theory and Applications of Models of Computation …, 2015
182015
Random generation and enumeration of bipartite permutation graphs
T Saitoh, Y Otachi, K Yamanaka, R Uehara
Journal of Discrete Algorithms 10, 84-97, 2012
182012
Security number of grid-like graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete applied mathematics 157 (11), 2555-2561, 2009
182009
Efficient Enumeration of Ordered Trees with k Leaves
K Yamanaka, Y Otachi, S Nakano
International Workshop on Algorithms and Computation, 141-150, 2009
182009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20