{"id":"https://openalex.org/W1493075893","doi":"https://doi.org/10.1007/11602613_85","title":"Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles","display_name":"Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1493075893","doi":"https://doi.org/10.1007/11602613_85","mag":"1493075893"},"language":"en","primary_location":{"id":"doi:10.1007/11602613_85","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11602613_85","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.library.carleton.ca/pub/2795","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109226564","display_name":"Rolf Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rolf Klein","raw_affiliation_strings":["Institute of Computer Science I, Universit\u00e4t Bonn, R\u00f6merstra\u00dfe 164, D-53117, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science I, Universit\u00e4t Bonn, R\u00f6merstra\u00dfe 164, D-53117, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003621581","display_name":"Christian Knauer","orcid":null},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Knauer","raw_affiliation_strings":["Institute of Computer Science, Freie Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Freie Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068890173","display_name":"Giri Narasimhan","orcid":"https://orcid.org/0000-0003-0535-4871"},"institutions":[{"id":"https://openalex.org/I19700959","display_name":"Florida International University","ror":"https://ror.org/02gz6gg07","country_code":"US","type":"education","lineage":["https://openalex.org/I19700959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Giri Narasimhan","raw_affiliation_strings":["School of Computer Science, Florida, International University, ECS389, University Park, Miami, FL, 33199, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Florida, International University, ECS389, University Park, Miami, FL, 33199, USA","institution_ids":["https://openalex.org/I19700959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michiel Smid","raw_affiliation_strings":["School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109226564"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05845511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"849","last_page":"858"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/dilation","display_name":"Dilation (metric space)","score":0.7343616485595703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6594085693359375},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6098668575286865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5064231157302856},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4598027765750885},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4486645460128784},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42055824398994446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4021247625350952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34034451842308044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3341931700706482}],"concepts":[{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.7343616485595703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6594085693359375},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6098668575286865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5064231157302856},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4598027765750885},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4486645460128784},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42055824398994446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4021247625350952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34034451842308044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3341931700706482}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11602613_85","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11602613_85","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.9517","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.informatik.uni-bonn.de/I/publications/kkns-eaacd-05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.1621","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.1621","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.fiu.edu/~giri/papers/ISAAC05.pdf","raw_type":"text"},{"id":"pmh:oai:carleton.ca:2795","is_oa":true,"landing_page_url":"https://ir.library.carleton.ca/pub/2795","pdf_url":null,"source":{"id":"https://openalex.org/S4306402514","display_name":"Carleton University's Institutional Repository (MacOdrum Library, Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:carleton.ca:2795","is_oa":true,"landing_page_url":"https://ir.library.carleton.ca/pub/2795","pdf_url":null,"source":{"id":"https://openalex.org/S4306402514","display_name":"Carleton University's Institutional Repository (MacOdrum Library, Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1508903047","https://openalex.org/W1524692559","https://openalex.org/W1552092932","https://openalex.org/W1555007779","https://openalex.org/W1555471913","https://openalex.org/W1556534237","https://openalex.org/W1804422171","https://openalex.org/W2028747718","https://openalex.org/W2048557227","https://openalex.org/W2054011861","https://openalex.org/W2054459484","https://openalex.org/W2055721472","https://openalex.org/W2076014803","https://openalex.org/W2120424341","https://openalex.org/W2176446742","https://openalex.org/W2564671527","https://openalex.org/W2752885492","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W3132983279","https://openalex.org/W2495356367","https://openalex.org/W1522520750","https://openalex.org/W2392687107","https://openalex.org/W3124990892","https://openalex.org/W2944641486","https://openalex.org/W3207208339","https://openalex.org/W2182121179","https://openalex.org/W2130323728","https://openalex.org/W2952503136"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}