{"id":"https://openalex.org/W2133106928","doi":"https://doi.org/10.1007/978-3-642-11269-0_13","title":"An Exact Algorithm for the Maximum Leaf Spanning Tree Problem","display_name":"An Exact Algorithm for the Maximum Leaf Spanning Tree Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2133106928","doi":"https://doi.org/10.1007/978-3-642-11269-0_13","mag":"2133106928"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11269-0_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_13","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015688812","display_name":"Henning Fernau","orcid":"https://orcid.org/0000-0002-4444-3220"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henning Fernau","raw_affiliation_strings":["Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106182311","display_name":"Joachim Kneis","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joachim Kneis","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine - Metz, 57045, Metz Cedex 01, France","Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine - Metz, 57045, Metz Cedex 01, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine - Metz, 57045, Metz Cedex 01, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire d'Informatique Th\u00e9orique et Appliqu\u00e9e, Universit\u00e9 Paul Verlaine - Metz, 57045, Metz Cedex 01, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076092166","display_name":"Alexander Langer","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Langer","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070492372","display_name":"Mathieu Liedloff","orcid":"https://orcid.org/0000-0003-2518-606X"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Liedloff","raw_affiliation_strings":["Laboratoire d\u2019Informatique Fondamentale d\u2019Orl\u00e9ans, Universit\u00e9 d\u2019Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans, Universit\u00e9 d'Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Fondamentale d\u2019Orl\u00e9ans, Universit\u00e9 d\u2019Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]},{"raw_affiliation_string":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans, Universit\u00e9 d'Orl\u00e9ans, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034140735","display_name":"Daniel Raible","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Raible","raw_affiliation_strings":["Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Trier, FB 4\u2014Abteilung Informatik, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062653045","display_name":"Peter Rossmanith","orcid":"https://orcid.org/0000-0003-0177-8028"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Rossmanith","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5015688812"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.5616,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95585809,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T12288","display_name":"Optimization and Search Problems","score":0.9904000163078308,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9878000020980835,"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/spanning-tree","display_name":"Spanning tree","score":0.7246229648590088},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6918129920959473},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6515867710113525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6281198263168335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5263439416885376},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46945327520370483},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4666110873222351},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4513120949268341},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44964537024497986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.448544442653656},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.43612948060035706},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.426360547542572},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4198932647705078},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3836613893508911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35508424043655396}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7246229648590088},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6918129920959473},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6515867710113525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6281198263168335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5263439416885376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46945327520370483},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4666110873222351},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4513120949268341},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44964537024497986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.448544442653656},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.43612948060035706},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.426360547542572},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4198932647705078},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3836613893508911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35508424043655396},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"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":10,"locations":[{"id":"doi:10.1007/978-3-642-11269-0_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_13","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.155.3940","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-lti.informatik.rwth-aachen.de/~langer/pub/maxleaf-iwpec09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.4593","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/iwpec09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.4217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.4217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lita.sciences.univ-metz.fr/~kratsch/publications/maxleaf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.938.3123","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.938.3123","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Henning_Fernau/publication/220992922_An_Exact_Algorithm_for_the_Maximum_Leaf_Spanning_Tree_Problem/links/02e7e525c4dd74a9eb000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.942.7890","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.942.7890","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Henning_Fernau/publication/220154628_An_exact_algorithm_for_the_Maximum_Leaf_Spanning_Tree_problem/links/004635166dbac34333000000.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.954.3134","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.954.3134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Henning_Fernau/publication/225234550_An_Exact_Algorithm_for_the_Maximum_Leaf_Spanning_Tree_Problem/links/0912f50e499cee0bfb000000.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00460824v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00460824","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IWPEC'2009 : 4th International Workshop on Parameterized and Exact Computation, Sep 2009, Copenhagen, Denmark. pp.161-172, &#x27E8;10.1007/978-3-642-11269-0_13&#x27E9;","raw_type":"Conference papers"},{"id":"pmh:oai:publications.rwth-aachen.de:118930","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/118930","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Parameterized and exact computation : 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised selected papers / Jianer Chen; Fedor V. Fomin (eds.)<br/>4. international workshop, IWPEC 2009, Copenhagen, Denmark, 2009-09-10 - 2009-09-11","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:170156","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/170156","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical computer science 412(45), 6290-6302 (2011). doi:10.1016/j.tcs.2011.07.011","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1517042931","https://openalex.org/W1565265107","https://openalex.org/W1572923929","https://openalex.org/W1581222813","https://openalex.org/W1598441350","https://openalex.org/W1987233075","https://openalex.org/W2011039300","https://openalex.org/W2040813792","https://openalex.org/W2066904980","https://openalex.org/W2089718638","https://openalex.org/W2107372402","https://openalex.org/W2115327685","https://openalex.org/W2126976589","https://openalex.org/W2138156539","https://openalex.org/W2152619617","https://openalex.org/W2155984879","https://openalex.org/W2170778679","https://openalex.org/W2561675875","https://openalex.org/W2950610954","https://openalex.org/W4285719527","https://openalex.org/W6631662886"],"related_works":["https://openalex.org/W2035613592","https://openalex.org/W2024884029","https://openalex.org/W2376814941","https://openalex.org/W4380840098","https://openalex.org/W4289083261","https://openalex.org/W2907926545","https://openalex.org/W3019213358","https://openalex.org/W2138987445","https://openalex.org/W2803460775","https://openalex.org/W387669780"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}