| 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 | 62 | 2015 |
| 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 | 59 | 2017 |
| 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 subclasses of chordal graphs P Klavík, J Kratochvíl, Y Otachi, T Saitoh Theoretical Computer Science 576, 85-101, 2015 | 57 | 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 | 54 | 2014 |
| 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 | 40 | 2021 |
| 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 | 40 | 2015 |
| Subgraph isomorphism in graph classes S Kijima, Y Otachi, T Saitoh, T Uno Discrete Mathematics 312 (21), 3164-3173, 2012 | 39 | 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 | 37 | 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 | 32 | 2018 |
| 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 | 30 | 2021 |
| On spanning tree congestion of graphs K Kozawa, Y Otachi, K Yamazaki Discrete Mathematics 309 (13), 4215-4224, 2009 | 30 | 2009 |
| Completely independent spanning trees in (partial) k-trees M Matsushita, Y Otachi, T Araki Discussiones Mathematicae Graph Theory 35 (3), 427-437, 2015 | 29 | 2015 |
| Reconfiguration of cliques in a graph T Ito, H Ono, Y Otachi Theory and Applications of Models of Computation: 12th Annual Conference …, 2015 | 28 | 2015 |
| Grundy distinguishes treewidth from pathwidth R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi SIAM Journal on Discrete Mathematics 36 (3), 1761-1787, 2022 | 26 | 2022 |
| 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 | 26 | 2014 |
| Random generation and enumeration of bipartite permutation graphs T Saitoh, Y Otachi, K Yamanaka, R Uehara Journal of Discrete Algorithms 10, 84-97, 2012 | 26 | 2012 |
| Computing diverse shortest paths efficiently: A theoretical and experimental study T Hanaka, Y Kobayashi, K Kurita, SW Lee, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3758-3766, 2022 | 25 | 2022 |
| 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 | 25 | 2019 |
| Efficient Enumeration of Ordered Trees with k Leaves K Yamanaka, Y Otachi, S Nakano WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009 | 25 | 2009 |
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyVerified email at jaist.ac.jp
