{"id":"https://openalex.org/W2133160845","doi":"https://doi.org/10.1142/s0218195913600091","title":"THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS","display_name":"THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2133160845","doi":"https://doi.org/10.1142/s0218195913600091","mag":"2133160845"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195913600091","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195913600091","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","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":["David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 1A2, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 1A2, 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":["Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, 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":2.0803,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.88494453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"04n05","first_page":"357","last_page":"395"},"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.9952999949455261,"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.8840982913970947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.832097053527832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7806415557861328},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7606185078620911},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.7481876015663147},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.6723226308822632},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.6595306396484375},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6284305453300476},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6010910272598267},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5915434956550598},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5774188041687012},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5679057240486145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5308298468589783},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.42023521661758423},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41516605019569397},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3056066632270813},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2344929277896881},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07231003046035767},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05827850103378296}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8840982913970947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.832097053527832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7806415557861328},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7606185078620911},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.7481876015663147},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.6723226308822632},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.6595306396484375},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6284305453300476},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6010910272598267},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5915434956550598},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5774188041687012},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5679057240486145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5308298468589783},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.42023521661758423},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41516605019569397},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3056066632270813},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2344929277896881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07231003046035767},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05827850103378296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195913600091","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195913600091","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W406819860","https://openalex.org/W1537449969","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/W1963742727","https://openalex.org/W2003525146","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/W2059811909","https://openalex.org/W2063120809","https://openalex.org/W2063911255","https://openalex.org/W2065528988","https://openalex.org/W2083103669","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/W2288073247","https://openalex.org/W2772465410"],"related_works":["https://openalex.org/W1759199114","https://openalex.org/W3034858646","https://openalex.org/W2995965358","https://openalex.org/W2081773392","https://openalex.org/W2009558719","https://openalex.org/W43225448","https://openalex.org/W2133160845","https://openalex.org/W2605313623","https://openalex.org/W4301463689","https://openalex.org/W3101895193"],"abstract_inverted_index":{"In":[0],"this":[1,41],"paper,":[2],"we":[3,155],"study":[4],"the":[5,24,27,31,46,94,100,142,162],"point-set":[6,110,144],"embeddability":[7,111,145],"problem,":[8],"i.e.,":[9],"given":[10],"a":[11,15,21,75,113,123],"planar":[12,72,125,131],"graph":[13,126,163],"and":[14,83,167],"set":[16],"of":[17,23,57,93],"points,":[18],"is":[19,35,43,96,102,152],"there":[20],"mapping":[22],"vertices":[25],"to":[26],"points":[28],"such":[29],"that":[30,40,63,79,88,141,157],"resulting":[32],"straight-line":[33],"drawing":[34],"planar?":[36],"It":[37],"was":[38],"known":[39],"problem":[42,146],"NP-hard":[44],"if":[45,161],"embedding":[47,78,115],"can":[48,67],"be":[49,68,150],"chosen,":[50],"but":[51,154],"becomes":[52,116,159],"polynomial":[53,160],"for":[54,70,122],"triangulated":[55,130],"graphs":[56,73],"treewidth":[58,82,101,166],"3.":[59],"We":[60,86],"show":[61,140],"here":[62],"in":[64],"fact":[65],"it":[66,158],"answered":[69],"all":[71],"with":[74,112,127],"fixed":[76,114],"combinatorial":[77],"have":[80,107],"constant":[81,84,128],"face-degree.":[85],"prove":[87,156],"as":[89,91],"soon":[90],"one":[92],"conditions":[95],"dropped":[97],"(i.e.,":[98],"either":[99],"unbounded":[103],"or":[104,133],"some":[105],"faces":[106,148],"large":[108],"degrees),":[109],"NP-hard.":[117],"The":[118],"NP-hardness":[119],"holds":[120],"even":[121],"3-connected":[124],"treewidth,":[129],"graphs,":[132],"2-connected":[134],"outer-planar":[135],"graphs.":[136],"These":[137],"results":[138],"also":[139],"convex":[143],"(where":[147],"must":[149],"convex)":[151],"NP-hard,":[153],"has":[164],"bounded":[165,168],"maximum":[169],"degree.":[170]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}