The paper "Fully Dynamic Approximate Maximum Matching and Vertex Cover in O(\log^3 n) Worst Case Update Time" by Sayan Bhattacharya, Monika Henzinger and Danupon Nanongkai and the paper "Local Flow Partitioning for Faster Edge Connectivity" by Monika Henzinger, Satish Rao and Di Wang and the paper "Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs" by Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer and Nikos Parotsidis have been accepted to SODA 2017
