{"id":"https://openalex.org/W4390575705","doi":"https://doi.org/10.1137/1.9781611977912.15","title":"Tree Containment Above Minimum Degree is FPT","display_name":"Tree Containment Above Minimum Degree is FPT","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4390575705","doi":"https://doi.org/10.1137/1.9781611977912.15"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977912.15","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977912.15","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"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":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"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":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021164153","display_name":"Danil Sagunov","orcid":"https://orcid.org/0000-0003-3327-9768"},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Danil Sagunov","raw_affiliation_strings":["St. Petersburg Department of V.A. Steklov Institute of Mathematics, Russia"],"affiliations":[{"raw_affiliation_string":"St. Petersburg Department of V.A. Steklov Institute of Mathematics, Russia","institution_ids":["https://openalex.org/I2800906181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102983476","display_name":"Kirill Simonov","orcid":"https://orcid.org/0000-0001-9436-7310"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]},{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kirill Simonov","raw_affiliation_strings":["Hasso Plattner Institute, University of Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, University of Potsdam, Germany","institution_ids":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01089424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"366","last_page":"376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9951000213623047,"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.9951000213623047,"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.992900013923645,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9922000169754028,"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/combinatorics","display_name":"Combinatorics","score":0.80094313621521},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7354925274848938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6181631684303284},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5751248002052307},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5719762444496155},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5669413208961487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47687894105911255},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.45448824763298035},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.43353596329689026},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2797618508338928},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09687763452529907},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07251790165901184}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.80094313621521},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7354925274848938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6181631684303284},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5751248002052307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5719762444496155},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5669413208961487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47687894105911255},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.45448824763298035},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.43353596329689026},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2797618508338928},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09687763452529907},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07251790165901184},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611977912.15","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/1.9781611977912.15","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W2407611282"],"abstract_inverted_index":{"According":[0],"to":[1,58],"the":[2,26],"classic":[3],"Chv\u00e1tal's":[4,31],"Lemma":[5],"from":[6],"1977,":[7],"a":[8,41,55],"graph":[9,36],"of":[10,30,73],"minimum":[11],"degree":[12],"\u03b4(G)":[13,18,47],"contains":[14,54],"every":[15],"tree":[16,42],"on":[17,44],"+":[19,48],"1":[20],"vertices.":[21],"Our":[22],"main":[23],"result":[24],"is":[25],"following":[27],"algorithmic":[28],"\u201cextension\u201d":[29],"Lemma:":[32],"For":[33],"any":[34],"n-vertex":[35],"G,":[37],"integer":[38],"k,":[39],"and":[40],"T":[43],"at":[45],"most":[46],"k":[49,74],"vertices,":[50],"deciding":[51],"whether":[52],"G":[53],"subgraph":[56],"isomorphic":[57],"T,":[59],"can":[60],"be":[61],"done":[62],"in":[63],"time":[64],"f":[65,72],"(k)":[66],"\u00b7":[67],"nO(1)":[68],"for":[69],"some":[70],"function":[71],"only.":[75]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}