{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:14Z","timestamp":1742914034955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_47","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"529-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rotation Distance for Rank Bounded Trees"],"prefix":"10.1007","author":[{"given":"S. K. M.","family":"Anoop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"2","key":"47_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7155\/jgaa.00212","volume":"14","author":"S Cleary","year":"2010","unstructured":"Cleary, S., John, K.S.: A linear-time approximation algorithm for rotation distance. J. Graph Algorithms Appl. 14(2), 385\u2013390 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ipl.2009.04.023","volume":"109","author":"S Cleary","year":"2009","unstructured":"Cleary, S., John, K.S.: Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109, 918\u2013922 (2009)","journal-title":"Inf. Process. Lett."},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-36065-7_13","volume-title":"WALCOM: Algorithms and Computation","author":"C Crespelle","year":"2013","unstructured":"Crespelle, C., Gambette, P.: Linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 126\u2013136. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36065-7_13"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","volume":"15","author":"K Culik","year":"1982","unstructured":"Culik, K., Wood, D.: A note on some tree similarity measures. Inf. Process. Lett. 15(1), 39\u201342 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"47_CR5","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1016\/j.aim.2009.09.016","volume":"223","author":"P Dehornoy","year":"2010","unstructured":"Dehornoy, P.: On the rotation distance between binary trees. Adv. Math. 223(4), 1316\u20131355 (2010)","journal-title":"Adv. Math."},{"issue":"3","key":"47_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","volume":"82","author":"A Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D.: Learning decision trees from random examples. Inf. Comput. 82(3), 231\u2013246 (1989)","journal-title":"Inf. Comput."},{"issue":"4","key":"47_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0196-6774(87)90048-4","volume":"8","author":"J Lucas","year":"1987","unstructured":"Lucas, J.: The rotation graph of binary trees is Hamiltonian. J. Algorithms 8(4), 503\u2013535 (1987)","journal-title":"J. Algorithms"},{"issue":"2","key":"47_CR8","doi-asserted-by":"publisher","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":"47_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.aim.2014.02.035","volume":"259","author":"L Pournin","year":"2014","unstructured":"Pournin, L.: The diameter of associahedra. Adv. Math. 259, 13\u201342 (2014)","journal-title":"Adv. Math."},{"doi-asserted-by":"crossref","unstructured":"Sleator, D., Tarjan, R., Thurston, W.: Rotation distance, triangulations, and hyperbolic geometry. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 122\u2013135 (1986)","key":"47_CR10","DOI":"10.1145\/12130.12143"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:06:21Z","timestamp":1680213981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}