{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:28:25Z","timestamp":1760441305902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_10","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Igamberdiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-03841-4_11","volume-title":"Graph Drawing","author":"N Aerts","year":"2013","unstructured":"Aerts, N., Felsner, S.: Straight line triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 119\u2013130. Springer, Heidelberg (2013)"},{"key":"10_CR2","first-page":"194","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.: Drawings of planar graphs with few slopes and segments. CGTA 38, 194\u2013212 (2007)","journal-title":"CGTA"},{"unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: Proceedings of 26th CCCG, pp. 40\u201345 (2014)","key":"10_CR3"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.7155\/jgaa.00295","volume":"17","author":"S Durocher","year":"2013","unstructured":"Durocher, S., Mondal, D., Nishat, R., Whitesides, S.: A note on minimum-segment drawings of planar graphs. J. Graph Algorithm Appl. 17(3), 301\u2013328 (2013)","journal-title":"J. Graph Algorithm Appl."},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex Polytopes (Graduate Texts in Math)","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes (Graduate Texts in Math), 2nd edn. Springer-Verlag, New York (2003)","edition":"2"},{"issue":"1\u20132","key":"10_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comgeo.2004.07.003","volume":"31","author":"R Haas","year":"2005","unstructured":"Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D.L., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1\u20132), 31\u201361 (2005)","journal-title":"Comput. Geom."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10878-011-9390-6","volume":"25","author":"D Mondal","year":"2013","unstructured":"Mondal, D., Nishat, R., Biswas, S., Rahman, S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Opt. 25, 460\u2013480 (2013)","journal-title":"J. Comb. Opt."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-45043-3_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Schulz","year":"2013","unstructured":"Schulz, A.: Drawing graphs with few arcs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 406\u2013417. Springer, Heidelberg (2013)"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook of Graph Drawing and Visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T22:48:43Z","timestamp":1599864523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}