Michael Mitzenmacher blogs about SODA, SOSA, ALENEX, and ANALCO: http://mybiasedcoin.blogspot.com/2019/01/analco-sosa-soda-post.html

Michael was PC co-chair of SOSA (https://simplicityinalgorithms.com/), which I was skeptical about (shouldn't all the best algorithms be simple?), but the session I attended favorably impressed me. Here's an example, a simple algorithm for 2-approximating maximum genus oriented graph embedding (https://arxiv.org/abs/1501.07460): greedily remove 2-edge paths while preserving connectivity. #paths ≤ max genus ≤ 2⋅#paths.