Follow

Drawing clustered graphs of bounded width: 11011110.github.io/blog/2019/1

New blog post about my new preprint with Da Lozza, Goodrich, and Gupta on clustered planarity, 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.

Sign in to participate in the conversation
Mathstodon

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!