Author of the publication

The Tandem Duplication Distance Is NP-Hard.

, , and . STACS, volume 154 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Dispersing and Grouping Points on Segments in the Plane., , , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 340-351. Springer, (2020)A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications., , , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 26-38. Springer, (2018)A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations., , , and . FAW, volume 8497 of Lecture Notes in Computer Science, page 128-140. Springer, (2014)Polynomial Time Algorithms for Three-Label Point Labeling., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 191-200. Springer, (2001)Following a curve with the discrete Fréchet distance., and . Theor. Comput. Sci., (2014)On the approximability of the exemplar adjacency number problem for genomes with gene repetitions., , , , , , , , and . Theor. Comput. Sci., (2014)Preface., and . Theor. Comput. Sci., 325 (3): 345-346 (2004)Scaffold Filling under the Breakpoint and Related Distances., , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 9 (4): 1220-1229 (2012)Intermittent Map Matching with the Discrete Fréchet Distance., and . CoRR, (2014)A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs., , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 92-101. Springer, (2016)