{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:42Z","timestamp":1760441862627},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_28","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"290-295","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bound Constructions for Untangling Planar Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Javier","family":"Cano","sequence":"first","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"28_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01782475","volume":"12","author":"E.M. Arkin","year":"1996","unstructured":"Arkin, E.M., Held, M., Mitchell, J.S.B., Skiena, S.: Hamiltonian triangulations for fast rendering. The Visual Computer\u00a012(9), 429\u2013444 (1996)","journal-title":"The Visual Computer"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s00454-008-9125-3","volume":"42","author":"P. Bose","year":"2009","unstructured":"Bose, P., Dujmovic, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.R.: A polynomial bound for untangling geometric planar graphs. Discrete Comput. Geom.\u00a042(4), 570\u2013585 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR3","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.\u00a043, 402\u2013411 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR4","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"28_CR5","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Univ. Szeged, Acta Sci. Math.\u00a011, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged, Acta Sci. Math."},{"issue":"4","key":"28_CR6","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.\u00a042(4), 542\u2013569 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(88)90075-5","volume":"45","author":"D.A. Holton","year":"1988","unstructured":"Holton, D.A., McKay, B.D.: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices. J. Combin. Theory Ser.\u00a0B\u00a045(3), 305\u2013319 (1988)","journal-title":"J. Combin. Theory Ser.\u00a0B"},{"issue":"8","key":"28_CR8","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\u2014Hard cases. Discrete Appl. Math.\u00a0159(8), 789\u2013799 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"28_CR9","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.\u00a028(4), 585\u2013592 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1080\/14786448408627475","volume":"17","author":"P.G. Tait","year":"1884","unstructured":"Tait, P.G.: Listing\u2019s Topologie. Philosophical Magazine\u00a017, 30\u201346 (1884)","journal-title":"Philosophical Magazine"},{"issue":"2","key":"28_CR11","first-page":"98","volume":"21","author":"W.T. Tutte","year":"1946","unstructured":"Tutte, W.T.: On Hamiltonian circuits. J. LMS\u00a021(2), 98\u2013101 (1946)","journal-title":"J. LMS"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:31:27Z","timestamp":1555878687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}