Author of the publication

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 graph tessellation cover number: extremal bounds, efficient algorithms and hardness., , , , , , , and . CoRR, (2017)On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions., , , and . BSB, volume 5167 of Lecture Notes in Computer Science, page 79-91. Springer, (2008)On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time., , , and . BSB, volume 8213 of Lecture Notes in Computer Science, page 126-135. Springer, (2013)Advancing the Transposition Distance and Diameter through Lonely Permutations., , , and . SIAM J. Discret. Math., 27 (4): 1682-1709 (2013)The tessellation problem of quantum walks., , , , , , , and . CoRR, (2017)Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions., , , and . SIAM J. Discret. Math., 24 (3): 792-807 (2010)QEDS: Um Simulador Clássico para Distinção de Elementos Quântico., , , and . RITA, 23 (2): 51-66 (2016)A new 1.375-approximation algorithm for sorting by transpositions., , , and . Algorithms Mol. Biol., 17 (1): 1 (2022)A computational complexity comparative study of graph tessellation problems., , , , , , and . Theor. Comput. Sci., (2021)A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case., and . COCOON, volume 13595 of Lecture Notes in Computer Science, page 212-219. Springer, (2022)