{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:24:04Z","timestamp":1725524644322},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_15","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"145-156","source":"Crossref","is-referenced-by-count":2,"title":["Topological Morphing of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Pier Francesco","family":"Cortese","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Angelini, P., Cortese, P.F., Di Battista, G., Patrignani, M.: Topological morphing of planar graphs. Tech. Report RT-DIA-134-2008, Dept. of Computer Sci., Univ. di Roma Tre (2008)","key":"15_CR1","DOI":"10.1007\/978-3-642-00219-9_15"},{"unstructured":"Auyeung, A., Abraham, A.: Estimating genome reversal distance by genetic algorithm. CoRR cs.AI\/0405014 (2004)","key":"15_CR2"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"C. Bachmaier","year":"2004","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Track planarity testing and embedding. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 3\u201317. Springer, Heidelberg (2004)"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology\u00a08(5), 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"issue":"8","key":"15_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11618058_2","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2006","unstructured":"Biedl, T.C., Lubiw, A., Spriggs, M.J.: Morphing planar graphs while preserving edge directions. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 13\u201324. Springer, Heidelberg (2006)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2307\/2304300","volume":"51","author":"S.S. Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. American Math. Monthly\u00a051, 247\u2013252 (1944)","journal-title":"American Math. Monthly"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/267521.267531","volume-title":"RECOMB 1997: Proceedings of the first annual international conference on Computational molecular biology","author":"A. Caprara","year":"1997","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: RECOMB 1997: Proceedings of the first annual international conference on Computational molecular biology, pp. 75\u201383. ACM Press, New York (1997)"},{"unstructured":"de Fraysseix, H., Ossona de Mendez, P.: P.I.G.A.L.E - Public Implementation of a Graph Algorithm Library and Editor, sourceForge project page, http:\/\/sourceforge.net\/projects\/pigale","key":"15_CR9"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025, 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-24595-7_30","volume-title":"Graph Drawing","author":"C. Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Pitta, C.: Intersection-free morphing of planar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 320\u2013331. Springer, Heidelberg (2004)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0377-0427(98)00202-7","volume":"101","author":"M. Floater","year":"1999","unstructured":"Floater, M., Gotsman, C.: How to morph tilings injectively. Journal of Computational and Applied Mathematics\u00a0101, 117\u2013129 (1999)","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0097-8493(00)00108-4","volume":"25","author":"C. Gotsman","year":"2001","unstructured":"Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Computers and Graphics\u00a025, 67\u201375 (2001)","journal-title":"Computers and Graphics"},{"doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. In: SODA 1997, pp. 344\u2013351 (1997)","key":"15_CR14","DOI":"10.1145\/267521.267544"},{"key":"15_CR15","first-page":"222","volume-title":"SODA 2006","author":"A. Lubiw","year":"2006","unstructured":"Lubiw, A., Petrick, M., Spriggs, M.: Morphing orthogonal planar graph drawings. In: SODA 2006, pp. 222\u2013230. ACM Press, New York (2006)"},{"unstructured":"Meidanis, J., Walter, M., Dias, Z.: Reversal distance of sorting circular chromosomes. Tech. Report IC-00-23, Institute of Computing, Universidade Estadual de Campinas (2000)","key":"15_CR16"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-45078-8_28","volume-title":"Algorithms and Data Structures","author":"A. Solomon","year":"2003","unstructured":"Solomon, A., Sutcliffe, P., Lister, R.: Sorting circular permutations by reversal. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 319\u2013328. Springer, Heidelberg (2003)"},{"issue":"6-7","key":"15_CR18","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.F.: Advances on sorting by reversals. Discrete Appl. Math.\u00a0155(6-7), 881\u2013888 (2007)","journal-title":"Discrete Appl. Math."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(83)90038-2","volume":"34","author":"C. Thomassen","year":"1983","unstructured":"Thomassen, C.: Deformations of plane graphs. Journal of Combinatorial Theory, Series B\u00a034, 244\u2013257 (1983)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:55Z","timestamp":1558109215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}