{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:50:38Z","timestamp":1722559838675},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,22]],"date-time":"2012-07-22T00:00:00Z","timestamp":1342915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1201-z","type":"journal-article","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T13:30:20Z","timestamp":1342877420000},"page":"1207-1219","source":"Crossref","is-referenced-by-count":4,"title":["The Edge Rotation Graph"],"prefix":"10.1007","volume":"29","author":[{"given":"Javier","family":"Cano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9-Miguel","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Huemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,22]]},"reference":[{"issue":"3","key":"1201_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.comgeo.2004.12.010","volume":"37","author":"O. Aichholzer","year":"2007","unstructured":"Aichholzer O., Reinhardt K.: A quadratic distance bound on sliding between crossing-free spanning trees. Comput. Geom. Theory Appl. 37(3), 155\u2013161 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"1201_CR2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.comgeo.2008.04.001","volume":"42","author":"P. Bose","year":"2009","unstructured":"Bose P., Hurtado F.: Flips in planar graphs. Comput. Geom. Theory Appl. 42(1), 60\u201380 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1\u20133","key":"1201_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0012-365X(00)00092-3","volume":"223","author":"V. Estivill-Castro","year":"2000","unstructured":"Estivill-Castro V., Noy M., Urrutia J.: On the chromatic number of tree graphs. Discret. Math. 223(1\u20133), 363\u2013366 (2000)","journal-title":"Discret. Math."},{"key":"1201_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(95)00073-6","volume":"161","author":"W. Goddard","year":"1996","unstructured":"Goddard W., Swart H.C.: Distances between graphs under edge operations. Discret. Math. 161, 121\u2013132 (1996)","journal-title":"Discret. Math."},{"key":"1201_CR5","unstructured":"Hernando, C., Hurtado, F., Mora, M., Rivera-Campo, E.: Grafos de \u00e1rboles etiquetados y grafos de \u00e1rboles geom\u00e9tricos etiquetados. In: Proc. X Encuentros de Geometr\u00eda Computacional, pp. 13\u201319 (2003)"},{"key":"1201_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F. Hurtado","year":"1999","unstructured":"Hurtado F., Noy M., Urrutia J.: Flipping edges on triangulations. Discret. Comput. Geom. 22, 333\u2013346 (1999)","journal-title":"Discret. Comput. Geom."},{"key":"1201_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","volume":"3","author":"C.L. Lawson","year":"1972","unstructured":"Lawson C.L.: Transforming triangulations. Discret. Math. 3, 365\u2013372 (1972)","journal-title":"Discret. Math."},{"key":"1201_CR8","doi-asserted-by":"crossref","unstructured":"Lawson, C.L.: Software for C 1 surface interpolation. In: Mathematical Software III, pp. 161\u2013194 (1977)","DOI":"10.1016\/B978-0-12-587260-7.50011-X"},{"issue":"2","key":"1201_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/47.2.259","volume":"47","author":"J. Lucas","year":"2004","unstructured":"Lucas J.: Untangling binary trees via rotations. Comput. J. 47(2), 259\u2013269 (2004)","journal-title":"Comput. J."},{"key":"1201_CR10","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ipl.2010.04.022","volume":"110","author":"J. Lucas","year":"2010","unstructured":"Lucas J.: An improved kernel size for rotation distance in binary trees. Inf. Process. Lett. 110, 481\u2013484 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"3-4","key":"1201_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0020-0190(00)00008-9","volume":"73","author":"J. Pallo","year":"2000","unstructured":"Pallo J.: An efficient upper bound of the rotation distance of binary trees. Inf. Process. Lett. 73(3-4), 87\u201392 (2000)","journal-title":"Inf. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1201-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1201-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1201-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T12:07:44Z","timestamp":1561982864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1201-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,22]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1201"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1201-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,22]]}}}