Fun with Algorithms, 4 conf., FUN 2007(LNCS4475, Springer, 2007)(ISBN 9783540729136)(281s)_CsLn_

On Embedding a Graph in the Grid with the Maximum Number of Bends 1311. Rahman, M.S., Nakano, S.-I., Nishizeki, T.: A linear algorithm for bend-optimal orthogonaldrawings of triconnected cubic plane graphs. J. Graph Algorithms Appl. 3(4), 31–62 (1999)12. Tamassia, R.: New layout techniques for entity-relationship diagrams. In: Proc. 4th Internat.Conf. on Entity-Relationship Approach, pp. 304–311 (1985)13. Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAMJ. Comput. 16(3), 421–444 (1987)14. Tamassia, R., Di Battista, G., Batini, C.: Automatic graph drawing and readability of diagrams.IEEE Trans. Syst. Man. Cybern. SMC-18(1), 61–79 (1988)15. Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. CircuitsSyst. CAS-36(9), 1230–1234 (1989)16. Tamassia, R., Tollis, I.G., Vitter, J.S.: Lower bounds and parallel algorithms for planar orthogonalgrid drawings. In: Proc. IEEE Symposium on Parallel and Distributed Processing,pp. 386–393 (1991)17. Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J. Comput. 14,355–372 (1985)