Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrierMoses CharikarShay Solomon2018ICALP 2018Conference paper
Tighter connections between formula-SAT and shaving logsAmir AbboudKarl Bringmann2018ICALP 2018Conference paper
Fully dynamic MIS in uniformly sparse graphsKrzysztof OnakBaruch Schieberet al.2018ICALP 2018Conference paper