{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:53:01Z","timestamp":1743083581684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_18","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"247-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum-Link C-Oriented Paths Visiting a\u00a0Sequence of\u00a0Regions in\u00a0the\u00a0Plane"],"prefix":"10.1007","author":[{"given":"Kerem","family":"Geva","sequence":"first","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Packer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alatartsev, S., Mersheeva, V., Augustine, M., Ortmeier, F.: On optimizing a sequence of robotic tasks. In: 2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 217\u2013223. IEEE (2013)","DOI":"10.1109\/IROS.2013.6696356"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10846-015-0190-6","volume":"80","author":"S Alatartsev","year":"2015","unstructured":"Alatartsev, S., Stellmacher, S., Ortmeier, F.: Robotic task sequencing problem: a survey. J. Intell. Robot. Syst. 80, 279\u2013298 (2015)","journal-title":"J. Intell. Robot. Syst."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: 2003 Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 473\u2013482. ACM (2003)","DOI":"10.1145\/780542.780612"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(91)90065-5","volume":"31","author":"P Egyed","year":"1991","unstructured":"Egyed, P., Wenger, R.: Ordered stabbing of pairwise disjoint convex sets in linear time. Discret. Appl. Math. 31(2), 133\u2013140 (1991)","journal-title":"Discret. Appl. Math."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Geva, K., Katz, M.J., Mitchell, J.S.B., Packer, E.: Minimum-link $$C$$-oriented paths visiting a sequence of regions in the plane. CoRR, abs\/2302.06776 (2023)","DOI":"10.1007\/978-3-031-30448-4_18"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0218195993000257","volume":"3","author":"LJ Guibas","year":"1993","unstructured":"Guibas, L.J., Hershberger, J., Mitchell, J.S.B., Snoeyink, J.: Approximating polygons and subdivisions with minimum link paths. Int. J. Comput. Geometry Appl. 3(4), 383\u2013415 (1993)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195911003524","volume":"21","author":"M L\u00f6ffler","year":"2011","unstructured":"L\u00f6ffler, M.: Existence and computation of tours through imprecise points. Int. J. Comput. Geomet. Appl. 21(1), 1\u201324 (2011)","journal-title":"Int. J. Comput. Geomet. Appl."},{"key":"18_CR8","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., T\u00f3th, C., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn., chap. 31, pp. 811\u2013848. Chapman & Hall\/CRC, Boca Raton (2017)"},{"issue":"6","key":"18_CR9","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.comgeo.2013.12.005","volume":"47","author":"JSB Mitchell","year":"2014","unstructured":"Mitchell, J.S.B., Polishchuk, V., Sysikaski, M.: Minimum-link paths revisited. Comput. Geomet. 47(6), 651\u2013667 (2014)","journal-title":"Comput. Geomet."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48447-7_2","volume-title":"Algorithms and Data Structures","author":"G Neyer","year":"1999","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13\u201324. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48447-7_2"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comgeo.2017.10.005","volume":"67","author":"B Speckmann","year":"2018","unstructured":"Speckmann, B., Verbeek, K.: Homotopic $$C$$-oriented routing with few links and thick edges. Comput. Geom. 67, 11\u201328 (2018)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:04:23Z","timestamp":1684191863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}