{"id":"https://openalex.org/W2016638039","doi":"https://doi.org/10.1007/s00453-008-9194-y","title":"Collective Tree Spanners in Graphs with Bounded Parameters","display_name":"Collective Tree Spanners in Graphs with Bounded Parameters","publication_year":2008,"publication_date":"2008-04-30","ids":{"openalex":"https://openalex.org/W2016638039","doi":"https://doi.org/10.1007/s00453-008-9194-y","mag":"2016638039"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9194-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9194-y","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/A5086851146","display_name":"Feodor F. Dragan","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feodor F. Dragan","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, 44242, USA","Kent State University, Algorithmic Research Laboratory, Department of Computer Science, 44242, Kent, OH, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Kent State University, Algorithmic Research Laboratory, Department of Computer Science, 44242, Kent, OH, USA#TAB#","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052402488","display_name":"Chenyu Yan","orcid":"https://orcid.org/0000-0003-1974-7107"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chenyu Yan","raw_affiliation_strings":["Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, 44242, USA","Kent State University, Algorithmic Research Laboratory, Department of Computer Science, 44242, Kent, OH, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, 44242, USA","institution_ids":["https://openalex.org/I149910238"]},{"raw_affiliation_string":"Kent State University, Algorithmic Research Laboratory, Department of Computer Science, 44242, Kent, OH, USA#TAB#","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086851146"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8219,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74751357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"57","issue":"1","first_page":"22","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T11476","display_name":"Graph theory and applications","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.76395583152771},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6284753084182739},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5623264908790588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5178792476654053},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5140975117683411},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.49800920486450195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43066778779029846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3617907464504242},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2773326635360718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2567734122276306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13141199946403503},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10717147588729858}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.76395583152771},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6284753084182739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5623264908790588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5178792476654053},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5140975117683411},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.49800920486450195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43066778779029846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3617907464504242},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2773326635360718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2567734122276306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13141199946403503},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10717147588729858},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-008-9194-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9194-y","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.6251","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.6251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~dragan/CollTS-BPar.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":38,"referenced_works":["https://openalex.org/W8360613","https://openalex.org/W143512583","https://openalex.org/W1492516078","https://openalex.org/W1560985637","https://openalex.org/W1577544661","https://openalex.org/W1587867115","https://openalex.org/W1592908094","https://openalex.org/W1754780350","https://openalex.org/W1835083164","https://openalex.org/W1974876810","https://openalex.org/W1993328543","https://openalex.org/W2017223622","https://openalex.org/W2018963243","https://openalex.org/W2021932455","https://openalex.org/W2022046900","https://openalex.org/W2029448190","https://openalex.org/W2038643780","https://openalex.org/W2042333226","https://openalex.org/W2044989918","https://openalex.org/W2050855807","https://openalex.org/W2052056934","https://openalex.org/W2057994027","https://openalex.org/W2058332489","https://openalex.org/W2059372025","https://openalex.org/W2064717780","https://openalex.org/W2073558110","https://openalex.org/W2077571023","https://openalex.org/W2093095561","https://openalex.org/W2124784817","https://openalex.org/W2125082389","https://openalex.org/W2143474538","https://openalex.org/W2161426837","https://openalex.org/W2320198223","https://openalex.org/W2543951292","https://openalex.org/W2912257407","https://openalex.org/W2914617426","https://openalex.org/W4213368513","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2964174631","https://openalex.org/W1810116456","https://openalex.org/W4300619607","https://openalex.org/W1579590954","https://openalex.org/W2223243427","https://openalex.org/W4306887989","https://openalex.org/W2951811902","https://openalex.org/W186753374","https://openalex.org/W2949940357","https://openalex.org/W4302375582"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
