New blog post: Laminar 3-separators, https://11011110.github.io/blog/2018/10/20/laminar-3-separators.html

In it, I describe my new SODA paper with Bruce Reed, “Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time”, https://arxiv.org/abs/1810.07825, and how it's possible for an algorithm that works only on planar graphs to be useful as a subroutine for a different algorithm on nonplanar graphs (hint: they're not the same graphs).