Folgen
Yota Otachi
Yota Otachi
Nagoya University
Bestätigte E-Mail-Adresse bei nagoya-u.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
65*2014
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
502015
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
502015
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
502015
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, 1071-1104, 2017
482017
Depth-first search using bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
472014
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
322015
Subgraph isomorphism in graph classes
S Kijima, Y Otachi, T Saitoh, T Uno
Discrete Mathematics 312 (21), 3164-3173, 2012
302012
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
282021
On spanning tree congestion of graphs
K Kozawa, Y Otachi, K Yamazaki
Discrete mathematics 309 (13), 4215-4224, 2009
272009
Completely independent spanning trees in (partial) k-trees
M Matsushita, Y Otachi, T Araki
Discussiones Mathematicae Graph Theory 35 (3), 427-437, 2015
252015
Exact algorithms for the max-min dispersion problem
T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ...
Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou …, 2018
222018
Efficient Enumeration of Ordered Trees with k Leaves
K Yamanaka, Y Otachi, S Nakano
WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009
222009
Polynomial-time algorithm for sliding tokens on trees
ED Demaine, ML Demaine, E Fox-Epstein, DA Hoang, T Ito, H Ono, ...
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
212014
Random generation and enumeration of bipartite permutation graphs
T Saitoh, Y Otachi, K Yamanaka, R Uehara
Journal of Discrete Algorithms 10, 84-97, 2012
212012
Reconfiguration of cliques in a graph
T Ito, H Ono, Y Otachi
Theory and Applications of Models of Computation: 12th Annual Conference …, 2015
202015
Parameterized complexity of the spanning tree congestion problem
HL Bodlaender, FV Fomin, PA Golovach, Y Otachi, EJ van Leeuwen
Algorithmica 64, 85-111, 2012
202012
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
202007
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
192019
Swapping colored tokens on graphs
K Yamanaka, T Horiyama, D Kirkpatrick, Y Otachi, T Saitoh, R Uehara, ...
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
192015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20