{"id":"https://openalex.org/W2099520181","doi":"https://doi.org/10.7155/jgaa.00046","title":"Embedding Vertices at Points: Few Bends Suffice for Planar Graphs","display_name":"Embedding Vertices at Points: Few Bends Suffice for Planar Graphs","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2099520181","doi":"https://doi.org/10.7155/jgaa.00046","mag":"2099520181"},"language":"en","primary_location":{"id":"doi:10.7155/jgaa.00046","doi":"https://doi.org/10.7155/jgaa.00046","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00046","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2099520181"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00046","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103045561","display_name":"Michael Kaufmann","orcid":"https://orcid.org/0000-0001-9186-3538","observed_orcids":["https://orcid.org/0000-0001-9186-3538"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Kaufmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045411160","display_name":"Roland Wiese","orcid":"https://orcid.org/0009-0006-0638-1133","observed_orcids":["https://orcid.org/0009-0006-0638-1133"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roland Wiese","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8029,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.94063527,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"6","issue":"1","first_page":"115","last_page":"129"},"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.4253000020980835,"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.4253000020980835,"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.2020999938249588,"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.15809999406337738,"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/planar-graphs","display_name":"planar graphs","score":0.7929999828338623},{"id":"https://openalex.org/keywords/network-visualization","display_name":"network visualization","score":0.5550000071525574},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9409999847412109},{"id":"https://openalex.org/keywords/straight-line-embeddings","display_name":"straight-line embeddings","score":0.5099999904632568},{"id":"https://openalex.org/keywords/outerplanar-graphs","display_name":"outerplanar graphs","score":0.8389999866485596}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.77627032995224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6932288408279419},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6421114802360535},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5852365493774414},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.5302628874778748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5113295912742615},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.45335474610328674},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4314618408679962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.357763409614563},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.29349249601364136},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20856794714927673},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08152416348457336},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.04045230150222778}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.7155/jgaa.00046","doi":"https://doi.org/10.7155/jgaa.00046","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00046","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.8940","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.8940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-pr.informatik.uni-tuebingen.de/~mk/psfiles/gd99.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.7660","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/publications/jgaa/accepted/02/KaufmannWiese02.6.1.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.9274","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.9274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/publications/jgaa/accepted/2002/KaufmannWiese2002.6.1.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e787532365e84a93aace8046f9c878f9","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/e787532365e84a93aace8046f9c878f9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Graph Algorithms and Applications, Vol 6, Iss 1 (2002)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.00046","doi":"https://doi.org/10.7155/jgaa.00046","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00046","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W85690038","https://openalex.org/W307896644","https://openalex.org/W1487774514","https://openalex.org/W1573857958","https://openalex.org/W1807469705","https://openalex.org/W1851631772","https://openalex.org/W1983755786","https://openalex.org/W2020112047","https://openalex.org/W2030087828","https://openalex.org/W2031303191","https://openalex.org/W2055245094","https://openalex.org/W2148367192","https://openalex.org/W2158598102"],"related_works":["https://openalex.org/W1851631772","https://openalex.org/W2032822378","https://openalex.org/W2058678665","https://openalex.org/W1563721641","https://openalex.org/W2133642716","https://openalex.org/W2162161033","https://openalex.org/W7095424581","https://openalex.org/W2108115761","https://openalex.org/W7099448622","https://openalex.org/W2952903853"],"abstract_inverted_index":{"The":[0],"existing":[1],"literature":[2],"gives":[3],"ecient":[4],"algorithms":[5,56],"for":[6,57,70,89],"mapping":[7,58,71,102],"trees":[8],"or":[9],"less":[10],"restrictively":[11],"outerplanar":[12],"graphs":[13,61,74,92],"on":[14,44],"a":[15,21,85],"given":[16],"set":[17],"of":[18],"points":[19],"in":[20],"plane,":[22],"so":[23],"that":[24,104],"the":[25,36],"edges":[26],"are":[27],"drawn":[28],"planar":[29],"and":[30,39,69],"as":[31],"straight":[32],"lines.":[33],"We":[34],"relax":[35],"latter":[37],"requirement":[38],"allow":[40],"very":[41],"few":[42],"bends":[43,79],"each":[45,105],"edge":[46,68,106],"while":[47],"considering":[48],"general":[49,72],"plane":[50,60,73,91],"graphs.":[51],"Our":[52],"results":[53],"show":[54],"two":[55,78],"four-connected":[59],"with":[62,75],"at":[63,76,108],"most":[64,77,109],"one":[65,110],"bend":[66],"per":[67,80],"edge.":[81],"Furthermore":[82],"we":[83],"give":[84],"point":[86],"set,":[87],"where":[88],"arbitrary":[90],"it":[93],"is":[94,100],"NP-complete":[95],"to":[96],"decide":[97],"whether":[98],"there":[99],"an":[101],"such":[103],"has":[107],"bend.":[111]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":9}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}
