{"id":"https://openalex.org/W3112807772","doi":"https://doi.org/10.1137/20m1320870","title":"A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs","display_name":"A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3112807772","doi":"https://doi.org/10.1137/20m1320870","mag":"3112807772"},"language":"en","primary_location":{"id":"doi:10.1137/20m1320870","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1320870","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1320870","source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1320870","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S\u00e1ndor Kisfaludi-Bak","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":[],"affiliations":[]},{"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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom C. van der Zanden","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.445,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86549202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"49","issue":"6","first_page":"1291","last_page":"1331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9987000226974487,"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/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6985092163085938},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6838433146476746},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6426337957382202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6406097412109375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5682381987571716},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5039529204368591},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5031735301017761},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.47771167755126953},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.47157803177833557},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4669056534767151},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4577151834964752},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4528343677520752},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4489155411720276},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4284589886665344},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42652127146720886},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4165409803390503},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.40954917669296265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3620684742927551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27772998809814453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22398599982261658},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16679584980010986},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.13463819026947021},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.1319642961025238}],"concepts":[{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6985092163085938},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6838433146476746},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6426337957382202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6406097412109375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5682381987571716},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5039529204368591},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5031735301017761},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.47771167755126953},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.47157803177833557},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4669056534767151},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4577151834964752},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4528343677520752},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4489155411720276},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4284589886665344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42652127146720886},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4165409803390503},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.40954917669296265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3620684742927551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27772998809814453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22398599982261658},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16679584980010986},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.13463819026947021},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.1319642961025238},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1137/20m1320870","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1320870","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1320870","source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/c1ecad47-dd45-46b2-9ac4-bf29d30570fd","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/c1ecad47-dd45-46b2-9ac4-bf29d30570fd","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"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":"de Berg, M, Bodlaender, H L, Kisfaludi-Bak, S, Marx, D & van der Zanden, T C 2020, 'A FRAMEWORK FOR EXPONENTIAL-TIME-HYPOTHESIS-TIGHT ALGORITHMS AND LOWER BOUNDS IN GEOMETRIC INTERSECTION GRAPHS', Siam Journal on Computing, vol. 49, no. 6, pp. 1291-1331. https://doi.org/10.1137/20M1320870","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/08f084b6-8ee3-4e29-b22e-b8585f141f27","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/08f084b6-8ee3-4e29-b22e-b8585f141f27","pdf_url":"https://pure.tue.nl/ws/files/197811844/20m1320870.pdf","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":"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 2020, 'A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs', SIAM Journal on Computing, vol. 49, no. 6, pp. 1291-1331. https://doi.org/10.1137/20M1320870","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dspace.library.uu.nl:1874/412715","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/412715","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"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":"","raw_type":"Article"},{"id":"pmh:oai:figshare.com:article/24612516","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/A_Framework_for_Exponential-Time-Hypothesis_-_Tight_Algorithms_and_Lower_Bounds_in_Geometric_Intersection_Graphs/24612516","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:pure.mpg.de:item_3276320","is_oa":true,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0007-A582-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"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":"SIAM Journal on Computing","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/08f084b6-8ee3-4e29-b22e-b8585f141f27","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85099296030&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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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 2020, 'A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs', SIAM Journal on Computing, vol. 49, no. 6, pp. 1291-1331. https://doi.org/10.1137/20M1320870","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/08f084b6-8ee3-4e29-b22e-b8585f141f27","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/08f084b6-8ee3-4e29-b22e-b8585f141f27","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 49(6), 1291 - 1331. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.60882/cispa.24612516.v1","is_oa":true,"landing_page_url":"https://doi.org/10.60882/cispa.24612516.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050916","display_name":"CISPA Helmholtz Center","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1137/20m1320870","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1320870","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1320870","source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"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/G3413111253","display_name":null,"funder_award_id":"NETWORKS","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G4998108420","display_name":null,"funder_award_id":". 024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112807772.pdf","grobid_xml":"https://content.openalex.org/works/W3112807772.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W1491169489","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/W2005079828","https://openalex.org/W2009816066","https://openalex.org/W2012154006","https://openalex.org/W2016458081","https://openalex.org/W2020112047","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/W2187605032","https://openalex.org/W2296118781","https://openalex.org/W2313886575","https://openalex.org/W2607365952","https://openalex.org/W2795000954","https://openalex.org/W2896021245","https://openalex.org/W2914414140","https://openalex.org/W2918931394","https://openalex.org/W2951040439","https://openalex.org/W2951388475","https://openalex.org/W2963838695","https://openalex.org/W2964067126","https://openalex.org/W2979043732","https://openalex.org/W3037730538","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W3135652805","https://openalex.org/W2800485060","https://openalex.org/W4220735480","https://openalex.org/W3022168212","https://openalex.org/W4302399289","https://openalex.org/W1584965761","https://openalex.org/W2103112216","https://openalex.org/W2950413521","https://openalex.org/W3123958729","https://openalex.org/W2012427196"],"abstract_inverted_index":{"We":[0],"give":[1,75],"an":[2],"algorithmic":[3,108],"and":[4,15,56,100,117,136],"lower":[5,122,144],"bound":[6,123],"framework":[7,109,124],"that":[8],"facilitates":[9],"the":[10,76,88,97,104,147,153],"construction":[11],"of":[12,27,87,131,158],"subexponential":[13,79],"algorithms":[14,32,90],"matching":[16,142],"conditional":[17],"complexity":[18],"bounds.":[19],"It":[20],"can":[21],"be":[22],"applied":[23],"to":[24,68,140],"intersection":[25,83],"graphs":[26,132],"similarly-sized":[28],"fat":[29],"objects,":[30],"yielding":[31],"with":[33],"running":[34,65],"time":[35,149],"$2^{O(n^{1-1/d})}$":[36],"for":[37,43,53],"any":[38],"fixed":[39],"dimension":[40],"$d\\ge":[41],"2$":[42],"many":[44],"well-known":[45],"graph":[46,98],"problems,":[47,61],"including":[48],"Independent":[49],"Set,":[50],"$r$-Dominating":[51],"Set":[52],"constant":[54],"$r$,":[55],"Steiner":[57],"Tree.":[58],"For":[59],"most":[60,86],"we":[62,74],"get":[63],"improved":[64],"times":[66],"compared":[67],"prior":[69],"work;":[70],"in":[71,81,152],"some":[72],"cases,":[73],"first":[77],"known":[78],"algorithm":[80],"geometric":[82,105],"graphs.":[84,162],"Additionally,":[85],"obtained":[89],"are":[91],"representation-agnostic,":[92],"i.e.,":[93],"they":[94],"work":[95],"on":[96,112,127],"itself":[99],"do":[101],"not":[102],"require":[103],"representation.":[106],"Our":[107],"is":[110,125],"based":[111,126],"a":[113,128],"weighted":[114],"separator":[115],"theorem":[116],"various":[118],"treewidth":[119],"techniques.":[120],"The":[121],"constructive":[129],"embedding":[130],"into":[133],"$d$-dimensional":[134,159],"grids,":[135],"it":[137],"allows":[138],"us":[139],"derive":[141],"$2^{\\Omega(n^{1-1/d})}$":[143],"bounds":[145],"under":[146],"exponential":[148],"hypothesis":[150],"even":[151],"much":[154],"more":[155],"restricted":[156],"class":[157],"induced":[160],"grid":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}