{"id":"https://openalex.org/W4417292838","doi":"https://doi.org/10.4230/lipics.swat.2026.20","title":"Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs","display_name":"Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs","publication_year":2025,"publication_date":"2025-12-10","ids":{"openalex":"https://openalex.org/W4417292838","doi":"https://doi.org/10.4230/lipics.swat.2026.20"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2512.09899","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.09899","pdf_url":"https://arxiv.org/pdf/2512.09899","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.09899","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054080435","display_name":"Jie Gao","orcid":"https://orcid.org/0000-0003-0772-4530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Jie","raw_affiliation_strings":["Computer Science Department, Rutgers University, Piscataway, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0001-5083-6082","affiliations":[{"raw_affiliation_string":"Computer Science Department, Rutgers University, Piscataway, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022706035","display_name":"Pawe\u0142 Gawrychowski","orcid":"https://orcid.org/0000-0002-6993-5440"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gawrychowski, Pawe\u0142","raw_affiliation_strings":["Institute of Computer Science, University of Wroc\u0142aw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-6993-5440","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw, Poland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001427452","display_name":"Panos Giannopoulos","orcid":"https://orcid.org/0000-0002-6261-1961"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giannopoulos, Panos","raw_affiliation_strings":["Department of Computer Science, City St George\u2019s, University of London, UK"],"raw_orcid":"https://orcid.org/0000-0002-6261-1961","affiliations":[{"raw_affiliation_string":"Department of Computer Science, City St George\u2019s, University of London, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090438334","display_name":"Wolfgang Mulzer","orcid":"https://orcid.org/0000-0002-1948-5840"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mulzer, Wolfgang","raw_affiliation_strings":["Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1948-5840","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Freie Universit\u00e4t Berlin, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035118793","display_name":"Satyam Singh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singh, Satyam","raw_affiliation_strings":["Department of Computer Science, Aalto University, Finland"],"raw_orcid":"https://orcid.org/0009-0005-0873-066X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Finland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032979919","display_name":"Frank Staals","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Staals, Frank","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0004-8522-1351","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zehavi, Meirav","raw_affiliation_strings":["Institute for the Theory of Computing, Ben Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0002-3636-5322","affiliations":[{"raw_affiliation_string":"Institute for the Theory of Computing, Ben Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5587449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.41999998688697815,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.41999998688697815,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.17560000717639923,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06620000302791595,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7868000268936157},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.7437000274658203},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.7405999898910522},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6761999726295471},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5346999764442444},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5335000157356262},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4553999900817871},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4512999951839447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43630000948905945}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7868000268936157},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.7437000274658203},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.7405999898910522},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6761999726295471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6496999859809875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6381000280380249},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5346999764442444},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4553999900817871},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4512999951839447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4361000061035156},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.34060001373291016},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.32100000977516174},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.3116999864578247},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.29600000381469727},{"id":"https://openalex.org/C103368685","wikidata":"https://www.wikidata.org/wiki/Q638846","display_name":"Intersection number","level":3,"score":0.29589998722076416},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2750999927520752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2646999955177307},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2587999999523163},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2512.09899","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.09899","pdf_url":"https://arxiv.org/pdf/2512.09899","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26056","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.20","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.20/LIPIcs.SWAT.2026.20.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:openaccess.city.ac.uk:37392","is_oa":true,"landing_page_url":"https://openaccess.city.ac.uk/view/creators_id/panos=2Egiannopoulos.html>","pdf_url":"https://openaccess.city.ac.uk/id/eprint/37392/1/Max_clique_UDG-10.pdf","source":{"id":"https://openalex.org/S4306401940","display_name":"City Research Online (City University London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180825142","host_organization_name":"City, University of London","host_organization_lineage":["https://openalex.org/I180825142"],"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":"PeerReviewed"},{"id":"doi:10.48550/arxiv.2512.09899","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.09899","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":"doi:10.4230/lipics.swat.2026.20","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.20","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.09899","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.09899","pdf_url":"https://arxiv.org/pdf/2512.09899","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4417292838.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"\\emph{disk":[1],"graph}":[2],"is":[3,36,45,94],"the":[4,11,15,31,64,71,80],"intersection":[5],"graph":[6],"of":[7,18,33,66,73],"(closed)":[8],"disks":[9],"in":[10,23,50,57,89,96,137,167],"plane.":[12],"We":[13],"consider":[14],"classic":[16],"problem":[17,35,81],"finding":[19],"a":[20,24,133,152,158,163],"maximum":[21,135,165],"clique":[22,136,166],"disk":[25,29,42,74,121,144],"graph.":[26],"For":[27],"general":[28],"graphs,":[30,43,122],"complexity":[32],"this":[34,100],"still":[37],"open,":[38],"but":[39],"for":[40,70,111,119,143,174],"unit":[41,120],"it":[44,93],"well":[46],"known":[47],"to":[48,87],"be":[49,88],"P.":[51],"The":[52],"currently":[53],"fastest":[54],"algorithm":[55,126],"runs":[56],"time":[58,97,139,169],"$O(n^{7/3+":[59],"o(1)})$,":[60],"where":[61],"$n$":[62],"denotes":[63],"number":[65],"disks~\\cite{EspenantKM23,":[67],"keil_et_al:LIPIcs.SoCG.2025.63}.":[68],"Moreover,":[69],"case":[72],"graphs":[75,145],"with":[76,105,128,146,157],"$t$":[77,147],"distinct":[78,148],"radii,":[79,149],"has":[82],"also":[83],"recently":[84],"been":[85],"shown":[86],"XP.":[90],"More":[91],"specifically,":[92],"solvable":[95],"$O^*(n^{2t})$~\\cite{keil_et_al:LIPIcs.SoCG.2025.63}.":[98],"In":[99],"paper,":[101],"we":[102,123,150],"present":[103],"algorithms":[104],"improved":[106],"running":[107],"times":[108],"by":[109,115],"allowing":[110],"approximate":[112],"solutions":[113],"and":[114,141],"using":[116],"randomization:":[117],"-":[118,142],"give":[124,151],"an":[125],"that,":[127,156],"constant":[129,159],"success":[130,160],"probability,":[131,161],"computes":[132,162],"$(1-\\varepsilon)$-approximate":[134,164],"expected":[138,168],"$\\tilde{O}(n/\\varepsilon^2)$;":[140],"parameterized":[153],"approximation":[154],"scheme":[155],"$\\tilde{O}(f(t)\\cdot":[170],"(1/\\varepsilon)^{O(t)}":[171],"\\cdot":[172],"n)$,":[173],"some":[175],"(exponential)":[176],"function":[177],"$f(t)$.":[178]},"counts_by_year":[],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-12-12T00:00:00"}