( en | de | ru )

 

Disambiguation of "Otachi, Yota"

Author of the publication

copydeleteadd this publication to your clipboard
Linear-time algorithm for sliding tokens on trees.

, , , , , , , , and . Theor. Comput. Sci., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Otachi, Yota
add a person with the name Otachi, Yota
 

Other publications of authors with the same name

A lower bound on opaque sets., , , and . Comput. Geom., (2019)Bounded Representations of Interval and Proper Interval Graphs., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 535-546. Springer, (2013)Induced Minor Free Graphs: Isomorphism and Clique-width., , and . CoRR, (2016)Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 141-150. Springer, (2009)Linear-Time Recognition of Double-Threshold Graphs., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 286-297. Springer, (2020)Independent Set Reconfiguration Parameterized by Modular-Width., , , , and . Algorithmica, 82 (9): 2586-2605 (2020)Parameterized Complexity of Graph Burning., and . Algorithmica, 84 (8): 2379-2393 (2022)Reconfiguring (non-spanning) arborescences., , , , , and . Theor. Comput. Sci., (2023)Exploring the gap between treedepth and vertex cover through vertex integrity., , , , and . Theor. Comput. Sci., (2022)Random generation and enumeration of bipartite permutation graphs., , , and . J. Discrete Algorithms, (2012)