Drawing clustered graphs of bounded width: https://11011110.github.io/blog/2019/10/07/drawing-clustered-graphs.html
New blog post about my new preprint with Da Lozza, Goodrich, and Gupta on clustered planarity, https://arxiv.org/abs/1910.02057. It won best paper at IPEC last month, but just in time: while it was in submission Fulek and Tóth put out their own preprint giving a polynomial time algorithm for clustered planarity without any dependence on width or other parameters.
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.