{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:52:43Z","timestamp":1648702363691},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,6]],"date-time":"2014-08-06T00:00:00Z","timestamp":1407283200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11590-014-0776-0","type":"journal-article","created":{"date-parts":[[2014,8,4]],"date-time":"2014-08-04T22:24:59Z","timestamp":1407191099000},"page":"743-753","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Thick non-crossing paths in a polygonal domain"],"prefix":"10.1007","volume":"9","author":[{"given":"Maryam","family":"Tahmasbi","sequence":"first","affiliation":[]},{"given":"Narges","family":"Mirehi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,6]]},"reference":[{"issue":"3","key":"776_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.comgeo.2009.02.007","volume":"43","author":"EM Arkin","year":"2010","unstructured":"Arkin, E.M., Mitchell, J.S.B., Polishchuk, V.: Maximum thick paths in static and dynamic environments. Comput. Geom. Theory Appl. 43(3), 279\u2013294 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"key":"776_CR2","unstructured":"Bastert, O., Fekete, S.P.: Geometric wire routing. In: Technical Report No. 332, Zentrum fuer Angewandte Informatik (1998)"},{"key":"776_CR3","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. In: GD01, Revised Papers from the 9th International Symposium on Graph Drawing, London. Springer-Verlag, New York, pp. 162\u2013177 (2002)","DOI":"10.1007\/3-540-45848-4_14"},{"key":"776_CR4","doi-asserted-by":"crossref","unstructured":"Efrat, A., Kobourov, S., Stepp, M., Wenk, C.: Growing fat graphs. In: SCG 02: Proceedings of the 18th Annual Symposium on Computational Geometry. ACM Press, New York, pp. 277\u2013278 (2002)","DOI":"10.1145\/513400.513434"},{"key":"776_CR5","doi-asserted-by":"crossref","unstructured":"Erickson, J., Nayyer, A.: Shortest non-crossing walks in the plane. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011)","DOI":"10.1137\/1.9781611973082.25"},{"issue":"3","key":"776_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.comgeo.2011.09.003","volume":"45","author":"J Kim","year":"2012","unstructured":"Kim, J., Mitchell, J.S.B., Polishchuk, V., Yang, S., Zou, J.: Routing multi-class traffic flows in the plane. Comput. Geom. Theory Appl. 45(3), 99\u2013114 (2012)","journal-title":"Comput. Geom. Theory Appl."},{"key":"776_CR7","doi-asserted-by":"crossref","unstructured":"Melissaratos, E.A., Souvaine, D.L.: On solving geometric optimization problems using shortest paths. In: Proceedings of the 6th Annual ACM Symposium on Computational Geometry, pp. 350\u2013359 (1990)","DOI":"10.1145\/98524.98600"},{"key":"776_CR8","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science B.V., North-Holland (2000)"},{"key":"776_CR9","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Polishchuk, V.: Thick non-crossing paths and minimum-cost flows in polygonal domains. In: 23rd ACM Symposium on Computational Geometry, pp. 56\u201365 (2007)","DOI":"10.1145\/1247069.1247079"},{"issue":"6","key":"776_CR10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1142\/S0218195999000315","volume":"9","author":"E Papadopoulou","year":"1999","unstructured":"Papadopoulou, E.: K-pairs non-crossing shortest paths in a simple polygon. Comput. Geom. Appl. 9(6), 533\u2013552 (1999)","journal-title":"Comput. Geom. Appl."},{"key":"776_CR11","doi-asserted-by":"crossref","unstructured":"Polishchuk, V.: Thick non-crossing paths and minimum-cost flows in polygonal domains. Ph.D. thesis, Stony Brook University (2007)","DOI":"10.1145\/1247069.1247079"},{"key":"776_CR12","doi-asserted-by":"crossref","unstructured":"Takahashi, J., Suzuki, H., Nishizeki, T.: Algorithms for finding non-crossing paths with minimum total length in plane graphs. In: ISAAC, pp. 400\u2013409 (1992)","DOI":"10.1007\/3-540-56279-6_92"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0776-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0776-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0776-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T11:14:01Z","timestamp":1565694841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0776-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,6]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["776"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0776-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,6]]}}}