Selected papers that cite this one
- K. Mehlhorn and P. Mutzel. On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica, 16(2):233-242, August 1996.
- Bojan Mohar. Embedding graphs in an arbitrary surface in linear time. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 392-397, Philadelphia, Pennsylvania, 22-24 May 1996.