Genome rearrangements and sorting by reversals, FOCS, pp.148-157, 1993. ,
1.375-Approximation Algorithm for Sorting by Reversals, Lecture Notes in Computer Science, vol.2461, pp.200-210, 2002. ,
DOI : 10.1007/3-540-45749-6_21
URL : https://hal.archives-ouvertes.fr/in2p3-01192634
On Some Tighter Inapproximability Results (Extended Abstract) ,
DOI : 10.1007/3-540-48523-6_17
An (18/11)n upper bound for sorting by prefix reversals, Theoretical Computer Science, issue.36, pp.4103372-3390, 2009. ,
On average and highest number of flips in pancake sorting, Theoretical Computer Science, vol.412, issue.8-10, pp.822-834, 2011. ,
DOI : 10.1016/j.tcs.2010.11.028
On the problem of sorting burnt pancakes, Discrete Applied Mathematics, vol.61, issue.2, pp.105-120, 1995. ,
DOI : 10.1016/0166-218X(94)00009-3
A 2-Approximation Algorithm for Sorting by Prefix Reversals, Lecture Notes in Computer Science, vol.3669, pp.415-425, 2005. ,
DOI : 10.1007/11561071_38
Bounds for sorting by prefix reversal, Discrete Mathematics, vol.27, issue.1, pp.47-57, 1979. ,
DOI : 10.1016/0012-365X(79)90068-2
Transforming cabbage into turnip, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.178-189, 1995. ,
DOI : 10.1145/225058.225112
On sorting by prefix reversals and the diameter of pancake networks, Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use, pp.218-227, 1993. ,
DOI : 10.1007/3-540-56731-3_21
On the Diameter of the Pancake Network, Journal of Algorithms, vol.25, issue.1, pp.67-94, 1997. ,
DOI : 10.1006/jagm.1997.0874
Polynomial-time sortable stacks of burnt pancakes, Theoretical Computer Science, vol.412, issue.8-10, pp.695-702, 2011. ,
DOI : 10.1016/j.tcs.2010.11.004
URL : https://hal.archives-ouvertes.fr/hal-00728920