{"id":"https://openalex.org/W4312792194","doi":"https://doi.org/10.1007/978-3-031-15914-5_13","title":"Finding k-Secluded Trees Faster","display_name":"Finding k-Secluded Trees Faster","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4312792194","doi":"https://doi.org/10.1007/978-3-031-15914-5_13"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-15914-5_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_13.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102922332","display_name":"Huib Donkers","orcid":"https://orcid.org/0000-0002-2767-8140"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Huib Donkers","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016857499","display_name":"Jari J. H. de Kroon","orcid":"https://orcid.org/0000-0003-3328-9712"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jari J. H. de Kroon","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102922332"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.48832555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9990000128746033,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/combinatorics","display_name":"Combinatorics","score":0.776413083076477},{"id":"https://openalex.org/keywords/supertree","display_name":"Supertree","score":0.728073239326477},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6849744319915771},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49534645676612854},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4901607930660248},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45125943422317505},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4452275335788727},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.44385796785354614},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.431417852640152},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42532384395599365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33611416816711426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2938954830169678},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.06325805187225342}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.776413083076477},{"id":"https://openalex.org/C55919133","wikidata":"https://www.wikidata.org/wiki/Q7644297","display_name":"Supertree","level":4,"score":0.728073239326477},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6849744319915771},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49534645676612854},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4901607930660248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45125943422317505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4452275335788727},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.44385796785354614},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.431417852640152},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42532384395599365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33611416816711426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2938954830169678},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.06325805187225342},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-15914-5_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire/72ca507f-e034-4fb3-8599-740d02c55eec","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/72ca507f-e034-4fb3-8599-740d02c55eec","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Donkers, H, Jansen, B M P & de Kroon, J J H 2022, Finding k-Secluded Trees Faster. in M A Bekos & M Kaufmann (eds), Graph-Theoretic Concepts in Computer Science : 48th International Workshop, WG 2022, T\u00fcbingen, Germany, June 22\u201324, 2022, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), vol. 13453, Springer, pp. 173-186, 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022, T\u00fcbingen, Germany, 22/06/22. https://doi.org/10.1007/978-3-031-15914-5_13","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-15914-5_13","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-15914-5_13","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-15914-5_13.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4312792194.pdf","grobid_xml":"https://content.openalex.org/works/W4312792194.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1495961053","https://openalex.org/W1532687347","https://openalex.org/W2087477484","https://openalex.org/W2121641644","https://openalex.org/W2157295389","https://openalex.org/W2559735673","https://openalex.org/W2886236358","https://openalex.org/W2899023405","https://openalex.org/W2914414140","https://openalex.org/W2999089703","https://openalex.org/W3026258808","https://openalex.org/W3036014615","https://openalex.org/W3098457490","https://openalex.org/W3103988870","https://openalex.org/W4283323639","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2040811618","https://openalex.org/W1981037505","https://openalex.org/W4250071703","https://openalex.org/W4212802173","https://openalex.org/W2053118947","https://openalex.org/W2732875821","https://openalex.org/W4256402898","https://openalex.org/W4242614412","https://openalex.org/W2170787151","https://openalex.org/W2533812722"],"abstract_inverted_index":{"Abstract":[0],"We":[1,34,136],"revisit":[2],"the":[3,42,87,91,98,117,128,138,155,165],"k":[4,32,79,121,147],"-Secluded":[5],"Tree":[6],"problem.":[7],"Given":[8],"a":[9,20,36,57,72,78,103,112,161],"vertex-weighted":[10],"undirected":[11],"graph":[12],"G":[13],",":[14,54],"its":[15],"objective":[16],"is":[17],"to":[18,110,116,140,153],"find":[19],"maximum-weight":[21,146],"induced":[22],"subtree":[23],"T":[24,94,132],"whose":[25],"open":[26,88,129],"neighborhood":[27,89,118,130],"has":[28],"size":[29],"at":[30],"most":[31],".":[33,95],"present":[35],"fixed-parameter":[37],"tractable":[38],"algorithm":[39,76,139],"that":[40,106,114],"solves":[41],"problem":[43],"in":[44,86,164],"time":[45,60],"$$2^{\\mathcal":[46],"{O}":[47,52],"(k":[48],"\\log":[49],"k)}\\cdot":[50],"n^{\\mathcal":[51],"(1)}$$":[53],"improving":[55],"on":[56,84],"double-exponential":[58],"running":[59,167],"from":[61,71],"earlier":[62],"work":[63],"by":[64,82],"Golovach,":[65],"Heggernes,":[66],"Lima,":[67],"and":[68],"Montealegre.":[69],"Starting":[70],"single":[73],"vertex,":[74],"our":[75],"grows":[77],"-secluded":[80,122,148],"tree":[81,93],"branching":[83,99],"vertices":[85],"of":[90,119,131,144,157],"current":[92],"To":[96],"bound":[97],"depth,":[100],"we":[101],"prove":[102],"structural":[104],"result":[105],"can":[107],"be":[108],"used":[109],"identify":[111],"vertex":[113,163],"belongs":[115],"any":[120],"supertree":[123],"$$T'":[124],"\\supseteq":[125],"T$$":[126],"once":[127],"becomes":[133],"sufficiently":[134],"large.":[135],"extend":[137],"enumerate":[141],"compact":[142],"descriptions":[143],"all":[145],"trees,":[149],"which":[150],"allows":[151],"us":[152],"count":[154],"number":[156],"such":[158],"trees":[159],"containing":[160],"specified":[162],"same":[166],"time.":[168]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}