Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

This publication has 9 references indexed in Scilit:

• Lower bounds and parallel algorithms for planar orthogonal grid drawings
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Planar orthogonal drawings of graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A new method for planar graph drawings on a grid (abstract)
  ACM SIGACT News, 1993
• How to draw a series-parallel digraph
  Published by Springer Nature ,1992
• Planar grid embedding in linear time
  IEEE Transactions on Circuits and Systems, 1989
• Incremental planarity testing
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Algorithms for plane representations of acyclic digraphs
  Theoretical Computer Science, 1988
• On Embedding a Graph in the Grid with the Minimum Number of Bends
  SIAM Journal on Computing, 1987
• On minimal‐node‐cost planar embeddings
  Networks, 1984