{"id":"https://openalex.org/W4415746961","doi":"https://doi.org/10.1007/s00454-025-00793-8","title":"Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time","display_name":"Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time","publication_year":2025,"publication_date":"2025-10-31","ids":{"openalex":"https://openalex.org/W4415746961","doi":"https://doi.org/10.1007/s00454-025-00793-8"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-025-00793-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-025-00793-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-025-00793-8.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete &amp; Computational Geometry","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/s00454-025-00793-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072487585","display_name":"Sujoy Bhore","orcid":"https://orcid.org/0000-0003-0104-1659"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sujoy Bhore","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0003-0104-1659","affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071390048","display_name":"Martin N\u00f6llenburg","orcid":"https://orcid.org/0000-0003-0454-3937"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Martin N\u00f6llenburg","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0003-0454-3937","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030799674","display_name":"Csaba D. T\u00f3th","orcid":"https://orcid.org/0000-0002-8769-3190"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]},{"id":"https://openalex.org/I157638225","display_name":"California State University, Northridge","ror":"https://ror.org/005f5hv41","country_code":"US","type":"education","lineage":["https://openalex.org/I157638225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Csaba D. T\u00f3th","raw_affiliation_strings":["Department of Computer Science, Tufts University, Medford, MA, USA","Department of Mathematics, California State University Northridge, Los Angeles, CA, United States"],"raw_orcid":"https://orcid.org/0000-0002-8769-3190","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Department of Mathematics, California State University Northridge, Los Angeles, CA, United States","institution_ids":["https://openalex.org/I157638225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022996610","display_name":"Jules Wulms","orcid":"https://orcid.org/0000-0002-9314-8260"},"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":"Jules Wulms","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-9314-8260","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022996610"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53013777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"75","issue":"2","first_page":"391","last_page":"430"},"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.542900025844574,"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.542900025844574,"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.061900001019239426,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.0430000014603138,"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/set","display_name":"Set (abstract data type)","score":0.6629999876022339},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6366999745368958},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.626800000667572},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4828000068664551},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4749000072479248},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4327999949455261},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.39959999918937683},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.3993000090122223},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3808000087738037}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6744999885559082},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6629999876022339},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6366999745368958},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.626800000667572},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5109000205993652},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4828000068664551},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4749000072479248},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44839999079704285},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4327999949455261},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.39959999918937683},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3993000090122223},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3792000114917755},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.328000009059906},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.3228999972343445},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.31470000743865967},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2980000078678131},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C191948623","wikidata":"https://www.wikidata.org/wiki/Q1307800","display_name":"Unit sphere","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25619998574256897}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00454-025-00793-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-025-00793-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-025-00793-8.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/e63e5e3a-8863-41fb-a0b3-ff2834c206eb","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/e63e5e3a-8863-41fb-a0b3-ff2834c206eb","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bhore, S, N\u00f6llenburg, M, T\u00f3th, C D & Wulms, J 2026, 'Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time', Discrete and Computational Geometry, vol. 75, no. 2, pp. 391-430. https://doi.org/10.1007/s00454-025-00793-8","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00454-025-00793-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-025-00793-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-025-00793-8.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8138404185","display_name":null,"funder_award_id":"NSF DMS-2154347","funder_id":"https://openalex.org/F4320337380","funder_display_name":"Division of Mathematical Sciences"}],"funders":[{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415746961.pdf","grobid_xml":"https://content.openalex.org/works/W4415746961.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W596522316","https://openalex.org/W942005541","https://openalex.org/W1417332038","https://openalex.org/W1510609119","https://openalex.org/W1985758609","https://openalex.org/W2026653490","https://openalex.org/W2028738060","https://openalex.org/W2031149390","https://openalex.org/W2063572899","https://openalex.org/W2069532962","https://openalex.org/W2077735330","https://openalex.org/W2094511120","https://openalex.org/W2100961486","https://openalex.org/W2110282707","https://openalex.org/W2123702669","https://openalex.org/W2139349113","https://openalex.org/W2167815360","https://openalex.org/W2341957977","https://openalex.org/W2401610261","https://openalex.org/W2610183793","https://openalex.org/W2624483937","https://openalex.org/W2981835202","https://openalex.org/W3037420592","https://openalex.org/W3042219960","https://openalex.org/W3044973706","https://openalex.org/W3118289634","https://openalex.org/W3170397716","https://openalex.org/W3198861270","https://openalex.org/W3215321597","https://openalex.org/W4284696322","https://openalex.org/W4289784571","https://openalex.org/W4300926135","https://openalex.org/W4312740989","https://openalex.org/W4406143073","https://openalex.org/W4406151871"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1,295],"fundamental":[2],"question":[3,77],"is":[4,34,55,214,285,342],"whether":[5],"one":[6,266,284,337],"can":[7,40,145,262],"maintain":[8,41,217,275],"a":[9,18,29,110,124,140,202,276,286,290,328,334],"maximum":[10,44,113,142,232,291],"independent":[11,45,114,143,233,267,279,292,340],"set":[12,30,46,115,127,144,204,234,268],"in":[13,24,47,71,105,116,134,178,210,235,336],"polylogarithmic":[14,117],"update":[15,49,61,120,150,238],"time":[16,62,151],"for":[17,28,78,100,123,201,301],"dynamic":[19,38,97,126,203,296,314],"collection":[20],"of":[21,31,81,102,128,131,175,205,207,278,289,338],"geometric":[22,82],"objects":[23,174],"Euclidean":[25],"space.":[26],"Already,":[27],"intervals,":[32,86],"it":[33,213,272],"known":[35],"that":[36,108,139,261],"no":[37],"algorithm":[39,99,255],"an":[42],"exact":[43],"sublinear":[48,237],"time.":[50,121],"Therefore,":[51],"the":[52,58,94,106,135,185,190,193,211,282,313],"typical":[53],"objective":[54],"to":[56,74,172,216,269,274,325],"explore":[57],"trade-off":[59],"between":[60],"and":[63,89,165,192,308,322],"solution":[64],"size.":[65],"Substantial":[66],"efforts":[67],"have":[68],"been":[69],"made":[70],"recent":[72,249],"years":[73],"understand":[75],"this":[76],"various":[79],"families":[80],"objects,":[83],"such":[84],"as":[85],"hypercubes,":[87],"hyperrectangles,":[88],"fat":[90,173],"objects.":[91],"We":[92],"present":[93],"first":[95],"fully":[96,125],"approximation":[98,186,288],"disks":[101,130,206,302],"arbitrary":[103],"radii":[104],"plane":[107],"maintains":[109],"constant-factor":[111,287],"approximate":[112],"expected":[118],"amortized":[119],"Moreover,":[122],"n":[129],"unit":[132,208],"radius":[133,209],"plane,":[136,212],"we":[137,197],"show":[138],"12-approximate":[141],"be":[146],"maintained":[147],"with":[148],"worst-case":[149],"$$O(\\log":[152],"n)$$":[153],"<mml:math":[154,220],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[155,221],"<mml:mrow>":[156,222],"<mml:mi>O</mml:mi>":[157,223],"<mml:mo>(</mml:mo>":[158,224],"<mml:mo>log</mml:mo>":[159],"<mml:mi>n</mml:mi>":[160],"<mml:mo>)</mml:mo>":[161,228],"</mml:mrow>":[162,229],"</mml:math>":[163,230],",":[164,183],"optimal":[166],"output-sensitive":[167],"reporting.":[168],"This":[169],"result":[170],"generalizes":[171,312],"comparable":[176],"sizes":[177],"any":[179],"fixed":[180],"dimension":[181,191],"d":[182],"where":[184,281],"ratio":[187],"depends":[188],"on":[189,247],"fatness":[194],"parameter.":[195],"Further,":[196],"note":[198],"that,":[199],"even":[200],"impossible":[215],"$$O(1+\\varepsilon":[218],")$$":[219],"<mml:mn>1</mml:mn>":[225],"<mml:mo>+</mml:mo>":[226],"<mml:mi>\u03b5</mml:mi>":[227],"-approximate":[231],"truly":[236],"time,":[239],"under":[240],"standard":[241],"complexity":[242],"assumptions.":[243],"Our":[244],"results":[245],"build":[246],"two":[248],"technical":[250],"tools:":[251],"(i)":[252],"The":[253],"MIX":[254],"by":[256,303,319],"Cardinal":[257],"et":[258,305],"al.":[259,306],"(2021)":[260],"smoothly":[263],"transition":[264],"from":[265],"another;":[270],"hence":[271],"suffices":[273],"family":[277],"sets":[280,341],"largest":[283],"set.":[293],"(ii)":[294],"nearest/farthest":[297],"neighbor":[298],"data":[299,317],"structure":[300,318],"Kaplan":[304],"(2020)":[307],"Liu":[309],"(2022),":[310],"which":[311],"convex":[315],"hull":[316],"Chan":[320],"(2010),":[321],"allows":[323],"us":[324],"quickly":[326],"find":[327],"\u201creplacement\u201d":[329],"disk":[330,335],"(if":[331],"any)":[332],"when":[333],"our":[339],"deleted.":[343]},"counts_by_year":[],"updated_date":"2026-03-07T13:37:22.277990","created_date":"2025-10-10T00:00:00"}