{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:43Z","timestamp":1725678103072},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_52","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"560-571","source":"Crossref","is-referenced-by-count":1,"title":["Improved FPT Algorithms for Rectilinear k-Links Spanning Path"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jinyi","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"52_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"D.T. Lee","year":"1996","unstructured":"Lee, D.T., Yang, C.D., Wong, C.K.: Rectilinear Paths among Rectilinear Obstacles. Discrete Applied Mathematics\u00a070(3), 185\u2013215 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"52_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0020-0190(02)00502-1","volume":"86","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Mitchell, J., Piatko, C.D.: Minimum-link watchman tours. Inf. Process. Lett.\u00a086(4), 203\u2013207 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"52_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00454-008-9127-1","volume":"41","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., Valtr, P.: Traversing a Set of Points with a Minimum Number of Turns. Discrete & Computational Geometry\u00a041(4), 513\u2013532 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Lee, D.T., Chen, T.H., Yang, C.: Shortest Rectilinear Paths among Weighted Obstacles. In: Proc. Symposium on Computational Geometry, pp. 301\u2013310 (1990)","DOI":"10.1145\/98524.98595"},{"issue":"3","key":"52_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S0218195992000172","volume":"2","author":"M. Berg","year":"1992","unstructured":"Berg, M., Kreveld, M.J., Nilsson, B.J., Overmars, M.H.: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl.\u00a02(3), 287\u2013309 (1992)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-45071-8_47","volume-title":"Proc. 9th Annual International Computing and Combinatorics Conference (COCOON 2003","author":"M.J. Collins","year":"2003","unstructured":"Collins, M.J.: Covering a Set of Points with a Minimum Number of Turns. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 467\u2013474. Springer, Heidelberg (2003)"},{"issue":"3","key":"52_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"E.M. Arkin","year":"2005","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J., Sethia, S.: Optimal Covering Tours with Turn Costs. SIAM J. Comput.\u00a035(3), 531\u2013566 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"52_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics\u00a030(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"52_CR9","first-page":"622","volume":"16","author":"V. Estivill-Castro","year":"2010","unstructured":"Estivill-Castro, V., Heednacram, A., Suraweera, F.: NP-completeness and FPT Results for Rectilinear Covering Problems. J. UCS\u00a016(5), 622\u2013652 (2010)","journal-title":"J. UCS"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Kuo, S., Fuchs, W.K.: Efficient spare allocation in reconfigurable arrays. In: DAC, pp. 385\u2013390 (1986)","DOI":"10.1145\/318013.318075"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/3-540-45022-X_53","volume-title":"Automata, Languages and Programming","author":"V.S.A. Kumar","year":"2000","unstructured":"Kumar, V.S.A., Arya, S., Ramesh, H.: Hardness of Set Cover with Intersection 1. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 624\u2013635. Springer, Heidelberg (2000)"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11758471_4","volume-title":"Algorithms and Complexity","author":"M. Grantson","year":"2006","unstructured":"Grantson, M., Levcopoulos, C.: Covering a Set of Points with a Minimum Number of Lines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 6\u201317. Springer, Heidelberg (2006)"},{"issue":"44-46","key":"52_CR13","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1016\/j.tcs.2010.08.012","volume":"411","author":"J. Wang","year":"2010","unstructured":"Wang, J., Li, W., Chen, J.: A parameterized algorithm for the hyperplane-cover problem. Theor. Comput. Sci.\u00a0411(44-46), 4005\u20134009 (2010)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:05Z","timestamp":1620127385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}