{"id":"https://openalex.org/W2063778405","doi":"https://doi.org/10.1016/s0196-6774(02)00225-0","title":"Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time","display_name":"Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time","publication_year":2003,"publication_date":"2003-04-01","ids":{"openalex":"https://openalex.org/W2063778405","doi":"https://doi.org/10.1016/s0196-6774(02)00225-0","mag":"2063778405"},"language":"en","primary_location":{"id":"doi:10.1016/s0196-6774(02)00225-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0196-6774(02)00225-0","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5021261521","display_name":"K. Skodinis","orcid":null},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Konstantin Skodinis","raw_affiliation_strings":["Department of Computer Science, University of Passau, D-94032 Passau, Germany","Department of Computer Science, University of Passau, D-94032 Passau, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Passau, D-94032 Passau, Germany","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Department of Computer Science, University of Passau, D-94032 Passau, Germany#TAB#","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021261521"],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":null,"apc_paid":null,"fwci":2.5659,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.89727429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"47","issue":"1","first_page":"40","last_page":"59"},"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.9980999827384949,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/vertex","display_name":"Vertex (graph theory)","score":0.7799174785614014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6455780267715454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.614521861076355},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5210189819335938},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5170150995254517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4449392259120941},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4352276921272278},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4106147885322571},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3309045732021332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.291526198387146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23590096831321716},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1216232180595398}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7799174785614014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6455780267715454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.614521861076355},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5210189819335938},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5170150995254517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4449392259120941},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4352276921272278},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4106147885322571},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3309045732021332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.291526198387146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23590096831321716},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1216232180595398}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0196-6774(02)00225-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0196-6774(02)00225-0","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":24,"referenced_works":["https://openalex.org/W1980008391","https://openalex.org/W1996419691","https://openalex.org/W1998007106","https://openalex.org/W2012154006","https://openalex.org/W2014963708","https://openalex.org/W2015469394","https://openalex.org/W2033405938","https://openalex.org/W2042534515","https://openalex.org/W2052867211","https://openalex.org/W2059372025","https://openalex.org/W2063019820","https://openalex.org/W2076322499","https://openalex.org/W2084742485","https://openalex.org/W2091208300","https://openalex.org/W2101400962","https://openalex.org/W2124568589","https://openalex.org/W2125058377","https://openalex.org/W2137766675","https://openalex.org/W2143314829","https://openalex.org/W2153362081","https://openalex.org/W2154788235","https://openalex.org/W2377063748","https://openalex.org/W2498182534","https://openalex.org/W6680400994"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W2346500824","https://openalex.org/W2042273420","https://openalex.org/W2010333092","https://openalex.org/W2092070151","https://openalex.org/W1988771411","https://openalex.org/W207698748","https://openalex.org/W3005925191","https://openalex.org/W4221160330","https://openalex.org/W129418716"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}