Selected open problems in graph drawing

Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, and Petra Mutzel
Proc. 11th Int. Symp. Graph Drawing (GD 2003), Lecture Notes in Computer Science 2912, Springer-Verlag, Sep 2003, pp. 515–539

Cited by:

• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Open problems wiki
• The three dimensional logic engine
• Drawing planar bipartite graphs with small area
• No-bend orthogonal drawings of series-parallel graphs
• On extending a partial straight-line drawing
• Complexity results for three-dimensional orthogonal graph drawing