( en | de | ru )

 

Disambiguation of "de A. Hausen, Rodrigo"

Author of the publication

copydeleteadd this publication to your clipboard
Transposition Diameter and Lonely Permutations.

, , , and . BSB, volume 7409 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)

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.

Rodrigo De Lamare

A Tjeerd de Neef

Rodrigo A González-Fuente Rubilar

Annekristin Hausen

Christof Hausen

 

Other publications of authors with the same name

A note on the middle levels problem., , , , and . Discret. Appl. Math., (2016)Analysis and Implementation of Sorting by Transpositions Using Permutation Trees., , , , and . BSB, volume 6832 of Lecture Notes in Computer Science, page 42-49. Springer, (2011)Bounds on the Transposition Distance for Lonely Permutations., , and . BSB, volume 6268 of Lecture Notes in Computer Science, page 35-46. Springer, (2010)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)An attempt to lower the upper bound on the transposition diameter.. WOB, page 125-128. (2004)Transposition Diameter and Lonely Permutations., , , and . BSB, volume 7409 of Lecture Notes in Computer Science, page 1-12. Springer, (2012)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)Hamiltonian Cycles in Kneser Graphs for n=2k+2., , , , and . Electron. Notes Discret. Math., (2011)Advancing the Transposition Distance and Diameter through Lonely Permutations., , , and . SIAM J. Discret. Math., 27 (4): 1682-1709 (2013)