{"id":"https://openalex.org/W1593947471","doi":"https://doi.org/10.1007/978-3-642-02927-1_59","title":"Fast Polynomial-Space Algorithms Using M\u00f6bius Inversion: Improving on Steiner Tree and Related Problems","display_name":"Fast Polynomial-Space Algorithms Using M\u00f6bius Inversion: Improving on Steiner Tree and Related Problems","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1593947471","doi":"https://doi.org/10.1007/978-3-642-02927-1_59","mag":"1593947471"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02927-1_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02927-1_59","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":"conference-paper","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/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Department of Informatics, University of Bergen, N-5020, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":14.4545,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.99616368,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"713","last_page":"725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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.9993000030517578,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7547642588615417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6211675405502319},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5660133957862854},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5412566065788269},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5207778811454773},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5119107961654663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49268561601638794},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4901498258113861},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4351658225059509},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.432947039604187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41042280197143555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35972321033477783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32928282022476196},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2349821925163269},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.0963796079158783}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7547642588615417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6211675405502319},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5660133957862854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5412566065788269},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5207778811454773},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5119107961654663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49268561601638794},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4901498258113861},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4351658225059509},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.432947039604187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41042280197143555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35972321033477783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32928282022476196},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2349821925163269},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0963796079158783},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"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/978-3-642-02927-1_59","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02927-1_59","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.170.7539","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.7539","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://folk.uib.no/jne061/ConfMobius.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7599999904632568,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W716692","https://openalex.org/W643665888","https://openalex.org/W1589421353","https://openalex.org/W1602078796","https://openalex.org/W1650071176","https://openalex.org/W1796559407","https://openalex.org/W1969186119","https://openalex.org/W1975286948","https://openalex.org/W1988642505","https://openalex.org/W1996668544","https://openalex.org/W2001868457","https://openalex.org/W2002425091","https://openalex.org/W2003753063","https://openalex.org/W2023638076","https://openalex.org/W2029948740","https://openalex.org/W2039763834","https://openalex.org/W2045326192","https://openalex.org/W2061138851","https://openalex.org/W2074359677","https://openalex.org/W2096833188","https://openalex.org/W2100864874","https://openalex.org/W2103164681","https://openalex.org/W2107351840","https://openalex.org/W2112109045","https://openalex.org/W2126436716","https://openalex.org/W2129628945","https://openalex.org/W2505201213","https://openalex.org/W2535182880"],"related_works":["https://openalex.org/W2108770488","https://openalex.org/W2021517364","https://openalex.org/W1968954131","https://openalex.org/W2082636129","https://openalex.org/W2982557863","https://openalex.org/W2925112333","https://openalex.org/W2075449032","https://openalex.org/W2583998759","https://openalex.org/W2337498233","https://openalex.org/W3190027049"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":13}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}