{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:28Z","timestamp":1746438148289,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T00:00:00Z","timestamp":1665187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T00:00:00Z","timestamp":1665187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007296","name":"Infosys Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007296","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["819416"],"award-info":[{"award-number":["819416"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology, Ministry of Science and Technology","doi-asserted-by":"publisher","award":["DST\/SJF\/MSA01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/MSA01\/2017-18"]}],"id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Defence Service Organisation Singapore"},{"name":"NRF Fellowshhip for AI Grant","award":["R-252-000-B14-281"],"award-info":[{"award-number":["R-252-000-B14-281"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00453-022-01040-9","type":"journal-article","created":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T06:03:50Z","timestamp":1665209030000},"page":"3246-3275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial Kernel for Bipartite Permutation Vertex Deletion"],"prefix":"10.1007","volume":"84","author":[{"given":"Jan","family":"Derbisz","sequence":"first","affiliation":[]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[]},{"given":"Jayakrishnan","family":"Madathil","sequence":"additional","affiliation":[]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Shaily","family":"Verma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,8]]},"reference":[{"key":"1040_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Feedback vertex set inspired kernel for chordal vertex deletion. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1383\u20131398 (2017)","DOI":"10.1137\/1.9781611974782.90"},{"key":"1040_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Misra, P., Saurabh, S., Zehavi, M.: Interval vertex deletion admits a polynomial kernel. In: Chan, T.M. (ed.) Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1711\u20131730 (2019)","DOI":"10.1137\/1.9781611975482.103"},{"issue":"8","key":"1040_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"Hans L Bodlaender","year":"2009","unstructured":"Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"1040_CR4","unstructured":"Bozyk, L., Derbisz, J., Krawczyk, T., Novotn\u00e1, J., Okrasa, K.: Vertex deletion into bipartite permutation graphs. In: Cao, Y., Marcin, P. (eds.) 15th International Symposium on Parameterized and Exact Computation (IPEC), vol. 180  LIPIcs, pp. 1\u201316 (2020)"},{"key":"1040_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Van Bang, L., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"1040_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Saurabh, S.: Parameterized Algorithms. Springer-Verlag, Berlin (2015)"},{"key":"1040_CR7","doi-asserted-by":"crossref","unstructured":"Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 68\u201381 (2012)","DOI":"10.1137\/1.9781611973099.6"},{"issue":"4","key":"1040_CR8","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. J. ACM 61(4), 23:1-23:27 (2014)","journal-title":"J. ACM"},{"key":"1040_CR9","unstructured":"Diestel, R.: The Basics, vol. 173. In: Graph Theory, 4th edn. Graduate texts in mathematics. Springer, Berlin (2012)"},{"key":"1040_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"Rodney G Downey","year":"2013","unstructured":"Downey, Rodney G., Fellows, Michael R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer, London (2013)"},{"issue":"5","key":"1040_CR11","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/130927115","volume":"44","author":"Andrew Drucker","year":"2015","unstructured":"Drucker, Andrew: New limits to classical and quantum instance compression. SIAM J. Comput. 44(5), 1443\u20131479 (2015)","journal-title":"SIAM J. Comput."},{"key":"1040_CR12","volume-title":"Parameterized Complexity Theory","author":"J\u00f6rg Flum","year":"2006","unstructured":"Flum, J\u00f6rg., Grohe, Martin: Parameterized Complexity Theory. Springer-Verlag, Berlin (2006)"},{"issue":"4","key":"1040_CR13","doi-asserted-by":"publisher","first-page":"1964","DOI":"10.1137\/12089051X","volume":"27","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Saurabh, S., Villanger, Y.: A polynomial Kernel for proper interval vertex deletion. SIAM J. Discret. Math. 27(4), 1964\u20131976 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"1040_CR14","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar f-deletion: Approximation, kernelization and optimal FPT algorithms. In: 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 470\u2013479 (2012)","DOI":"10.1109\/FOCS.2012.62"},{"key":"1040_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1017\/CBO9781139177801.010","volume-title":"Tractability","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Saurabh, S.: Kernelization methods for fixed-parameter tractability. In: Tractability, pp. 260\u2013282. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"1040_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"Lance Fortnow","year":"2011","unstructured":"Fortnow, Lance, Santhanam, Rahul: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"1040_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0166-218X(98)00035-3","volume":"86","author":"T Fujito","year":"1998","unstructured":"Fujito, T.: A unified approximation algorithm for node-deletion problems. Discret. Appl. Math. 86, 213\u2013231 (1998)","journal-title":"Discret. Appl. Math."},{"key":"1040_CR18","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"issue":"1","key":"1040_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"3","key":"1040_CR20","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/s00453-014-9910-8","volume":"71","author":"D Hermelin","year":"2015","unstructured":"Hermelin, D., Kratsch, S., Soltys, K., Wahlstr\u00f6m, M., Xi, W.: A completeness theory for polynomial (Turing) kernelization. Algorithmica 71(3), 702\u2013730 (2015)","journal-title":"Algorithmica"},{"key":"1040_CR21","doi-asserted-by":"crossref","unstructured":"Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 104\u2013113, (2012)","DOI":"10.1137\/1.9781611973099.9"},{"key":"1040_CR22","doi-asserted-by":"crossref","unstructured":"Jansen, B.M.P., Pilipczuk, M.: Approximation and kernelization for chordal vertex deletion. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1399\u20131418, (2017)","DOI":"10.1137\/1.9781611974782.91"},{"key":"1040_CR23","unstructured":"Kanesh, L., Madathil, J., Sahu, A., Saurabh, S., Verma, S.: A polynomial kernel for bipartite permutation vertex deletion. In: 16th International Symposium on Parameterized and Exact Computation, (IPEC), vol. 214 of LIPIcs, pp. 23:1\u201323:18, (2021)"},{"key":"1040_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jcss.2018.01.001","volume":"95","author":"Y Ke","year":"2018","unstructured":"Ke, Y., Cao, Y., Ouyang, X., Li, W., Wang, J.: Unit interval vertex deletion: Fewer vertices are relevant. J. Comput. Syst. Sci. 95, 109\u2013121 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"1040_CR25","unstructured":"Kratsch, S.: Recent developments in kernelization: a survey. Bulletin of the European Association for Theoretical Computer Science, vol. 113 (2014)"},{"issue":"2","key":"1040_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"1040_CR27","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization\u2014preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond\u2014Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, pp. 129\u2013161 (2012)","DOI":"10.1007\/978-3-642-30891-8_10"},{"key":"1040_CR28","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960\u2013981 (1994)","journal-title":"J. ACM"},{"issue":"4","key":"1040_CR29","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747\u2013768 (2010)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"1040_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discret. Math."},{"key":"1040_CR31","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, vol. 31. Oxford University Press, Oxford (2006)"},{"issue":"3","key":"1040_CR32","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"JP Spinrad","year":"1987","unstructured":"Spinrad, J.P., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discret. Appl. Math. 18(3), 279\u2013292 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1040_CR33","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2007.02.010","volume":"103","author":"R Uehara","year":"2007","unstructured":"Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2), 71\u201377 (2007)","journal-title":"Inf. Process. Lett."},{"key":"1040_CR34","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion np-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC), pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01040-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01040-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01040-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T12:27:47Z","timestamp":1666700867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01040-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,8]]},"references-count":34,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1040"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01040-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,10,8]]},"assertion":[{"value":"12 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}