{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:30:17Z","timestamp":1742394617240},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ipl.2023.106381","type":"journal-article","created":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T17:01:22Z","timestamp":1676912482000},"page":"106381","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["An improved kernel for the flip distance problem on simple convex polygons"],"prefix":"10.1016","volume":"182","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8647-6928","authenticated-orcid":false,"given":"Miguel","family":"Bosch-Calvo","sequence":"first","affiliation":[]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2023.106381_br0010","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s00454-015-9709-7","article-title":"Flip distance between triangulations of a simple polygon is NP-complete","volume":"54","author":"Aichholzer","year":"2015","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/j.ipl.2023.106381_br0020","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1137\/050646354","article-title":"Parametric duality and kernelization: lower bounds and upper bounds on kernel size","volume":"37","author":"Chen","year":"2007","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2023.106381_br0030","article-title":"A linear-time approximation algorithm for rotation distance","volume":"14","author":"Cleary","year":"2009","journal-title":"J. Graph Algorithms Appl."},{"issue":"16","key":"10.1016\/j.ipl.2023.106381_br0040","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.ipl.2009.04.023","article-title":"Rotation distance is fixed-parameter tractable","volume":"109","author":"Cleary","year":"2009","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.ipl.2023.106381_br0050","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90083-7","article-title":"A note on some tree similarity measures","volume":"15","author":"Culik","year":"1982","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ipl.2023.106381_br0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2021.104708","article-title":"An improved FPT algorithm for the flip distance problem","author":"Feng","year":"2021","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ipl.2023.106381_br0070","series-title":"Kernelization: Theory of Parameterized Preprocessing","author":"Fomin","year":"2019"},{"issue":"3","key":"10.1016\/j.ipl.2023.106381_br0080","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","article-title":"Graph of triangulations of a convex polygon and tree of triangulations","volume":"13","author":"Hurtado","year":"1999","journal-title":"Comput. Geom."},{"key":"10.1016\/j.ipl.2023.106381_br0090","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00454-017-9867-x","article-title":"Computing the flip distance between triangulations","volume":"58","author":"Kanj","year":"2017","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.ipl.2023.106381_br0100","author":"Li"},{"issue":"2","key":"10.1016\/j.ipl.2023.106381_br0110","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/47.2.259","article-title":"Untangling binary trees via rotations","volume":"47","author":"Lucas","year":"2004","journal-title":"Comput. J."},{"issue":"12","key":"10.1016\/j.ipl.2023.106381_br0120","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ipl.2010.04.022","article-title":"An improved kernel size for rotation distance in binary trees","volume":"110","author":"Lucas","year":"2010","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/j.ipl.2023.106381_br0130","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0020-0190(00)00008-9","article-title":"An efficient upper bound of the rotation distance of binary trees","volume":"73","author":"Pallo","year":"2000","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/j.ipl.2023.106381_br0140","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0894-0347-1988-0928904-4","article-title":"Rotation distance, triangulations, and hyperbolic geometry","volume":"1","author":"Sleator","year":"1988","journal-title":"J. Am. Math. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T15:39:37Z","timestamp":1684251577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019023000248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":14,"alternative-id":["S0020019023000248"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106381","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved kernel for the flip distance problem on simple convex polygons","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106381","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"106381"}}