( en | de | ru )

 

Disambiguation of "Otachi, Yota"

Author of the publication

copydeleteadd this publication to your clipboard
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

, , , , , , , and . Theory Comput. Syst., 66 (2): 502-515 (2022)

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

Induced Minor Free Graphs: Isomorphism and Clique-width., , and . CoRR, (2016)Bounded Representations of Interval and Proper Interval Graphs., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 535-546. Springer, (2013)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)Finding Diverse Trees, Paths, and More., , , and . CoRR, (2020)A lower bound on opaque sets., , , and . Comput. Geom., (2019)Subgraph isomorphism in graph classes., , , and . Discret. Math., 312 (21): 3164-3173 (2012)Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity., , and . ISAAC, volume 64 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Exploring the gap between treedepth and vertex cover through vertex integrity., , , , and . Theor. Comput. Sci., (2022)Reconfiguring (non-spanning) arborescences., , , , , and . Theor. Comput. Sci., (2023)