A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs

Raphael Steiner. A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs. In Michael A. Bekos, Markus Chimani, editors, Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Volume 14466 of Lecture Notes in Computer Science, pages 133-140, Springer, 2023. [doi]

Abstract

Abstract is missing.