{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:42:57Z","timestamp":1725500577993},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77566-9_41","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T01:18:43Z","timestamp":1199495923000},"page":"473-484","source":"Crossref","is-referenced-by-count":2,"title":["Untangling a Planar Graph"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Spillner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/BF01944353","volume":"16","author":"D. Avis","year":"1996","unstructured":"Avis, D.: Generating rooted triangulations without repetitions. Algorithmica\u00a016, 618\u2013632 (1996)","journal-title":"Algorithmica"},{"key":"41_CR2","unstructured":"Bose, P., Dujmovic, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.R.: A polynomial bound for untangling geometric planar graphs (October 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0710.1641"},{"key":"41_CR3","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":"41_CR4","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C.-S., Wolff, A.: Moving vertices to make drawings plane. In: Hong, S.-H., Nishizeki, T. (eds.) GD 2007. Proc. 15th Intern. Sympos. Graph Drawing. LNCS, vol.\u00a04875, Springer, Heidelberg (to appear, 2008)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/11917496_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.-H. Hong","year":"2006","unstructured":"Hong, S.-H., Nagamochi, H.: Convex drawing of graphs with non-convex boundary. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 113\u2013124. Springer, Heidelberg (2006)"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"41_CR7","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":"4","key":"41_CR8","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":"41_CR9","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":"41_CR10","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990. Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pp. 138\u2013148 (1990)"},{"key":"41_CR11","unstructured":"Spillner, A., Wolff, A.: Untangling a planar graph (September 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0709.0170"},{"key":"41_CR12","unstructured":"Tantalo, J.: Planarity (2007), \n                    \n                      http:\/\/planarity.net\/"},{"key":"41_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S1385-7258(61)50045-5","volume":"23","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: A theory of 3-connected graphs. Indagationes Mathematicae\u00a023, 441\u2013455 (1961)","journal-title":"Indagationes Mathematicae"},{"key":"41_CR14","unstructured":"Verbitsky, O.: On the obfuscation complexity of planar graphs (May & June 2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0705.3748"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:12:24Z","timestamp":1558264344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540775652","9783540775669"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}