Author of the publication

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.

, , , and . J. Comput. Biol., 22 (11): 1044-1056 (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.

 

Other publications of authors with the same name

The tessellation problem of quantum walks., , , , , , , and . CoRR, (2017)Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems., and . J. Comput. Biol., 26 (11): 1214-1222 (2019)Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes., , , and . Inf. Process. Lett., (2022)A computational complexity comparative study of graph tessellation problems., , , , , , and . Theor. Comput. Sci., (2021)The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness., , , , , , and . Theor. Comput. Sci., (2020)Total tessellation cover and quantum walk., , , , , and . CoRR, (2020)The Tessellation Cover Number of Good Tessellable Graphs., , , , , , and . CoRR, (2019)Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently., and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 46-61. Springer, (2018)A Faster 1.375-Approximation Algorithm for Sorting by Transpositions., , , and . WABI, volume 8701 of Lecture Notes in Computer Science, page 26-37. Springer, (2014)On the computational complexity of closest genome problems., , , , and . Discret. Appl. Math., (2020)