PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Ono, Hirotaka"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the path-distance-width for AT-free graphs and graphs in related classes.

, , , , , , , and . Discrete Applied Mathematics, (2014)

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 Ono, Hirotaka
add a person with the name Ono, Hirotaka
 

Other publications of authors with the same name

Approximability of minimum certificate dispersal with tree structures., , , and . Theor. Comput. Sci., (2015)Linear-time algorithm for sliding tokens on trees., , , , , , , , and . Theor. Comput. Sci., (2015)Graph Orientations Optimizing the Number of Light or Heavy Vertices., , , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 332-343. Springer, (2012)A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions., , , and . DNA, volume 3892 of Lecture Notes in Computer Science, page 359-370. Springer, (2005)Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints., , , , and . DNA, volume 5347 of Lecture Notes in Computer Science, page 168-178. Springer, (2008)Parameterized Complexity of Safe Set., , , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 38-49. Springer, (2019)Space-Efficient Algorithms for Longest Increasing Subsequence., , , , and . STACS, volume 96 of LIPIcs, page 44:1-44:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Maximum Domination Problem., and . CATS, volume 119 of CRPIT, page 55-62. Australian Computer Society, (2011)Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks., , , and . ISPA, volume 4330 of Lecture Notes in Computer Science, page 39-50. Springer, (2006)Drawing Borders Efficiently., , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 213-226. Springer, (2007)