{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:13Z","timestamp":1740109573643,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T00:00:00Z","timestamp":1662940800000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s00454-022-00418-4","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T20:03:31Z","timestamp":1663013011000},"page":"26-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual Circumference and Collinear Sets"],"prefix":"10.1007","volume":"69","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0471-4118","authenticated-orcid":false,"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Angelini, P., Binucci, C., Evans, W., Hurtado, F., Liotta, G., Mchedlidze, T., Meijer, H., Okamoto, Y.: Universal point subsets for planar graphs. In: 23rd International Symposium on Algorithms and Computation (Taipei 2012). Lecture Notes in Computer Science, vol. 7676, pp. 423\u2013432. Springer, Heidelberg (2012)","key":"418_CR1","DOI":"10.1007\/978-3-642-35261-4_45"},{"issue":"1","key":"418_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.21884","volume":"82","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Evans, W., Frati, F., Gudmundsson, J.: SEFE without mapping via large induced outerplane graphs in plane graphs. J. Graph Theory 82(1), 45\u201364 (2016)","journal-title":"J. Graph Theory"},{"issue":"6","key":"418_CR3","doi-asserted-by":"publisher","first-page":"983","DOI":"10.7155\/jgaa.00446","volume":"21","author":"L Barba","year":"2017","unstructured":"Barba, L., Evans, W., Hoffmann, M., Kusters, V., Saumell, M., Speckmann, B.: Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. 21(6), 983\u20131002 (2017)","journal-title":"J. Graph Algorithms Appl."},{"unstructured":"Barba, L., Hoffmann, M., Kusters, V.: Column planarity and partial simultaneous geometric embedding for outerplanar graphs. In: 31th European Workshop on Computational Geometry (Ljubljana 2015). Book of Abstracts, pp. 53\u201356 (2015). http:\/\/eurocg15.fri.uni-lj.si\/pub\/eurocg15-book-of-abstracts.pdf","key":"418_CR4"},{"key":"418_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","volume":"18","author":"D Barnette","year":"1966","unstructured":"Barnette, D.: Trees in polyhedral graphs. Can. J. Math. 18, 731\u2013736 (1966)","journal-title":"Can. J. Math."},{"issue":"4","key":"418_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jctb.2011.02.009","volume":"101","author":"M Bilinski","year":"2011","unstructured":"Bilinski, M., Jackson, B., Ma, J., Yu, X.: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge connected graphs. J. Comb. Theory Ser. B 101(4), 214\u2013236 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Handbook of Graph Drawing and Visualization, pp. 349\u2013381. CRC Press, Boca Raton (2013)","key":"418_CR7"},{"issue":"4","key":"418_CR8","doi-asserted-by":"publisher","first-page":"987","DOI":"10.4153\/CJM-1980-076-2","volume":"32","author":"JA Bondy","year":"1980","unstructured":"Bondy, J.A., Simonovits, M.: Longest cycles in $$3$$-connected $$3$$-regular graphs. Can. J. Math. 32(4), 987\u2013992 (1980)","journal-title":"Can. J. Math."},{"issue":"4","key":"418_CR9","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":"418_CR10","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."},{"issue":"2","key":"418_CR11","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."},{"issue":"1","key":"418_CR12","first-page":"94","volume":"9","author":"G Da Lozzo","year":"2018","unstructured":"Da Lozzo, G., Dujmovi\u0107, V., Frati, F., Mchedlidze, T., Roselli, V.: Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1), 94\u2013130 (2018)","journal-title":"J. Comput. Geom."},{"unstructured":"Di Giacomo, E., Liotta, G., Mchedlidze, T.: How many vertex locations can be arbitrarily chosen when drawing planar graphs? (2012). arXiv:1212.0804","key":"418_CR13"},{"issue":"1","key":"418_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.7155\/jgaa.00407","volume":"21","author":"V Dujmovi\u0107","year":"2017","unstructured":"Dujmovi\u0107, V.: The utility of untangling. J. Graph Algorithms Appl. 21(1), 121\u2013134 (2017)","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Frati, F., Gon\u00e7alves, D., Morin, P., Rote, G.: Every collinear set is free. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms (San Diego 2019), pp. 1521\u20131538. SIAM, Philadelphia (2019)","key":"418_CR15","DOI":"10.1137\/1.9781611975482.92"},{"doi-asserted-by":"crossref","unstructured":"Evans, W., Kusters, V., Saumell, M., Speckmann, B.: Column planarity and partial simultaneous geometric embedding. In: 22nd International Symposium on Graph Drawing (W\u00fcrzburg 2014). Lecture Notes in Computer Science, vol. 8871, pp. 259\u2013271. Springer, Heidelberg (2014)","key":"418_CR16","DOI":"10.1007\/978-3-662-45803-7_22"},{"issue":"4","key":"418_CR17","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.-S., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom. 42(4), 542\u2013569 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"418_CR18","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":"1","key":"418_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0095-8956(86)90024-9","volume":"41","author":"B Jackson","year":"1986","unstructured":"Jackson, B.: Longest cycles in 3-connected cubic graphs. J. Comb. Theory Ser. B 41(1), 17\u201326 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"crossref","unstructured":"Kang, M., Pikhurko, O., Ravsky, A., Schacht, M., Verbitsky, O.: Untangling planar graphs from a specified vertex position\u2014hard cases. Discrete Appl. Math. 159(8), 789\u2013799 (2011)","key":"418_CR20","DOI":"10.1016\/j.dam.2011.01.011"},{"issue":"1","key":"418_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2635","volume":"135","author":"G Kant","year":"1997","unstructured":"Kant, G., Bodlaender, H.L.: Triangulating planar graphs while minimizing the maximum degree. Inf. Comput. 135(1), 1\u201314 (1997)","journal-title":"Inf. Comput."},{"key":"418_CR22","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jctb.2017.08.008","volume":"128","author":"Q Liu","year":"2018","unstructured":"Liu, Q., Yu, X., Zhang, Z.: Circumference of 3-connected cubic graphs. J. Comb. Theory Ser. B 128, 134\u2013159 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"418_CR23","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."},{"unstructured":"Ravsky, A., Verbitsky, O.: On collinear sets in straight line drawings (2008). arXiv:0806.0253","key":"418_CR24"},{"doi-asserted-by":"crossref","unstructured":"Ravsky, A., Verbitsky, O.: On collinear sets in straight-line drawings. In: 37th International Workshop on Graph-Theoretic Concepts in Computer Science (Tepl\u00e1 2011). Lecture Notes in Computer Science, vol. 6986, pp. 295\u2013306. Springer, Heidelberg (2011)","key":"418_CR25","DOI":"10.1007\/978-3-642-25870-1_27"},{"doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Comb. Theory Ser. B 70(1), 2\u201344 (1997)","key":"418_CR26","DOI":"10.1006\/jctb.1997.1750"},{"key":"418_CR27","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1017\/S0370164600044643","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait, P.G.: Remarks on the colouring of maps. Proc. R. Soc. Edinb. Sect. A 10, 729 (1880)","journal-title":"Proc. R. Soc. Edinb. Sect. A"},{"key":"418_CR28","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1112\/jlms\/s1-21.2.98","volume":"21","author":"WT Tutte","year":"1946","unstructured":"Tutte, W.T.: On Hamiltonian circuits. J. Lond. Math. Soc. 21, 98\u2013101 (1946)","journal-title":"J. Lond. Math. Soc."},{"unstructured":"Watanabe, M.: Open problem. In: 5th Czech\u2013Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (Prague 1998)","key":"418_CR29"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00418-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-022-00418-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00418-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T20:02:54Z","timestamp":1672603374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-022-00418-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,12]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["418"],"URL":"https:\/\/doi.org\/10.1007\/s00454-022-00418-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2022,9,12]]},"assertion":[{"value":"23 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}