{"id":"https://openalex.org/W7163894569","doi":"https://doi.org/10.4230/lipics.swat.2026.16","title":"Online Hitting Set for Axis-Aligned Squares","display_name":"Online Hitting Set for Axis-Aligned Squares","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163894569","doi":"https://doi.org/10.4230/lipics.swat.2026.16"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26052","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.16/LIPIcs.SWAT.2026.16.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.16/LIPIcs.SWAT.2026.16.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138131946","display_name":"Minati De","orcid":"https://orcid.org/0000-0002-1859-8800"},"institutions":[{"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":"De, Minati","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India"],"raw_orcid":"https://orcid.org/0000-0002-1859-8800","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138185266","display_name":"Satyam Singh","orcid":"https://orcid.org/0009-0005-0873-066X"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Singh, Satyam","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0009-0005-0873-066X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","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":"T\u00f3th, Csaba D.","raw_affiliation_strings":["Department of Mathematics, California State University Northridge, Los Angeles, CA, USA","Department of Computer Science, Tufts University, Medford, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8769-3190","affiliations":[{"raw_affiliation_string":"Department of Mathematics, California State University Northridge, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I157638225"]},{"raw_affiliation_string":"Department of Computer Science, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.94222276,"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/T12288","display_name":"Optimization and Search Problems","score":0.927299976348877,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.927299976348877,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.03370000049471855,"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.006500000134110451,"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.6389999985694885},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6172999739646912},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5227000117301941},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5097000002861023},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5087000131607056},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.5026999711990356},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.45910000801086426},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4578999876976013}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7050999999046326},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6389999985694885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6237999796867371},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6172999739646912},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5227000117301941},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5087000131607056},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.5026999711990356},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.45910000801086426},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4578999876976013},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.45750001072883606},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40869998931884766},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.400299996137619},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.38280001282691956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3781999945640564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35030001401901245},{"id":"https://openalex.org/C20625954","wikidata":"https://www.wikidata.org/wiki/Q543533","display_name":"Coplanarity","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.3018999993801117},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26052","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.16/LIPIcs.SWAT.2026.16.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.16","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.16","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:26052","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.16/LIPIcs.SWAT.2026.16.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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163894569.pdf","grobid_xml":"https://content.openalex.org/works/W7163894569.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,11,38,118],"set":[2,25,40,92],"P":[3,35],"of":[4,13,28,99,117],"n":[5],"points":[6,33],"in":[7,18,50,106,125],"the":[8,22,72,83,89,107,126],"plane":[9,127],"and":[10,128],"sequence":[12],"axis-aligned":[14],"squares":[15],"that":[16,54,94],"arrive":[17],"an":[19,60,130],"online":[20,23,90],"fashion,":[21],"hitting":[24,39,91],"problem":[26,93],"consists":[27],"maintaining,":[29],"by":[30],"adding":[31],"new":[32],"from":[34,76],"if":[36],"necessary,":[37],"H":[41],"\u2286":[42],"P,":[43],"which":[44],"contains":[45],"at":[46],"least":[47],"one":[48],"point":[49],"every":[51],"input":[52],"square":[53],"has":[55],"already":[56],"arrived.":[57],"We":[58,109],"present":[59],"O(log":[61,85],"n)-competitive":[62,86,132],"deterministic":[63],"algorithm":[64,87],"for":[65,88,96],"this":[66,81,112],"problem.":[67],"The":[68],"competitive":[69],"ratio":[70],"is":[71,82],"best":[73],"possible,":[74],"apart":[75],"constant":[77],"factors.":[78],"In":[79],"fact,":[80],"first":[84],"works":[95],"geometric":[97],"objects":[98],"arbitrary":[100],"sizes":[101],"(i.e.,":[102],"unbounded":[103],"scaling":[104],"factors)":[105],"plane.":[108],"further":[110],"generalize":[111],"result":[113],"to":[114],"positive":[115],"homothets":[116],"polygon":[119],"with":[120],"k":[121],"\u2265":[122],"3":[123],"vertices":[124],"provide":[129],"O(k\u00b2log":[131],"algorithm.":[133]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}