Rodrigo de A. Hausen

Orcid: 0000-0001-5189-6546

According to our database1, Rodrigo de A. Hausen authored at least 13 papers between 2004 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
A note on the middle levels problem.
Discret. Appl. Math., 2016

2015
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.
J. Comput. Biol., 2015

On Hamiltonian Cycles in Kneser Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Advancing the Transposition Distance and Diameter through Lonely Permutations.
SIAM J. Discret. Math., 2013

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2013

2012
Transposition Diameter and Lonely Permutations.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

2011
Hamiltonian Cycles in Kneser Graphs for n=2k+2.
Electron. Notes Discret. Math., 2011

Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

2010
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.
SIAM J. Discret. Math., 2010

Bounds on the Transposition Distance for Lonely Permutations.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2010

2008
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2008

2004
An attempt to lower the upper bound on the transposition diameter.
Proceedings of the III Brazilian Workshop on Bioinformatics, 2004


  Loading...