{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:31:29Z","timestamp":1777433489929,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:00:00Z","timestamp":1562284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:00:00Z","timestamp":1562284800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00453-019-00602-8","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T10:03:02Z","timestamp":1562320982000},"page":"41-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Polynomial Sized Kernel for Tracking Paths Problem"],"prefix":"10.1007","volume":"82","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1648-288X","authenticated-orcid":false,"given":"Pratibha","family":"Choudhary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,5]]},"reference":[{"issue":"3","key":"602_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"602_CR2","first-page":"67","volume-title":"Lecture Notes in Computer Science","author":"Aritra Banik","year":"2017","unstructured":"Banik, A., Katz, M.J., Packer, E., Simakov, M.: Tracking paths. In: Algorithms and Complexity\u201410th International Conference, CIAC 2017, pp. 67\u201379 (2017)"},{"key":"602_CR3","doi-asserted-by":"crossref","unstructured":"Bhatti, S., Xu, J.: Survey of target tracking protocols using wireless sensor network. In: 2009 Fifth International Conference on Wireless and Mobile Communications, pp. 110\u2013115 (2009)","DOI":"10.1109\/ICWMC.2009.25"},{"key":"602_CR4","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, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, Berlin (2015)","edition":"1"},{"key":"602_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"602_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, R., Das, S.R.: Tracking moving targets in a smart sensor network. In: IEEE 58th Vehicular Technology Conference, vol.\u00a05, pp. 3035\u20133039 (2003)","DOI":"10.1109\/VETECF.2003.1286181"},{"issue":"191\u2013195","key":"602_CR7","first-page":"1","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars. Comb. 2(191\u2013195), 1 (1976)","journal-title":"Ars. Comb."},{"issue":"1","key":"602_CR8","doi-asserted-by":"crossref","first-page":"R30","DOI":"10.37236\/302","volume":"17","author":"C Hernando","year":"2010","unstructured":"Hernando, C., Mora, M., Pelayo, I.M., Seara, C., Wood, D.R.: Extremal graph theory for metric dimension and diameter. Electron. J. Comb. 17(1), R30 (2010)","journal-title":"Electron. J. Comb."},{"key":"602_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility Among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (1972)"},{"issue":"2","key":"602_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424\u2013435 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"602_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70(3), 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"602_CR12","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ipl.2014.05.001","volume":"114","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka, T., Pilipczuk, M.: Faster deterministic feedback vertex set. Inf. Process. Lett. 114(10), 556 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"602_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1216370.1216373","volume":"39","author":"T Peng","year":"2007","unstructured":"Peng, T., Leckie, C., Ramamohanarao, K.: Survey of network-based defense mechanisms countering the DoS and DDoS problems. ACM Comput. Surv. 39(1), 3 (2007)","journal-title":"ACM Comput. Surv."},{"issue":"549\u2013559","key":"602_CR14","first-page":"37","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congr. Numer. 14(549\u2013559), 37 (1975)","journal-title":"Congr. Numer."},{"issue":"4","key":"602_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/964723.383060","volume":"31","author":"AC Snoeren","year":"2001","unstructured":"Snoeren, A.C., Partridge, C., Sanchez, L.A., Jones, C.E., Tchakountio, F., Kent, S.T., Strayer, W.T.: Hash-based ip traceback. SIGCOMM Comput. Commun. Rev. 31(4), 3\u201314 (2001)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"2","key":"602_CR16","first-page":"32","volume":"6","author":"S Thomass\u00e9","year":"2010","unstructured":"Thomass\u00e9, S.: A $$4k^2$$ kernel for feedback vertex set. ACM Trans. Algorithms (TALG) 6(2), 32 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00602-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00602-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00602-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:09:16Z","timestamp":1593817756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00602-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["602"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00602-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,5]]},"assertion":[{"value":"27 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}