{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:20:40Z","timestamp":1743063640444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_13","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"152-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Planar Graphs with Many Collinear Vertices"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-35261-4_45","volume-title":"Algorithms and Computation","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Binucci, C., Evans, W., Hurtado, F., Liotta, G., Mchedlidze, T., Meijer, H., Okamoto, Y.: Universal point subsets for planar graphs. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 423\u2013432. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-35261-4_45"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. 23(3), 303\u2013312 (2002)","journal-title":"Comput. Geom."},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s00454-008-9125-3","volume":"42","author":"P Bose","year":"2009","unstructured":"Bose, P., Dujmovi\u0107, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.R.: A polynomial bound for untangling geometric planar graphs. Discrete Comput. Geom. 42(4), 570\u2013585 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1137\/130924172","volume":"28","author":"J Cano","year":"2014","unstructured":"Cano, J., T\u00f3th, C.D., Urrutia, J.: Upper bound constructions for untangling planar geometric graphs. SIAM J. Discrete Math. 28(4), 1935\u20131943 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, N., Urrutia, J.: Straight line embeddings of planar graphs on point sets. In: Fiala, F., Kranakis, E., Sack, J. (eds.) 8th Canadian Conference on Computational Geometry (CCCG 1996), pp. 312\u2013318. Carleton University Press (1996)","DOI":"10.1515\/9780773591134-055"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2002.2113","volume":"86","author":"G Chen","year":"2002","unstructured":"Chen, G., Yu, X.: Long cycles in 3-connected graphs. J. Comb. Theory Ser. B 86(1), 80\u201399 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00454-009-9150-x","volume":"43","author":"J Cibulka","year":"2010","unstructured":"Cibulka, J.: Untangling polygons and graphs. Discrete Comput. Geom. 43(2), 402\u2013411 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR8","unstructured":"Da Lozzo, G., Dujmovi\u0107, V., Frati, F., Mchedlidze, T., Roselli, V.: Drawing planar graphs with many collinear vertices. CoRR abs\/1606.03890v3 (2016). http:\/\/arxiv.org\/abs\/1606.03890v3"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-27261-0_27","volume-title":"Graph Drawing and Network Visualization","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V.: The utility of untangling. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 321\u2013332. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-27261-0_27"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-662-45803-7_22","volume-title":"Graph Drawing","author":"W Evans","year":"2014","unstructured":"Evans, W., Kusters, V., Saumell, M., Speckmann, B.: Column planarity and partial simultaneous geometric embedding. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 259\u2013271. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45803-7_22"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s00454-008-9130-6","volume":"42","author":"X Goaoc","year":"2009","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom. 42(4), 542\u2013569 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points (solution to problem e3341). Am. Math. Mon. 98, 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0097-3165(73)90012-5","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B., Walther, H.: Shortness exponents of families of graphs. J. Comb. Theory Ser. A 14(3), 364\u2013385 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"8","key":"13_CR15","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.dam.2011.01.011","volume":"159","author":"M Kang","year":"2011","unstructured":"Kang, M., Pikhurko, O., Ravsky, A., Schacht, M., Verbitsky, O.: Untangling planar graphs from a specified vertex position - hard cases. Discrete Appl. Math. 159(8), 789\u2013799 (2011)","journal-title":"Discrete Appl. Math."},{"key":"13_CR16","unstructured":"Kratochv\u00edl, J., Vaner, M.: A note on planar partial 3-trees. CoRR abs\/1210.8113 (2012). http:\/\/arxiv.org\/abs\/1210.8113"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0012-365X(81)90239-9","volume":"36","author":"PJ Owens","year":"1981","unstructured":"Owens, P.J.: Non-hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons. Discrete Math. 36(2), 227\u2013230 (1981)","journal-title":"Discrete Math."},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00454-002-2889-y","volume":"28","author":"J Pach","year":"2002","unstructured":"Pach, J., Tardos, G.: Untangling a polygon. Discrete Comput. Geom. 28(4), 585\u2013592 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-25870-1_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Ravsky","year":"2011","unstructured":"Ravsky, A., Verbitsky, O.: On collinear sets in straight-line drawings. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 295\u2013306. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25870-1_27"},{"key":"13_CR21","unstructured":"Ravsky, A., Verbitsky, O.: On collinear sets in straight line drawings. CoRR abs\/0806.0253 (2011). http:\/\/arxiv.org\/abs\/0806.0253"},{"issue":"52","key":"13_CR22","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13(52), 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."}],"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-50106-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T06:20:10Z","timestamp":1692598810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","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":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}