{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:36Z","timestamp":1750307016704,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,17]],"date-time":"2012-06-17T00:00:00Z","timestamp":1339891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,17]]},"DOI":"10.1145\/2261250.2261257","type":"proceedings-article","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T13:33:01Z","timestamp":1340199181000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["The point-set embeddability problem for plane graphs"],"prefix":"10.1145","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[{"name":"University of Bergen, Bergen, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.004"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science (MFCS","author":"Bodlaender H.","year":"1997","unstructured":"H. Bodlaender . Treewidth: algorithmic techniques and results . In Mathematical Foundations of Computer Science (MFCS 1997 ). volume 1295 of Lecture Notes in Computer Science , pages 19 -- 36 . Springer-Verlag , 1997. H. Bodlaender. Treewidth: algorithmic techniques and results. In Mathematical Foundations of Computer Science (MFCS 1997). volume 1295 of Lecture Notes in Computer Science, pages 19--36. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0049"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00069-4"},{"key":"e_1_3_2_1_6_1","volume-title":"Chordal embeddings of planar graphs. Discrete Mathematics, 273(1--3):85--102","author":"Bouchitte V.","year":"2003","unstructured":"V. Bouchitte , F. Mazoit , and I. Todinca . Chordal embeddings of planar graphs. Discrete Mathematics, 273(1--3):85--102 , 2003 . V. Bouchitte, F. Mazoit, and I. Todinca. Chordal embeddings of planar graphs. Discrete Mathematics, 273(1--3):85--102, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00132"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/648249.752039"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28076-4_16"},{"key":"e_1_3_2_1_10_1","first-page":"229","article-title":"On straight line representation of planar graphs","volume":"11","author":"Fary I.","year":"1948","unstructured":"I. Fary . On straight line representation of planar graphs . Acta Scientiarum Mathematicarum (Szeged) , 11 : 229 -- 233 , 1948 . I. Fary. On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged), 11:229--233, 1948.","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122694"},{"key":"e_1_3_2_1_12_1","volume-title":"Computers and Intracatablity: A Guide to the Theory on NP-completeness","author":"Gary M.R.","year":"1979","unstructured":"M.R. Gary and D.S. Johnson . Computers and Intracatablity: A Guide to the Theory on NP-completeness . Freeman , 1979 . M.R. Gary and D.S. Johnson. Computers and Intracatablity: A Guide to the Theory on NP-completeness. Freeman, 1979."},{"key":"e_1_3_2_1_13_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/978-3-642-18381-2_23","volume-title":"Theory and Practice of Computer Science (SOFSEM","author":"Geyer M.","year":"2011","unstructured":"M. Geyer , M. Kaufmann , T. Mchedlidze , and A. Symvonis . Upward point-set embeddability . In Theory and Practice of Computer Science (SOFSEM 2011 ). volume 6543 of Lecture Notes in Computer Science , pages 272 -- 283 . Springer , 2011. M. Geyer, M. Kaufmann, T. Mchedlidze, and A. Symvonis. Upward point-set embeddability. In Theory and Practice of Computer Science (SOFSEM 2011). volume 6543 of Lecture Notes in Computer Science, pages 272--283. Springer, 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021819591000344X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/2323956"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/978-3-642-22685-4_18","volume-title":"COCOON","author":"Moosa T.M.","year":"2011","unstructured":"T.M. Moosa and M. Sohel Rahman . Improved algorithms for the point-set embeddability problem for plans 3-trees . In COCOON , volume 6842 of Lecture Notes in Computer Science , pages 204 -- 212 . Springer , 2011 . T.M. Moosa and M. Sohel Rahman. Improved algorithms for the point-set embeddability problem for plans 3-trees. In COCOON, volume 6842 of Lecture Notes in Computer Science, pages 204--212. Springer, 2011."},{"key":"e_1_3_2_1_17_1","volume-title":"Square roots of minor closed graph classes","author":"Nestoridis N.","year":"2011","unstructured":"N. Nestoridis and D. Thilikos . Square roots of minor closed graph classes , 2011 . Presented at EuroComb '11. N. Nestoridis and D. Thilikos. Square roots of minor closed graph classes, 2011. Presented at EuroComb'11."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2011.09.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00067-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320191"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215352"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109652"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1951-0041425-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.12.001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.12.003"},{"key":"e_1_3_2_1_27_1","first-page":"26","article-title":"Bemerkungen zum Vierfarbenproblem","volume":"46","author":"Wagner K.","year":"1936","unstructured":"K. Wagner . Bemerkungen zum Vierfarbenproblem . Jahresbericht der Deutschen Mathematiker-Vereinigung. 46 : 26 -- 32 , 1936 . K. Wagner. Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung. 46:26--32, 1936.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung."}],"event":{"name":"SoCG '12: Symposium on Computational Geometry 2012","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chapel Hill North Carolina USA","acronym":"SoCG '12"},"container-title":["Proceedings of the twenty-eighth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2261250.2261257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2261250.2261257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:08Z","timestamp":1750236548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2261250.2261257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,17]]},"references-count":27,"alternative-id":["10.1145\/2261250.2261257","10.1145\/2261250"],"URL":"https:\/\/doi.org\/10.1145\/2261250.2261257","relation":{},"subject":[],"published":{"date-parts":[[2012,6,17]]},"assertion":[{"value":"2012-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}