{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:40:57Z","timestamp":1725838857594},"publisher-location":"Cham","reference-count":31,"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"},{"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_27","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"321-332","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Utility of Untangling"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"27_CR1","unstructured":"Abellanas, M., Hurtado, F., Ramos, P.: Tolerancia de arreglos de segmentos. In: Proceedings of VI Encuentros de Geometr\u00eda Computacional, pp. 77\u201384 (1995)"},{"key":"27_CR2","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)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-45030-3_18","volume-title":"Algorithms and Computation","author":"P Angelini","year":"2013","unstructured":"Angelini, P., Evans, W., Frati, F., Gudmundsson, J.: SEFE with no mapping via large induced outerplane graphs in plane graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 185\u2013195. Springer, Heidelberg (2013)"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.7155\/jgaa.00250","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric simultaneous embedding. J. Graph Algorithms Appl. 16(1), 37\u201383 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00318","volume":"18","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Cheng, Z., Devanny, W.E., Eppstein, D.: Superpatterns and universal point sets. J. Graph Algorithms Appl. 18(2), 177\u2013209 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"27_CR6","unstructured":"Barba, L., Hoffmann, M., Kusters, V.: Column planarity and partial simultaneous geometric embedding for outerplanar graphs. In: Abstracts of the 31st European Workshop on Computational Geometry (EuroCG), pp. 53\u201356 (2015)"},{"key":"27_CR7","first-page":"349","volume-title":"Handbook of Graph Drawing and Visualizationpp","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualizationpp, pp. 349\u2013381. CRC Press, Boca Raton (2013)"},{"issue":"3","key":"27_CR8","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":"27_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."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45078-8_22","volume-title":"Algorithms and Data Structures","author":"P Brass","year":"2003","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 243\u2013255. Springer, Heidelberg (2003)"},{"issue":"4","key":"27_CR11","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":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-45281-9_3","volume-title":"Computational Geometry and Graphs","author":"J Cardinal","year":"2013","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V.: On universal point sets for planar graphs. In: Akiyama, J., Kano, M., Sakai, T. (eds.) TJJCCGG 2012. LNCS, vol. 8296, pp. 30\u201341. Springer, Heidelberg (2013)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, N., Urrutia, J.: Straight line embeddings of planar graphs on point sets. In: Proceedings of the 8th Canadian Conference on Computational Geometry, (CCCG), pp. 312\u2013318 (1996)","DOI":"10.1515\/9780773591134-055"},{"issue":"2","key":"27_CR14","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":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.7155\/jgaa.00193","volume":"13","author":"E Giacomo Di","year":"2009","unstructured":"Di Giacomo, E., Didimo, W., van Kreveld, M.J., Liotta, G., Speckmann, B.: Matched drawings of planar graphs. J. Graph Algorithms Appl. 13(3), 423\u2013445 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"27_CR16","unstructured":"Di Giacomo, E., Liotta, G., Mchedlidze, T.: How many vertex locations can be arbitrarily chosen when drawing planar graphs? CoRR abs\/1212.0804 (2012)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-45043-3_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Giacomo Di","year":"2013","unstructured":"Di Giacomo, E., Liotta, G., Mchedlidze, T.: Lower and upper bounds for long induced paths in 3-connected planar graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 213\u2013224. Springer, Heidelberg (2013)"},{"issue":"51","key":"27_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"2","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 2(51), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"27_CR19","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica 2, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"issue":"6\u20137","key":"27_CR20","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.comgeo.2008.12.006","volume":"42","author":"A Estrella-Balderrama","year":"2009","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Comput. Geom. 42(6\u20137), 704\u2013721 (2009)","journal-title":"Comput. Geom."},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"27_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting fary embeddings of planar graphs. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, pp. 426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"issue":"4","key":"27_CR24","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":"27_CR25","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. Monthly 98, 165\u2013166 (1991)","journal-title":"Am. Math. Monthly"},{"issue":"8","key":"27_CR26","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."},{"issue":"2","key":"27_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ipl.2004.06.009","volume":"92","author":"M Kurowski","year":"2004","unstructured":"Kurowski, M.: A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Inf. Process. Lett. 92(2), 95\u201398 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"27_CR28","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."},{"key":"27_CR29","unstructured":"Ramos, P.: Tolerancia de estructuras geom\u00e9tricas y combinatorias. Ph.D. thesis, Universidad Polit\u00e9cnica de Madrid, Madrid, Spain (1995)"},{"key":"27_CR30","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)"},{"key":"27_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-1-4612-0801-3_9","volume-title":"Discrete probability and algorithms","author":"JM Steele","year":"1995","unstructured":"Steele, J.M.: Variations on the monotone subsequence theme of Erd\u00f6s and Szekeres. In: Aldous, D., Diaconis, P., Spencer, J., Steele, J.M. (eds.) Discrete probability and algorithms, pp. 111\u2013131. Springer, Heidelberg (1995)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T23:56:39Z","timestamp":1692143799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_27","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"}}]}}