{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T14:16:15Z","timestamp":1785161775666,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.disc.2026.115269","type":"journal-article","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T14:42:02Z","timestamp":1781188922000},"page":"115269","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A polynomial kernel for proper Helly circular-arc vertex deletion"],"prefix":"10.1016","volume":"349","author":[{"given":"Akanksha","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7046-0091","authenticated-orcid":false,"given":"Satyabrata","family":"Jana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115269_br0010","series-title":"LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Proceedings, Part II","first-page":"208","article-title":"A polynomial kernel for proper Helly circular-arc vertex deletion","volume":"vol. 14579","author":"Agrawal","year":"2024"},{"issue":"1","key":"10.1016\/j.disc.2026.115269_br0020","doi-asserted-by":"crossref","DOI":"10.1145\/3284356","article-title":"Feedback vertex set inspired kernel for chordal vertex deletion","volume":"15","author":"Agrawal","year":"2019","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.disc.2026.115269_br0030","series-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019","first-page":"1711","article-title":"Interval vertex deletion admits a polynomial kernel","author":"Agrawal","year":"2019"},{"issue":"8","key":"10.1016\/j.disc.2026.115269_br0040","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","article-title":"On problems without polynomial kernels","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.disc.2026.115269_br0050","series-title":"MFCS 2023","article-title":"Modification problems toward proper (Helly) circular-arc graphs","volume":"vol. 272","author":"Cao","year":"2023"},{"key":"10.1016\/j.disc.2026.115269_br0060","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.disc.2026.115269_br0070","article-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"2012"},{"key":"10.1016\/j.disc.2026.115269_br0080","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","article-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.disc.2026.115269_br0090","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.disc.2026.115269_br0100","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.dam.2012.12.021","article-title":"Structural results on circular-arc graphs and circle graphs: a survey and the main open problems","volume":"164","author":"Dur\u00e1n","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115269_br0110","series-title":"Texts in Theoretical Computer Science","article-title":"Parameterized complexity theory","author":"Flum","year":"2006"},{"issue":"4","key":"10.1016\/j.disc.2026.115269_br0120","doi-asserted-by":"crossref","first-page":"1964","DOI":"10.1137\/12089051X","article-title":"A polynomial kernel for proper interval vertex deletion","volume":"27","author":"Fomin","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115269_br0130","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"15","key":"10.1016\/j.disc.2026.115269_br0140","doi-asserted-by":"crossref","first-page":"3216","DOI":"10.1016\/j.dam.2009.07.002","article-title":"Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs","volume":"157","author":"Kaplan","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115269_br0150","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.jcss.2018.01.001","article-title":"Unit interval vertex deletion: fewer vertices are relevant","volume":"95","author":"Ke","year":"2018","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.disc.2026.115269_br0160","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is np-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"issue":"7\u20138","key":"10.1016\/j.disc.2026.115269_br0170","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1016\/j.dam.2012.11.005","article-title":"Normal Helly circular-arc graphs and its subclasses","volume":"161","author":"Lin","year":"2013","journal-title":"Discrete Appl. Math."},{"issue":"18","key":"10.1016\/j.disc.2026.115269_br0180","doi-asserted-by":"crossref","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","article-title":"Characterizations and recognition of circular-arc graphs and subclasses: a survey","volume":"309","author":"Lin","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115269_br0190","series-title":"COCOON 2006","first-page":"73","article-title":"Characterizations and linear time recognition of Helly circular-arc graphs","volume":"vol. 4112","author":"Lin","year":"2006"},{"issue":"4","key":"10.1016\/j.disc.2026.115269_br0200","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","article-title":"Chordal deletion is fixed-parameter tractable","volume":"57","author":"Marx","year":"2010","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.disc.2026.115269_br0210","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","article-title":"Linear-time recognition of circular-arc graphs","volume":"37","author":"McConnell","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/j.disc.2026.115269_br0220","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"issue":"9","key":"10.1016\/j.disc.2026.115269_br0230","doi-asserted-by":"crossref","first-page":"3803","DOI":"10.1007\/s00453-019-00599-0","article-title":"The parameterized complexity of cycle packing: indifference is not an issue","volume":"81","author":"Ramaswamy","year":"2019","journal-title":"Algorithmica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002931?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002931?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T13:35:46Z","timestamp":1785159346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0012365X26002931"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115269","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A polynomial kernel for proper Helly circular-arc vertex deletion","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115269","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115269"}}