{"id":"https://openalex.org/W2011729204","doi":"https://doi.org/10.1145/2261250.2261257","title":"The point-set embeddability problem for plane graphs","display_name":"The point-set embeddability problem for plane graphs","publication_year":2012,"publication_date":"2012-06-17","ids":{"openalex":"https://openalex.org/W2011729204","doi":"https://doi.org/10.1145/2261250.2261257","mag":"2011729204"},"language":"en","primary_location":{"id":"doi:10.1145/2261250.2261257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2261250.2261257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038712987","display_name":"Th\u00e9r\u00e8se Biedl","orcid":"https://orcid.org/0000-0002-9003-3783"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Therese Biedl","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058329703","display_name":"Martin Vatshelle","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Martin Vatshelle","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2732,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94515853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.805889368057251},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7757884860038757},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.748214840888977},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.7240585684776306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6771267652511597},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6702641248703003},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.668786883354187},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.6262221336364746},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5723691582679749},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5596259236335754},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5369401574134827},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49216407537460327},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.48227551579475403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3451574444770813},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19940009713172913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1795773208141327}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.805889368057251},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7757884860038757},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.748214840888977},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.7240585684776306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6771267652511597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6702641248703003},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.668786883354187},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.6262221336364746},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5723691582679749},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5596259236335754},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5369401574134827},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49216407537460327},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.48227551579475403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3451574444770813},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19940009713172913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1795773208141327},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2261250.2261257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2261250.2261257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.831","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uwaterloo.ca/research/tr/2011/CS-2011-27.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1567245832","https://openalex.org/W1573857958","https://openalex.org/W1587731064","https://openalex.org/W1590770767","https://openalex.org/W1692509211","https://openalex.org/W1769402330","https://openalex.org/W1807469705","https://openalex.org/W1963742727","https://openalex.org/W1981505946","https://openalex.org/W2003525146","https://openalex.org/W2011039300","https://openalex.org/W2019137761","https://openalex.org/W2019912818","https://openalex.org/W2031551728","https://openalex.org/W2034216584","https://openalex.org/W2047871605","https://openalex.org/W2048913517","https://openalex.org/W2049284557","https://openalex.org/W2063120809","https://openalex.org/W2063911255","https://openalex.org/W2065528988","https://openalex.org/W2068320309","https://openalex.org/W2083103669","https://openalex.org/W2085179971","https://openalex.org/W2085550081","https://openalex.org/W2094502103","https://openalex.org/W2099520181","https://openalex.org/W2099750557","https://openalex.org/W2122264000","https://openalex.org/W2125058377","https://openalex.org/W2129047612","https://openalex.org/W2133642716","https://openalex.org/W2158531399","https://openalex.org/W2162161033","https://openalex.org/W2171373259","https://openalex.org/W2181059811","https://openalex.org/W2288073247","https://openalex.org/W2772465410","https://openalex.org/W2997113937","https://openalex.org/W4240983959","https://openalex.org/W6674799086","https://openalex.org/W6746275862"],"related_works":["https://openalex.org/W1759199114","https://openalex.org/W3216500139","https://openalex.org/W4287758186","https://openalex.org/W2995965358","https://openalex.org/W3034858646","https://openalex.org/W1491152805","https://openalex.org/W2605313623","https://openalex.org/W4301463689","https://openalex.org/W2133160845","https://openalex.org/W3101895193"],"abstract_inverted_index":{"In":[0],"this":[1,39],"paper,":[2],"we":[3],"study":[4],"the":[5,22,25,29,44],"point-set-embeddability-problem,":[6],"i.e.,":[7],"given":[8],"a":[9,13,19,73],"planar":[10,70],"graph":[11],"and":[12,81],"set":[14],"of":[15,21,55],"points,":[16],"is":[17,33,41],"there":[18],"mapping":[20],"vertices":[23],"to":[24],"points":[26],"such":[27],"that":[28,38,61,77],"resulting":[30],"straight-line":[31],"drawing":[32],"planar?":[34],"It":[35],"was":[36],"known":[37],"problem":[40],"NP-hard":[42],"if":[43],"embedding":[45,76],"can":[46,65],"be":[47,66],"chosen,":[48],"but":[49],"becomes":[50],"polynomial":[51],"for":[52,68],"triangulated":[53],"graphs":[54,71],"treewidth":[56,80],"3.":[57],"We":[58],"show":[59],"here":[60],"in":[62],"fact":[63],"it":[64],"answered":[67],"all":[69],"with":[72],"fixed":[74],"combinatorial":[75],"have":[78],"constant":[79,82],"face-degree.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}