{"id":"https://openalex.org/W2795065148","doi":"https://doi.org/10.1145/3188745.3188854","title":"A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs","display_name":"A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2795065148","doi":"https://doi.org/10.1145/3188745.3188854","mag":"2795065148"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.10633","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"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":"Mark de Berg","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands","Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"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"]},{"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":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University, Netherlands / Eindhoven University of Technology, Netherlands","Utrecht University"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Netherlands / Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370","https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"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"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE","NL"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor Kisfaludi-Bak","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands","Max-Planck-Society"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Max-Planck-Society","institution_ids":["https://openalex.org/I149899117"]}]},{"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/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":["Hungarian Academy of Sciences, Hungary","Hungarian Academy of Sciences, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Hungarian Academy of Sciences, Hungary","institution_ids":["https://openalex.org/I7597260"]},{"raw_affiliation_string":"Hungarian Academy of Sciences, Hungary#TAB#","institution_ids":["https://openalex.org/I7597260"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037940407","display_name":"Tom C. van der Zanden","orcid":"https://orcid.org/0000-0003-3080-3210"},"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"]},{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Tom C. van der Zanden","raw_affiliation_strings":["Utrecht University, Netherlands","Maastricht University"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Maastricht University","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.06620509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"77","issue":null,"first_page":"574","last_page":"586"},"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.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/treewidth","display_name":"Treewidth","score":0.6996616125106812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6325346827507019},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5728837847709656},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5344862937927246},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5054523944854736},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5012028217315674},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4856492280960083},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.48487839102745056},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4512348771095276},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.42152509093284607},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4117177724838257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4037030041217804},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3663962185382843},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3411022424697876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3052366375923157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26506689190864563},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14352792501449585},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.10186505317687988}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6996616125106812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6325346827507019},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5728837847709656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5344862937927246},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5054523944854736},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5012028217315674},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4856492280960083},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.48487839102745056},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4512348771095276},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.42152509093284607},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4117177724838257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4037030041217804},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3663962185382843},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3411022424697876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3052366375923157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26506689190864563},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14352792501449585},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10186505317687988},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/3188745.3188854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2b5bcba0-89be-4260-9f4b-b270d6ea5141","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2b5bcba0-89be-4260-9f4b-b270d6ea5141","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, Bodlaender, H L, Kisfaludi-Bak, S, Marx, D & van der Zanden, T C 2018, A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs. in STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., pp. 574-586, 50th Annual ACM Symposium on Theory of Computing, STOC 2018, Los Angeles, United States, 25/06/18. https://doi.org/10.1145/3188745.3188854","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1803.10633","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.10633","pdf_url":"https://arxiv.org/pdf/1803.10633","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/00a9406b-ca66-421d-a0cf-a10ae8abf22f","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/00a9406b-ca66-421d-a0cf-a10ae8abf22f","pdf_url":"https://research.tue.nl/nl/publications/00a9406b-ca66-421d-a0cf-a10ae8abf22f","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":"arXiv, 2018:1803.10633v1, 1 - 38. Cornell University Library","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/2b5bcba0-89be-4260-9f4b-b270d6ea5141","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85049877204&partnerID=8YFLogxK","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Berg, M, Bodlaender, H L, Kisfaludi-Bak, S, Marx, D & van der Zanden, T C 2018, A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs. in STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., pp. 574-586, 50th Annual ACM Symposium on Theory of Computing, STOC 2018, Los Angeles, United States, 25/06/18. https://doi.org/10.1145/3188745.3188854","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2b5bcba0-89be-4260-9f4b-b270d6ea5141","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2b5bcba0-89be-4260-9f4b-b270d6ea5141","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 574 - 586","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.1803.10633","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1803.10633","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2795065148","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1803.10633","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.10633","pdf_url":"https://arxiv.org/pdf/1803.10633","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1811664709","display_name":null,"funder_award_id":"725978","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1491169489","https://openalex.org/W1760079236","https://openalex.org/W1791386552","https://openalex.org/W1930019869","https://openalex.org/W1976120600","https://openalex.org/W1982180670","https://openalex.org/W1982378203","https://openalex.org/W1985572324","https://openalex.org/W1985758609","https://openalex.org/W1995725694","https://openalex.org/W2003979824","https://openalex.org/W2009816066","https://openalex.org/W2012154006","https://openalex.org/W2016458081","https://openalex.org/W2020112047","https://openalex.org/W2022459721","https://openalex.org/W2038643780","https://openalex.org/W2047033531","https://openalex.org/W2053991811","https://openalex.org/W2055336889","https://openalex.org/W2055691408","https://openalex.org/W2063572899","https://openalex.org/W2066104460","https://openalex.org/W2066577300","https://openalex.org/W2087083200","https://openalex.org/W2087818742","https://openalex.org/W2115124828","https://openalex.org/W2122238039","https://openalex.org/W2140049544","https://openalex.org/W2157529519","https://openalex.org/W2180988813","https://openalex.org/W2187605032","https://openalex.org/W2295092485","https://openalex.org/W2296118781","https://openalex.org/W2401985258","https://openalex.org/W2569665689","https://openalex.org/W2607365952","https://openalex.org/W2795000954","https://openalex.org/W2883666115","https://openalex.org/W2896021245","https://openalex.org/W2902378521","https://openalex.org/W2914414140","https://openalex.org/W2918931394","https://openalex.org/W2963838695","https://openalex.org/W2964067126","https://openalex.org/W2979043732","https://openalex.org/W3009318933","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W1595877531","https://openalex.org/W1567597677","https://openalex.org/W2951040439","https://openalex.org/W3080569475","https://openalex.org/W3036315659","https://openalex.org/W2084471831","https://openalex.org/W3082111916","https://openalex.org/W606113","https://openalex.org/W2774158340","https://openalex.org/W2617873545","https://openalex.org/W3118880490","https://openalex.org/W2901691491","https://openalex.org/W2184232537","https://openalex.org/W1570588782","https://openalex.org/W2090339428","https://openalex.org/W570339359","https://openalex.org/W2497890598","https://openalex.org/W3104783836","https://openalex.org/W1522171595","https://openalex.org/W2797680869"],"abstract_inverted_index":{"We":[0],"give":[1,82],"an":[2],"algorithmic":[3,111],"and":[4,14,63,120],"lower-bound":[5],"framework":[6,112],"that":[7],"facilitates":[8],"the":[9,83,95,100],"construction":[10],"of":[11,27,32,94],"subexponential":[12,86],"algorithms":[13,38,97],"matching":[15],"conditional":[16],"complexity":[17],"bounds.":[18],"It":[19],"can":[20],"be":[21],"applied":[22],"to":[23,75],"a":[24,116],"wide":[25],"range":[26],"geometric":[28,89,108],"intersection":[29,90],"graphs":[30],"(intersections":[31],"similarly":[33],"sized":[34],"fat":[35],"objects),":[36],"yielding":[37],"with":[39],"running":[40,72],"time":[41],"2O(n1\u22121/d)":[42],"for":[43,49,60],"any":[44,107],"fixed":[45],"dimension":[46],"d\u2265":[47],"2":[48],"many":[50],"well":[51],"known":[52,85],"graph":[53,101],"problems,":[54,68],"including":[55],"Independent":[56],"Set,":[57],"r-Dominating":[58],"Set":[59],"constant":[61],"r,":[62],"Steiner":[64],"Tree.":[65],"For":[66],"most":[67,93],"we":[69,81],"get":[70],"improved":[71],"times":[73],"compared":[74],"prior":[76],"work;":[77],"in":[78,88],"some":[79],"cases,":[80],"first":[84],"algorithm":[87],"graphs.":[91],"Additionally,":[92],"obtained":[96],"work":[98],"on":[99,115],"itself,":[102],"i.e.,":[103],"do":[104],"not":[105],"require":[106],"information.":[109],"Our":[110],"is":[113],"based":[114],"weighted":[117],"separator":[118],"theorem":[119],"various":[121],"treewidth":[122],"techniques.":[123]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}