{"id":"https://openalex.org/W2163098772","doi":"https://doi.org/10.1007/s00453-010-9423-z","title":"k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees","display_name":"k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees","publication_year":2010,"publication_date":"2010-06-24","ids":{"openalex":"https://openalex.org/W2163098772","doi":"https://doi.org/10.1007/s00453-010-9423-z","mag":"2163098772"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9423-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9423-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]},{"id":"https://openalex.org/I4210125051","display_name":"Microsoft (Israel)","ror":"https://ror.org/03819cc96","country_code":"IL","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210125051"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["Microsoft Israel R&D Center, Herzelia, Israel","School of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Microsoft Israel R&D Center, Herzelia, Israel","institution_ids":["https://openalex.org/I4210125051"]},{"raw_affiliation_string":"School of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000264005"],"corresponding_institution_ids":["https://openalex.org/I16391192","https://openalex.org/I4210125051"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3444,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.6538605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"61","issue":"1","first_page":"141","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.7848979234695435},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7272518873214722},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7251383662223816},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.6126652359962463},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.5937769412994385},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5115340948104858},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.46718457341194153},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.4666694700717926},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.439448744058609},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4277821183204651},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4243917465209961},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.41948723793029785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3629193902015686},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3380139470100403},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2983000874519348},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12672847509384155},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07843542098999023}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7848979234695435},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7272518873214722},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7251383662223816},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.6126652359962463},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.5937769412994385},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5115340948104858},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.46718457341194153},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.4666694700717926},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.439448744058609},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4277821183204651},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4243917465209961},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.41948723793029785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3629193902015686},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3380139470100403},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2983000874519348},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12672847509384155},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07843542098999023}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-010-9423-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9423-z","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W48861618","https://openalex.org/W1712261913","https://openalex.org/W1952648253","https://openalex.org/W1976377840","https://openalex.org/W1981859328","https://openalex.org/W2032684479","https://openalex.org/W2041571997","https://openalex.org/W2042899161","https://openalex.org/W2047517090","https://openalex.org/W2058364478","https://openalex.org/W2059063102","https://openalex.org/W2100658172","https://openalex.org/W2107711372","https://openalex.org/W2114493937","https://openalex.org/W2149272173","https://openalex.org/W2156760067","https://openalex.org/W2569942321","https://openalex.org/W3030774092","https://openalex.org/W4251171485","https://openalex.org/W4255288880","https://openalex.org/W6637634662"],"related_works":["https://openalex.org/W2954828522","https://openalex.org/W2029772672","https://openalex.org/W2996555825","https://openalex.org/W2332440504","https://openalex.org/W3123513344","https://openalex.org/W1543826224","https://openalex.org/W1973091456","https://openalex.org/W2058281654","https://openalex.org/W3009535447","https://openalex.org/W4249176948"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}