Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Sorting permutations by tanspositions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the diameter of the symmetric group: polynomial bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the diameter of Eulerian orientations of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
Edit Distances and Factorisations of Even Permutations
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Hash functions and graphs with large girths
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithms for solving Rubik's cubes
ESA'11 Proceedings of the 19th European conference on Algorithms
String rearrangement metrics: a survey
Algorithms and Applications
Geometric-based sampling for permutation optimization
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 5.23 |