S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, vol.38, issue.4, pp.555-566, 1989.
DOI : 10.1109/12.21148

V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science, pp.148-157, 1993.

V. Bafna and P. A. Pevzner, Genome Rearrangements and Sorting by Reversals, SIAM Journal on Computing, vol.25, issue.2, pp.272-289, 1996.
DOI : 10.1137/S0097539793250627

P. Berman, S. Hannenhalli, and M. Karpinski, 375-approximation algorithm for sorting by reversals, Proceedings of the 13th Annual European Symposium on Algorithms, pp.200-210, 2002.

P. Berman and M. Karpinski, On Some Tighter Inapproximability Results (Extended Abstract), Proceedings of the 26th International Colloquium on Automata, Languages and Programming, pp.200-209, 1999.
DOI : 10.1007/3-540-48523-6_17

L. Bulteau, G. Fertin, and I. Rusu, Pancake Flipping Is Hard, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, pp.247-258, 2012.
DOI : 10.1007/978-3-642-32589-2_24
URL : https://hal.archives-ouvertes.fr/hal-01053461

B. Chitturi, W. Fahle, Z. Meng, L. Morales, C. O. Shields et al., An (18/11)n upper bound for sorting by prefix reversals, Theoretical Computer Science, issue.36, pp.4103372-3390, 2009.

J. Cibulka, 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

D. Cohen and M. Blum, 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

H. Dweighter, J. E. Pseudonym, and . Goodman, Elementary problem e2569, American Mathematics Monthly, vol.82, issue.1, 1975.

J. Fischer and S. Ginzinger, A 2-Approximation Algorithm for Sorting by Prefix Reversals, Proceedings of the 13th Annual European Symposium on Algorithms, pp.415-425, 2005.
DOI : 10.1007/11561071_38

W. Gates and C. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics, vol.27, issue.1, pp.47-57, 1979.
DOI : 10.1016/0012-365X(79)90068-2

S. Hannenhalli and P. Pevzner, 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

S. Hannenhalli and P. A. Pevzner, Transforming cabbage into turnip, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.1-27, 1999.
DOI : 10.1145/225058.225112

M. Heydari and I. Sudborough, 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

M. Heydari and I. Sudborough, On the Diameter of the Pancake Network, Journal of Algorithms, vol.25, issue.1, pp.67-94, 1997.
DOI : 10.1006/jagm.1997.0874

A. Labarre and J. Cibulka, 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

K. Qiu, S. G. Akl, and H. Meijer, On some properties and algorithms for the star and pancake interconnection networks, Journal of Parallel and Distributed Computing, pp.16-25, 1994.

K. Qiu, H. Meijer, and S. G. , Parallel routing and sorting on the pancake network, Advances in Computing and Information ? ICCI '91, pp.360-371, 1991.
DOI : 10.1007/3-540-54029-6_184