{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:54:35Z","timestamp":1757620475461,"version":"3.44.0"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032002808"},{"type":"electronic","value":"9783032002815"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_19","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:23Z","timestamp":1754825903000},"page":"325-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Find Routes on\u00a0a\u00a0Doughnut"],"prefix":"10.1007","author":[{"given":"Yasuko","family":"Matsui","sequence":"first","affiliation":[]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A radial adaptation of the sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graph. 13, 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossing in drawing bipartite graphs. Algorithmica 11, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","volume":"2","author":"S Even","year":"1981","unstructured":"Even, S., Goldreich, O.: The minimum-length generator sequence problem is NP-hard. J. Algorithms 2(3), 311\u2013313 (1981)","journal-title":"J. Algorithms"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discret. Meth. 4, 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discret. Meth."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"M Jerrum","year":"1985","unstructured":"Jerrum, M.: The complexity of finding minimum-length generator sequences. Theor. Comput. Sci. 36, 265\u2013289 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2016.06.006","volume":"116","author":"A Zuylen","year":"2016","unstructured":"Zuylen, A., Bieron, J., Schalekamp, F., Yu, G.: A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Inf. Proc. Let. 116, 718\u2013722 (2016)","journal-title":"Inf. Proc. Let."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T08:42:53Z","timestamp":1757320973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}