{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:13Z","timestamp":1772893033762,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642325885","type":"print"},{"value":"9783642325892","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_24","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"247-258","source":"Crossref","is-referenced-by-count":18,"title":["Pancake Flipping Is Hard"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. In: FOCS, pp. 148\u2013157. IEEE (1993)","DOI":"10.1109\/SFCS.1993.366872"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms - ESA 2002","author":"P. Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-Approximation Algorithm for Sorting by Reversals. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 200\u2013210. Springer, Heidelberg (2002)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results (Extended Abstract). In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 200\u2013209. Springer, Heidelberg (1999)"},{"issue":"36","key":"24_CR4","doi-asserted-by":"publisher","first-page":"3372","DOI":"10.1016\/j.tcs.2008.04.045","volume":"410","author":"B. Chitturi","year":"2009","unstructured":"Chitturi, B., Fahle, W., Meng, Z., Morales, L., Shields, C.O., Sudborough, I., Voit, W.: An (18\/11)n upper bound for sorting by prefix reversals. Theoretical Computer Science\u00a0410(36), 3372\u20133390 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"8-10","key":"24_CR5","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/j.tcs.2010.11.028","volume":"412","author":"J. Cibulka","year":"2011","unstructured":"Cibulka, J.: On average and highest number of flips in pancake sorting. Theoretical Computer Science\u00a0412(8-10), 822\u2013834 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"D. Cohen","year":"1995","unstructured":"Cohen, D., Blum, M.: On the problem of sorting burnt pancakes. Discrete Applied Mathematics\u00a061(2), 105\u2013120 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR7","unstructured":"Dweighter, H. American Mathematics Monthly, 82(1) (1975): (pseudonym of Goodman, J.E.)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11561071_38","volume-title":"Algorithms \u2013 ESA 2005","author":"J. Fischer","year":"2005","unstructured":"Fischer, J., Ginzinger, S.: A 2-Approximation Algorithm for Sorting by Prefix Reversals. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 415\u2013425. Springer, Heidelberg (2005)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W. Gates","year":"1979","unstructured":"Gates, W., Papadimitriou, C.: Bounds for sorting by prefix reversal. Discrete Mathematics\u00a027(1), 47\u201357 (1979)","journal-title":"Discrete Mathematics"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: STOC, pp. 178\u2013189. ACM (1995)","DOI":"10.1145\/225058.225112"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Heydari, M., Sudborough, I.: On Sorting by Prefix Reversals and the Diameter of Pancake Networks. In: Meyer auf der Heide, F., Rosenberg, A.L., Monien, B. (eds.) Heinz Nixdorf Symposium 1992. LNCS, vol.\u00a0678, pp. 218\u2013227. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-56731-3_21"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1997.0874","volume":"25","author":"M. Heydari","year":"1997","unstructured":"Heydari, M., Sudborough, I.: On the diameter of the pancake network. Journal of Algorithms\u00a025(1), 67\u201394 (1997)","journal-title":"Journal of Algorithms"},{"issue":"8-10","key":"24_CR13","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.tcs.2010.11.004","volume":"412","author":"A. Labarre","year":"2011","unstructured":"Labarre, A., Cibulka, J.: Polynomial-time sortable stacks of burnt pancakes. Theoretical Computer Science\u00a0412(8-10), 695\u2013702 (2011)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T11:21:33Z","timestamp":1743938493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}