New lower bounds for orthogonal graph drawings

This publication has 9 references indexed in Scilit:

• A better heuristic for orthogonal graph drawings
  Published by Springer Nature ,1994
• Drawing planar graphs using the lmc-ordering
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• Lower bounds for planar orthogonal drawings of graphs
  Information Processing Letters, 1991
• Planar grid embedding in linear time
  IEEE Transactions on Circuits and Systems, 1989
• Rectilinear planar layouts and bipolar orientations of planar graphs
  Discrete & Computational Geometry, 1986
• A unified approach to visibility representations of planar graphs
  Discrete & Computational Geometry, 1986
• On minimal‐node‐cost planar embeddings
  Networks, 1984
• New lower bound techniques for VLSI
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
• Universality considerations in VLSI circuits
  IEEE Transactions on Computers, 1981