{"id":"https://openalex.org/W1615046544","doi":"https://doi.org/10.1007/978-3-642-11269-0_7","title":"On Finding Directed Trees with Many Leaves","display_name":"On Finding Directed Trees with Many Leaves","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1615046544","doi":"https://doi.org/10.1007/978-3-642-11269-0_7","mag":"1615046544"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11269-0_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_7","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://hal-lirmm.ccsd.cnrs.fr/lirmm-00432919","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088651105","display_name":"Jean Daligault","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean Daligault","raw_affiliation_strings":["Laboratoire d'Informatique de Robotique et de Micro\u00e9lectronique de Montpellier"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique de Robotique et de Micro\u00e9lectronique de Montpellier","institution_ids":["https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033238040","display_name":"St\u00e9phan Thomass\u00e9","orcid":"https://orcid.org/0000-0002-7090-1790"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"St\u00e9phan Thomass\u00e9","raw_affiliation_strings":["Algorithmes, Graphes et Combinatoire"],"affiliations":[{"raw_affiliation_string":"Algorithmes, Graphes et Combinatoire","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088651105"],"corresponding_institution_ids":["https://openalex.org/I4210101743"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9457,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.9436765,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"86","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8198812007904053},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7609529495239258},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6730775237083435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5910242795944214},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.586740255355835},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5707339644432068},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5070478916168213},{"id":"https://openalex.org/keywords/numbering","display_name":"Numbering","score":0.4812045395374298},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.437737375497818},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.42278367280960083},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41509541869163513},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40381526947021484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.244184672832489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19662001729011536}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8198812007904053},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7609529495239258},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6730775237083435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5910242795944214},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.586740255355835},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5707339644432068},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5070478916168213},{"id":"https://openalex.org/C191916993","wikidata":"https://www.wikidata.org/wiki/Q362019","display_name":"Numbering","level":2,"score":0.4812045395374298},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.437737375497818},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.42278367280960083},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41509541869163513},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40381526947021484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.244184672832489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19662001729011536}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-11269-0_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_7","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:HAL:lirmm-00432919v1","is_oa":true,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432919","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IWPEC: International Workshop on Parameterized and Exact Computation, Sep 2009, Copenhagen, Denmark. pp.86-97, ⟨10.1007/978-3-642-11269-0_7⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:lirmm-00432919v1","is_oa":true,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432919","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IWPEC: International Workshop on Parameterized and Exact Computation, Sep 2009, Copenhagen, Denmark. pp.86-97, ⟨10.1007/978-3-642-11269-0_7⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1510700297","https://openalex.org/W1517036688","https://openalex.org/W1539910521","https://openalex.org/W1570425181","https://openalex.org/W1661831896","https://openalex.org/W1728611673","https://openalex.org/W1974096415","https://openalex.org/W2035040468","https://openalex.org/W2040813792","https://openalex.org/W2045349136","https://openalex.org/W2055314845","https://openalex.org/W2078178103","https://openalex.org/W2083082533","https://openalex.org/W2083748805","https://openalex.org/W2107372402","https://openalex.org/W2111132249","https://openalex.org/W2112451853","https://openalex.org/W2116539983","https://openalex.org/W2138156539","https://openalex.org/W2169262928","https://openalex.org/W2715404671","https://openalex.org/W2913688336","https://openalex.org/W3001416644","https://openalex.org/W4232188574","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2363199028","https://openalex.org/W2987887460","https://openalex.org/W4255598955","https://openalex.org/W4300501056","https://openalex.org/W2765600275","https://openalex.org/W2953710272","https://openalex.org/W3088611359","https://openalex.org/W3006501763","https://openalex.org/W2372392972","https://openalex.org/W1643271191"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}