New blog post: Laminar 3-separators,

In it, I describe my new SODA paper with Bruce Reed, “Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time”,, 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).

Sign in to participate in the conversation

A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.

Use \( and \) for inline LaTeX, and \[ and \] for display mode.