{"id":"https://openalex.org/W4323366496","doi":"https://doi.org/10.4230/lipics.swat.2026.21","title":"Dynamic MIS Revisited: Incremental, Fault Tolerant and Fully Dynamic","display_name":"Dynamic MIS Revisited: Incremental, Fault Tolerant and Fully Dynamic","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4323366496","doi":"https://doi.org/10.4230/lipics.swat.2026.21"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26057","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.21","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.21","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100693679","display_name":"Manoj Gupta","orcid":"https://orcid.org/0000-0002-2248-8700"},"institutions":[{"id":"https://openalex.org/I27674431","display_name":"Indian Institute of Technology Gandhinagar","ror":"https://ror.org/0036p5w23","country_code":"IN","type":"education","lineage":["https://openalex.org/I27674431"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Gupta, Manoj","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Gandhinagar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Gandhinagar, India","institution_ids":["https://openalex.org/I27674431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100733891","display_name":"Shahbaz Khan","orcid":"https://orcid.org/0000-0001-7715-0603"},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Khan, Shahbaz","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, India"],"raw_orcid":"https://orcid.org/0000-0001-9352-0088","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, India","institution_ids":["https://openalex.org/I154851008"]}]},{"author_position":"last","author":{"id":null,"display_name":"Surendra, Madhu","orcid":null},"institutions":[{"id":"https://openalex.org/I154851008","display_name":"Indian Institute of Technology Roorkee","ror":"https://ror.org/00582g326","country_code":"IN","type":"education","lineage":["https://openalex.org/I154851008"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Surendra, Madhu","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, India","institution_ids":["https://openalex.org/I154851008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.00072328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T11478","display_name":"Caching and Content Delivery","score":0.9976999759674072,"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/T11478","display_name":"Caching and Content Delivery","score":0.9976999759674072,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.989300012588501,"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/amortized-analysis","display_name":"Amortized analysis","score":0.6959746479988098},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5962308645248413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5831836462020874},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5481376051902771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5314860343933105},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5281498432159424},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.5257467031478882},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5244360566139221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47850242257118225},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4778956174850464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46408388018608093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4486609995365143},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4197350740432739},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4166235029697418},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3571424186229706},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.26427119970321655}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6959746479988098},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5962308645248413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5831836462020874},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5481376051902771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5314860343933105},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5281498432159424},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.5257467031478882},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5244360566139221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47850242257118225},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4778956174850464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46408388018608093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4486609995365143},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4197350740432739},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4166235029697418},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3571424186229706},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26427119970321655},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26057","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.21","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.21","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:26057","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.21","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4387401430","https://openalex.org/W2546514055","https://openalex.org/W2074380092","https://openalex.org/W2106457067","https://openalex.org/W2951652158","https://openalex.org/W1513944945","https://openalex.org/W1934874173","https://openalex.org/W2795587979","https://openalex.org/W4323366496","https://openalex.org/W4301960897"],"abstract_inverted_index":{"Given":[0],"a":[1,9,17,41,179],"dynamic":[2,136,164,185,216],"graph":[3],"G,":[4],"we":[5,60],"aim":[6],"to":[7,221],"maintain":[8],"maximal":[10],"independent":[11],"set":[12],"(MIS).":[13],"This":[14],"problem":[15],"admits":[16],"deterministic":[18,63],"solution":[19],"in":[20,89,110,142,218],"O(m^{2/3})":[21,143],"time":[22,49],"[SOSA21],":[23,169],"while":[24],"randomized":[25],"algorithms":[26,73,177],"for":[27,51,74,210,214],"oblivious":[28],"adversary":[29],"take":[30],"O(polylog":[31],"n)":[32],"[FOCS19]":[33],"time.":[34,93,146],"Recently,":[35],"Bernstein":[36],"et":[37],"al.":[38],"[SODA26]":[39],"proved":[40],"conditional":[42],"lower":[43],"bound":[44],"of":[45,68,119],"\u03a9(n^{1-o(1)})":[46],"amortized":[47,91,144],"update":[48,92,145],"even":[50,154],"incremental":[52,69,148,173,224],"MIS":[53,82,102,130,217,225],"with":[54,158],"adaptive":[55,160],"adversary.":[56,161],"In":[57],"this":[58],"paper,":[59],"establish":[61],"similar":[62],"bounds":[64,213],"through":[65],"the":[66,78,101,117,167,190,198,212,219,223],"lens":[67],"and":[70,76,140,170,174],"fault":[71,175],"tolerant":[72,176],"MIS,":[75],"show":[77],"following:":[79],"1)":[80],"Incremental:":[81],"can":[83,103,131],"be":[84,104,132,208],"maintained":[85,133],"under":[86,134],"edge":[87,108,137],"insertions":[88],"O(\u221am)":[90],"2)":[94],"Fault":[95],"Tolerant:":[96],"Using":[97],"O(m)":[98],"preprocessing":[99],"time,":[100,113],"reported":[105],"after":[106],"k":[107],"deletions":[109],"O(k+":[111],"\u0305{n}\u00b2)":[112],"where":[114],"\u0305{n}":[115],"is":[116,150],"number":[118],"vertices":[120],"on":[121,155],"which":[122],"deleted":[123],"edges":[124],"are":[125],"incident.":[126],"3)":[127],"Fully":[128],"Dynamic:":[129],"fully":[135,163,184,215],"updates":[138],"(insertions":[139],"deletions)":[141],"Our":[147,162],"result":[149,165],"thus":[151],"polynomially":[152],"optimal":[153],"allowing":[156],"randomization":[157],"an":[159],"matches":[166],"state-of-the-art":[168],"uses":[171],"our":[172,183],"as":[178],"black":[180],"box.":[181],"Although":[182],"algorithm":[186],"does":[187],"not":[188],"improve":[189],"existing":[191],"bounds,":[192],"it":[193],"provides":[194],"additional":[195],"insights":[196,205],"into":[197],"harder":[199],"edge-insertion":[200],"case.":[201],"We":[202],"believe":[203],"these":[204],"may":[206],"potentially":[207],"useful":[209],"improving":[211],"future":[220],"match":[222],"bounds.":[226]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-12T08:23:45.883708","created_date":"2023-03-08T00:00:00"}