{"id":"https://openalex.org/W7166870692","doi":"https://doi.org/10.4230/lipics.icalp.2026.21","title":"Geometric Optimization Parameterized by Piercing Complexity","display_name":"Geometric Optimization Parameterized by Piercing Complexity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166870692","doi":"https://doi.org/10.4230/lipics.icalp.2026.21"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26410","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.21/LIPIcs.ICALP.2026.21.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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.21/LIPIcs.ICALP.2026.21.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000126726","display_name":"Aritra Banik","orcid":"https://orcid.org/0000-0002-7544-6125"},"institutions":[{"id":"https://openalex.org/I163389970","display_name":"National Institute of Science Education and Research","ror":"https://ror.org/02r2k1c68","country_code":"IN","type":"education","lineage":["https://openalex.org/I163389970","https://openalex.org/I200207707"]},{"id":"https://openalex.org/I200207707","display_name":"Homi Bhabha National Institute","ror":"https://ror.org/02bv3zr67","country_code":"IN","type":"education","lineage":["https://openalex.org/I200207707"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Banik, Aritra","raw_affiliation_strings":["National Institute of Science Education and Research, Bhubaneswar, India","Homi Bhabha National Institute, Training School Complex, Anushakti Nagar, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0002-7544-6125","affiliations":[{"raw_affiliation_string":"National Institute of Science Education and Research, Bhubaneswar, India","institution_ids":["https://openalex.org/I163389970"]},{"raw_affiliation_string":"Homi Bhabha National Institute, Training School Complex, Anushakti Nagar, Mumbai, India","institution_ids":["https://openalex.org/I200207707"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108123578","display_name":"Rajiv Raman","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Raman, Rajiv","raw_affiliation_strings":["IIIT-Delhi, India"],"raw_orcid":"https://orcid.org/0009-0000-8013-9421","affiliations":[{"raw_affiliation_string":"IIIT-Delhi, India","institution_ids":["https://openalex.org/I119939252","https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111453426","display_name":"Saurabh Ray","orcid":null},"institutions":[{"id":"https://openalex.org/I120250893","display_name":"New York University Abu Dhabi","ror":"https://ror.org/00e5k0821","country_code":"AE","type":"education","lineage":["https://openalex.org/I120250893","https://openalex.org/I57206974"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Ray, Saurabh","raw_affiliation_strings":["NYU Abu Dhabi, United Arab Emirates"],"raw_orcid":"https://orcid.org/0009-0005-6708-125X","affiliations":[{"raw_affiliation_string":"NYU Abu Dhabi, United Arab Emirates","institution_ids":["https://openalex.org/I120250893"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"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.79338321,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.38940000534057617,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.38940000534057617,"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/T12176","display_name":"Optimization and Packing Problems","score":0.15880000591278076,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.11649999767541885,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7868000268936157},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5198000073432922},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5196999907493591},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5128999948501587},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5103999972343445},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.48669999837875366},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.47269999980926514},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4487000107765198},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.42649999260902405},{"id":"https://openalex.org/keywords/geometric-shape","display_name":"Geometric shape","score":0.41499999165534973}],"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6013000011444092},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5198000073432922},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5128999948501587},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5103999972343445},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.48669999837875366},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.47269999980926514},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.42649999260902405},{"id":"https://openalex.org/C7305733","wikidata":"https://www.wikidata.org/wiki/Q207961","display_name":"Geometric shape","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C104065381","wikidata":"https://www.wikidata.org/wiki/Q1002535","display_name":"Geometric modeling","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3869999945163727},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.38510000705718994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37880000472068787},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.3499000072479248},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C136520226","wikidata":"https://www.wikidata.org/wiki/Q302814","display_name":"Geometric data analysis","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C40319758","wikidata":"https://www.wikidata.org/wiki/Q5535477","display_name":"Geometric design","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C4107886","wikidata":"https://www.wikidata.org/wiki/Q906377","display_name":"Discrete geometry","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2808000147342682},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.28049999475479126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C20729856","wikidata":"https://www.wikidata.org/wiki/Q2078279","display_name":"Geometric programming","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2694999873638153},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.2639000117778778},{"id":"https://openalex.org/C192368570","wikidata":"https://www.wikidata.org/wiki/Q1789829","display_name":"Digital geometry","level":5,"score":0.2630000114440918},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C181095308","wikidata":"https://www.wikidata.org/wiki/Q1541599","display_name":"Geometric primitive","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26410","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.21/LIPIcs.ICALP.2026.21.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":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.21","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26410","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.21/LIPIcs.ICALP.2026.21.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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166870692.pdf","grobid_xml":"https://content.openalex.org/works/W7166870692.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Packing":[0],"and":[1,14,26,70,90,94,100,106,109,115,213,225,270,274,292,304,322],"Covering":[2],"problems":[3],"with":[4,256,307],"geometric":[5,67,98,151,248,327,344],"regions":[6,21,134,252],"in":[7,54,85,135,183,253],"the":[8,20,136,202,226,254,265,286],"plane":[9,255],"have":[10,23],"been":[11,24],"extensively":[12],"studied":[13],"several":[15,66,297],"notions":[16,328],"of":[17,19,34,125,133,150,195,343],"\"complexity\"":[18],"involved":[22],"developed":[25],"exploited":[27],"to":[28,50,62,164,211,237],"obtain":[29,262],"good":[30],"approximation":[31,52,244,276],"algorithms.":[32],"Examples":[33],"such":[35,329],"complexity":[36,318],"measures":[37],"are":[38,81,208],"VC-dimension,":[39],"union":[40],"complexity,":[41,43],"shallow-cell":[42],"fatness,":[44],"etc.":[45],"While":[46],"these":[47,79,126],"restrictions":[48],"lead":[49,61],"constant-factor":[51,275],"algorithms":[53,93,277],"many":[55,131],"cases,":[56,300],"they":[57],"typically":[58],"do":[59],"not":[60],"PTASs.":[63],"In":[64],"fact,":[65],"Set":[68,73,269,271,303,305],"Cover":[69,272,306],"Discrete":[71,267],"Independent":[72,268,302],"variants":[74],"remain":[75],"APX-hard":[76],"even":[77],"when":[78],"parameters":[80],"small,":[82],"as":[83,319,330],"demonstrated":[84],"earlier":[86],"work":[87,315],"by":[88,107,142,154,189],"Chan":[89],"Grant":[91],"(Exact":[92],"APX-hardness":[95,231],"results":[96,283],"for":[97,113,218,246,264,278,289,296,346],"packing":[99],"covering":[101],"problems.":[102,250],"Comput.":[103,222],"Geom.,":[104,223],"2014),":[105],"Har-Peled":[108],"Quanrud":[110],"(Approximation":[111],"Algorithms":[112],"Polynomial-Expansion":[114],"Low-Density":[116],"Graphs.":[117],"SIAM":[118],"J.":[119],"Comput.,":[120],"2017).":[121],"A":[122,158,161,173],"key":[123],"feature":[124],"hardness":[127],"constructions":[128],"is":[129,162,187,236],"that":[130,239,335],"pairs":[132],"input":[137],"pierce":[138,165],"one":[139,177],"another.":[140],"Motivated":[141],"this":[143,337],"observation,":[144],"we":[145,180,261],"initiate":[146],"a":[147,166,192,257,320,340],"systematic":[148],"study":[149],"families":[152,241,291],"parameterized":[153],"their":[155,279],"piercing":[156,259,317],"complexity.":[157],"connected":[159,167,178],"region":[160,168,186],"said":[163],"B":[169,171],"if":[170],"\u29f5":[172],"has":[174],"more":[175],"than":[176],"component;":[179],"consider":[181],"instances":[182,345],"which":[184,347],"every":[185],"pierced":[188],"at":[190],"most":[191],"constant":[193,258],"number":[194],"others.":[196],"This":[197],"framework":[198],"smoothly":[199],"interpolates":[200],"between":[201],"classical":[203],"non-piercing":[204,290],"case-where":[205],"local-search":[206],"PTASs":[207,263,288,348],"known":[209,287],"due":[210],"Raman":[212],"Ray":[214],"(Constructing":[215],"Planar":[216],"Support":[217],"Non-Piercing":[219],"Regions,":[220],"Discret.":[221],"2020),":[224],"fully":[227],"general":[228],"case,":[229],"where":[230],"persists.":[232],"Our":[233],"main":[234],"contribution":[235],"show":[238],"bounded-piercing":[240],"admit":[242],"efficient":[243],"schemes":[245],"fundamental":[247],"optimization":[249],"For":[251],"bound,":[260],"(unweighted)":[266],"problems,":[273],"weighted":[280],"variants.":[281],"These":[282],"strictly":[284],"generalize":[285],"yield":[293],"improved":[294],"guarantees":[295],"long-standing":[298],"special":[299],"including":[301],"axis-parallel":[308],"rectangles":[309],"under":[310],"bounded":[311],"piercing.":[312],"Overall,":[313],"our":[314],"identifies":[316],"robust":[321],"expressive":[323],"topological":[324],"parameter-distinct":[325],"from":[326],"density":[331],"or":[332],"fatness-and":[333],"demonstrates":[334],"bounding":[336],"parameter":[338],"yields":[339],"broad":[341],"family":[342],"become":[349],"achievable.":[350]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}