{"id":"https://openalex.org/W4228996779","doi":"https://doi.org/10.1007/s10878-022-00853-2","title":"Computing a maximum clique in geometric superclasses of disk graphs","display_name":"Computing a maximum clique in geometric superclasses of disk graphs","publication_year":2022,"publication_date":"2022-03-25","ids":{"openalex":"https://openalex.org/W4228996779","doi":"https://doi.org/10.1007/s10878-022-00853-2","pmid":"https://pubmed.ncbi.nlm.nih.gov/36258784"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-022-00853-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00853-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00853-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00853-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035090716","display_name":"Nicolas Grelier","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Nicolas Grelier","raw_affiliation_strings":["Department of Computer Science, ETH, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035090716"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.3046,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5802388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"44","issue":"4","first_page":"3106","last_page":"3135"},"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"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/unit-disk-graph","display_name":"Unit disk graph","score":0.7585265636444092},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.726283073425293},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7230152487754822},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6725927591323853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.560644268989563},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5223118662834167},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4955857992172241},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.47326281666755676},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.47294163703918457},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4622926414012909},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4575028717517853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43581992387771606},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.4337655007839203},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4282427430152893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2494402825832367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24223467707633972},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16401243209838867},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1620127558708191},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.059505462646484375}],"concepts":[{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.7585265636444092},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.726283073425293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7230152487754822},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6725927591323853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.560644268989563},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5223118662834167},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4955857992172241},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.47326281666755676},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.47294163703918457},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4622926414012909},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4575028717517853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43581992387771606},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.4337655007839203},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4282427430152893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2494402825832367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24223467707633972},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16401243209838867},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1620127558708191},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.059505462646484375},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"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/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10878-022-00853-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00853-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00853-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmid:36258784","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/36258784","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of combinatorial optimization","raw_type":null},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-022-00853-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-022-00853-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:9568498","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/9568498","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"J Comb Optim","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s10878-022-00853-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-022-00853-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-022-00853-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1727795598","display_name":null,"funder_award_id":"SNSF Project 200021E-171681","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4194657088","display_name":"Arrangements and Drawings (ArrDra)","funder_award_id":"171681","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G8158069009","display_name":null,"funder_award_id":"200021E-171681","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4228996779.pdf","grobid_xml":"https://content.openalex.org/works/W4228996779.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1511627217","https://openalex.org/W2003902046","https://openalex.org/W2049520215","https://openalex.org/W2063572899","https://openalex.org/W2086551550","https://openalex.org/W2115124828","https://openalex.org/W2149342630","https://openalex.org/W2792901515","https://openalex.org/W3082157295","https://openalex.org/W4228996779","https://openalex.org/W4238284510"],"related_works":["https://openalex.org/W1964113132","https://openalex.org/W2004663694","https://openalex.org/W4248583102","https://openalex.org/W3123003473","https://openalex.org/W4361825306","https://openalex.org/W2898526288","https://openalex.org/W77483341","https://openalex.org/W2078489643","https://openalex.org/W2168666129","https://openalex.org/W2025641440"],"abstract_inverted_index":{"Abstract":[0],"In":[1,85],"the":[2,30,49,75,90],"90\u2019s":[3],"Clark,":[4],"Colbourn":[5],"and":[6],"Johnson":[7],"wrote":[8],"a":[9,93,98],"seminal":[10],"paper":[11],"where":[12],"they":[13],"proved":[14],"that":[15],"maximum":[16,33,78],"clique":[17,34,79],"can":[18],"be":[19],"solved":[20],"in":[21,24,35,80],"polynomial":[22,66,94],"time":[23,67,95],"unit":[25,102],"disk":[26,72,103],"graphs.":[27,73,104],"Since":[28],"then,":[29],"complexity":[31,76],"of":[32,38,77,92,101,117],"intersection":[36,115],"graphs":[37,116],"d":[39],"-dimensional":[40],"(unit)":[41],"balls":[42],"has":[43],"been":[44],"investigated.":[45],"For":[46],"ball":[47],"graphs,":[48],"problem":[50],"is":[51],"NP-hard,":[52],"as":[53],"shown":[54],"by":[55],"Bonamy":[56],"et":[57],"al.":[58],"(FOCS":[59],"\u201918).":[60],"They":[61],"also":[62],"gave":[63],"an":[64,112],"efficient":[65],"approximation":[68],"scheme":[69],"(EPTAS)":[70],"for":[71,97,114],"However,":[74],"this":[81,86],"setting":[82],"remains":[83],"unknown.":[84],"paper,":[87],"we":[88,106],"show":[89],"existence":[91],"algorithm":[96],"geometric":[99],"superclass":[100],"Moreover,":[105],"give":[107],"partial":[108],"results":[109],"toward":[110],"obtaining":[111],"EPTAS":[113],"convex":[118],"pseudo-disks.":[119]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-16T08:24:45.110214","created_date":"2025-10-10T00:00:00"}