{"id":"https://openalex.org/W2963740725","doi":"https://doi.org/10.1007/s00453-018-0479-5","title":"Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs","display_name":"Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs","publication_year":2018,"publication_date":"2018-07-16","ids":{"openalex":"https://openalex.org/W2963740725","doi":"https://doi.org/10.1007/s00453-018-0479-5","mag":"2963740725"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0479-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0479-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0479-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0479-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017472275","display_name":"G\u00e1bor Bacs\u00f3","orcid":null},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor Bacs\u00f3","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences, Kende u. 13\u201317, Budapest, 1111, Hungary","Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences, Kende u. 13\u201317, Budapest, 1111, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"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":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway","Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences, Kende u. 13\u201317, Budapest, 1111, Hungary","Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences, Kende u. 13\u201317, Budapest, 1111, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland","Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026437192","display_name":"\u0179solt Tuza","orcid":"https://orcid.org/0000-0003-3235-9221"},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]},{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Re\u00e1ltanoda u. 13\u201315, Budapest, 1053, Hungary","Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, Veszpr\u00e9m, 8200, Hungary","Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","Department of Computer Science and Systems Technology, University of Pannonia, Veszpr\u00e9m, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Re\u00e1ltanoda u. 13\u201315, Budapest, 1053, Hungary","institution_ids":["https://openalex.org/I127817813"]},{"raw_affiliation_string":"Department of Computer Science and Systems Technology, University of Pannonia, Egyetem u. 10, Veszpr\u00e9m, 8200, Hungary","institution_ids":["https://openalex.org/I140275651"]},{"raw_affiliation_string":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary","institution_ids":["https://openalex.org/I127817813"]},{"raw_affiliation_string":"Department of Computer Science and Systems Technology, University of Pannonia, Veszpr\u00e9m, Hungary","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Erik Jan van\u00a0Leeuwen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3584 CC, Utrecht, The Netherlands","Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3584 CC, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5059330513"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":3.009,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92706456,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"81","issue":"2","first_page":"421","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.8193222880363464},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.688643217086792},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6462729573249817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6423391103744507},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5796332359313965},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5054497718811035},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5040354132652283},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.482106477022171},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43577277660369873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32972127199172974},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2968745827674866},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1554255485534668}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8193222880363464},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.688643217086792},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6462729573249817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6423391103744507},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5796332359313965},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5054497718811035},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5040354132652283},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.482106477022171},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43577277660369873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32972127199172974},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2968745827674866},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1554255485534668}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-018-0479-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0479-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0479-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.sztaki.hu:9562","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/9562/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:real.mtak.hu:90072","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:eprints.sztaki.hu:9823","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/9823/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/382147","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/382147","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Algorithmica, 81(2), 421. Springer New York","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00453-018-0479-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0479-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0479-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1811664709","display_name":"Systematic mapping of the complexity landscape of hard algorithmic graph problems","funder_award_id":"725978","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G2710479047","display_name":"Cuts and decompositions: algorithms and combinatorial properties","funder_award_id":"714704","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G3592075253","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G4750090969","display_name":"Pareto-Optimal Parameterized Algorithms","funder_award_id":"715744","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963740725.pdf","grobid_xml":"https://content.openalex.org/works/W2963740725.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W968859509","https://openalex.org/W1482106463","https://openalex.org/W1521492695","https://openalex.org/W1534783476","https://openalex.org/W1963511606","https://openalex.org/W1963707128","https://openalex.org/W1969719208","https://openalex.org/W1995725694","https://openalex.org/W2001258629","https://openalex.org/W2011134696","https://openalex.org/W2015564725","https://openalex.org/W2048280336","https://openalex.org/W2063775175","https://openalex.org/W2071807296","https://openalex.org/W2072480005","https://openalex.org/W2100432797","https://openalex.org/W2125185305","https://openalex.org/W2187700168","https://openalex.org/W2249739104","https://openalex.org/W2484570912","https://openalex.org/W2594519958","https://openalex.org/W2610183793","https://openalex.org/W2914414140","https://openalex.org/W2949765771","https://openalex.org/W2953059252","https://openalex.org/W2962704386"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W3030122542","https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W1963654174","https://openalex.org/W1968027460","https://openalex.org/W1608132493","https://openalex.org/W1492613353","https://openalex.org/W1811247372","https://openalex.org/W2007607373"],"abstract_inverted_index":{"In":[0],"algorithmic":[1],"graph":[2],"theory,":[3],"a":[4,164,199],"classic":[5],"open":[6],"question":[7],"is":[8,116,130,145,168,172],"to":[9,187],"determine":[10],"the":[11,14,51,99,105,133,139,143,173,180,183,220,223,228,233],"complexity":[12],"of":[13,50,101,135,159,175,182,202,222,230,235],"Maximum":[15,120,176],"Independent":[16,121,177],"Set":[17,122,171,178,209],"problem":[18,144],"on":[19,25,32,56,88,123,153,210],"$$P_t$$":[20,124,154],"-free":[21,90,125,155],"graphs,":[22,163],"that":[23,109],"is,":[24,226],"graphs":[26,126,204,212],"not":[27],"containing":[28],"any":[29,111],"induced":[30],"path":[31],"t":[33],"vertices.":[34,136],"So":[35],"far,":[36],"polynomial-time":[37],"algorithms":[38,103],"are":[39,185],"known":[40],"only":[41],"for":[42,73,83,104,110,119,138,206],"$$t\\le":[43],"5$$":[44],"(Lokshtanov":[45],"et":[46,78],"al.,":[47],"in:":[48],"Proceedings":[49],"twenty-fifth":[52],"annual":[53],"ACM-SIAM":[54],"symposium":[55],"discrete":[57],"algorithms,":[58],"SODA":[59],"2014,":[60,66],"Portland,":[61],"OR,":[62],"USA,":[63],"January":[64],"5\u20137,":[65],"pp":[67],"570\u2013581,":[68],"2014),":[69],"and":[70],"an":[71,117],"algorithm":[72,82,118],"$$t=6$$":[74],"announced":[75],"recently":[76],"(Grzesik":[77],"al.":[79],"in":[80,132,147,161,216,219,227],"Polynomial-time":[81],"maximum":[84],"weight":[85],"independent":[86],"set":[87],"$${P}_6$$":[89],"graphs.":[91,156],"CoRR,":[92],"arXiv:1707.05491":[93],",":[94,114],"2017).":[95],"Here":[96],"we":[97,107],"study":[98],"existence":[100],"subexponential-time":[102],"problem:":[106],"show":[108],"$$t\\ge":[112],"1$$":[113],"there":[115],"whose":[127],"running":[128],"time":[129,152,166,217],"subexponential":[131,218],"number":[134,229,234],"Even":[137],"weighted":[140],"version":[141],"MWIS,":[142],"solvable":[146],"$$2^{\\mathcal":[148],"{O}(\\sqrt{tn":[149],"\\log":[150],"n})}$$":[151],"For":[157],"approximation":[158],"MIS":[160],"broom-free":[162],"similar":[165],"bound":[167],"proved.":[169],"Scattered":[170],"generalization":[174],"where":[179],"vertices":[181,231],"solution":[184],"required":[186],"be":[188,214],"at":[189,191],"distance":[190],"least":[192],"d":[193],"from":[194],"each":[195],"other.":[196],"We":[197],"give":[198],"complete":[200],"characterization":[201],"those":[203],"H":[205],"which":[207],"d-Scattered":[208],"H-free":[211],"can":[213],"solved":[215],"size":[221],"input":[224],"(that":[225],"plus":[232],"edges):":[236]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}