{"id":"https://openalex.org/W7163893543","doi":"https://doi.org/10.4230/lipics.swat.2026.40","title":"Maximum Independent Sets in Disk Graphs with Disks in Convex Position","display_name":"Maximum Independent Sets in Disk Graphs with Disks in Convex Position","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163893543","doi":"https://doi.org/10.4230/lipics.swat.2026.40"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26076","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.40/LIPIcs.SWAT.2026.40.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"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.40/LIPIcs.SWAT.2026.40.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138130564","display_name":"Anastasiia Tkachenko","orcid":"https://orcid.org/0009-0005-4716-1287"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tkachenko, Anastasiia","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA"],"raw_orcid":"https://orcid.org/0009-0005-4716-1287","affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138189402","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0001-8134-7409"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wang, Haitao","raw_affiliation_strings":["Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA"],"raw_orcid":"https://orcid.org/0000-0001-8134-7409","affiliations":[{"raw_affiliation_string":"Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.97198373,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"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.8151999711990356,"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.8151999711990356,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.06400000303983688,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03220000118017197,"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/convex-hull","display_name":"Convex hull","score":0.6462000012397766},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.552299976348877},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4903999865055084},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4763999879360199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4553000032901764},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4284000098705292},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40779998898506165},{"id":"https://openalex.org/keywords/output-sensitive-algorithm","display_name":"Output-sensitive algorithm","score":0.3456000089645386},{"id":"https://openalex.org/keywords/general-position","display_name":"General position","score":0.325300008058548}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7631000280380249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7134000062942505},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6462000012397766},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.552299976348877},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4903999865055084},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4763999879360199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4553000032901764},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4284000098705292},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3472000062465668},{"id":"https://openalex.org/C39132409","wikidata":"https://www.wikidata.org/wiki/Q7112860","display_name":"Output-sensitive algorithm","level":5,"score":0.3456000089645386},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.3084000051021576},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C64051489","wikidata":"https://www.wikidata.org/wiki/Q7104528","display_name":"Orthogonal convex hull","level":5,"score":0.29840001463890076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29490000009536743},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.29339998960494995},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.27410000562667847},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26010000705718994},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26076","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.40/LIPIcs.SWAT.2026.40.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":"doi:10.4230/lipics.swat.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.40","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:drops-oai.dagstuhl.de:26076","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.40/LIPIcs.SWAT.2026.40.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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163893543.pdf","grobid_xml":"https://content.openalex.org/works/W7163893543.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"a":[1,34,42,63,121,142,155],"set":[2,18,35,45,143],"\ud835\udc9f":[3,36],"of":[4,37,46,83,93,128,144,157],"disks":[5,31,69,92,112,146,159,168],"in":[6,62,66,71,107,147,169],"the":[7,14,29,68,80,108,116,138,162,170],"plane,":[8],"its":[9],"disk":[10,77],"graph":[11,15],"G(\ud835\udc9f)":[12,47],"is":[13,48,118],"with":[16],"vertex":[17],"\ud835\udc9f,":[19],"where":[20,111],"two":[21],"vertices":[22],"are":[23,70],"adjacent":[24],"if":[25,28],"and":[26,115],"only":[27],"corresponding":[30],"intersect.":[32],"Given":[33],"n":[38,145],"weighted":[39,109],"disks,":[40],"computing":[41],"maximum":[43],"independent":[44,123],"NP-hard.":[49],"In":[50],"this":[51,60],"paper,":[52],"we":[53,131],"present":[54],"an":[55,98,126,133,151],"O(n\u00b3log":[56],"n)-time":[57,135],"algorithm":[58,100,104,136],"for":[59,91,96,137],"problem":[61,140],"special":[64],"setting":[65,86],"which":[67,97],"convex":[72,81,148],"position,":[73],"meaning":[74],"that":[75,160],"every":[76],"appears":[78],"on":[79,141],"hull":[82],"\ud835\udc9f.":[84],"This":[85],"has":[87],"been":[88],"studied":[89],"previously":[90],"equal":[94],"radius,":[95],"O(n^{37/11})-time":[99],"was":[101],"known.":[102],"Our":[103],"also":[105],"works":[106],"case":[110],"have":[113],"weights":[114],"goal":[117],"to":[119],"compute":[120,154],"maximum-weight":[122],"set.":[124],"As":[125],"application":[127],"our":[129],"result,":[130],"obtain":[132],"O(n\u00b3log\u00b2":[134],"dispersion":[139],"position:":[149],"given":[150],"integer":[152],"k,":[153],"subset":[156],"k":[158],"maximizes":[161],"minimum":[163],"pairwise":[164],"distance":[165],"among":[166],"all":[167],"subset.":[171]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}