{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:59:20Z","timestamp":1754261960327},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_13","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"101-112","source":"Crossref","is-referenced-by-count":4,"title":["Moving Vertices to Make Drawings Plane"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Goaoc","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"13_CR2","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Sci. Math. (Szeged)\u00a011, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"13_CR3","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C.-S., Wolff, A.: Moving vertices to make drawings plane (June 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0706.1002"},{"key":"13_CR4","unstructured":"Kang, M., Schacht, M., Verbitsky, O.: How much work does it take to straighten a plane graph out? (June 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0707.3373"},{"issue":"1","key":"13_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Algorithms Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D.E. Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discr. Math.\u00a05(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Visual Languages and Computing\u00a06(2), 183\u2013210 (1995)","journal-title":"J. Visual Languages and Computing"},{"issue":"4","key":"13_CR9","doi-asserted-by":"crossref","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":"13_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C. Schensted","year":"1961","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Canadian Journal of Mathematics\u00a013, 179\u2013191 (1961)","journal-title":"Canadian Journal of Mathematics"},{"key":"13_CR11","unstructured":"Spillner, A., Wolff, A.: Untangling a planar graph (September 2007), \n                    \n                       http:\/\/arxiv.org\/abs\/0709.0170"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"464","DOI":"10.2307\/2031777","volume":"2","author":"S.K. Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. Amer. Math. Soc.\u00a02, 464\u2013466 (1951)","journal-title":"Proc. Amer. Math. Soc."},{"key":"13_CR13","unstructured":"Tantalo, J.: Planarity (2007), \n                    \n                      http:\/\/planarity.net\/"},{"key":"13_CR14","unstructured":"Verbitsky, O.: On the obfuscation complexity of planar graphs (May & June 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0705.3748"},{"key":"13_CR15","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht Deutsch. Math.-Verein.\u00a046, 26\u201332 (1936)","journal-title":"Jahresbericht Deutsch. Math.-Verein."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:47Z","timestamp":1619507747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_13","relation":{},"subject":[]}}