|
Planar Graphs
R. Jayakumar, K. Thulasiraman and M. N. S. Swamy, “O(N2) Algorithms for Graph Planarization”, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. CAD-8, March, 1989, pp. 257-267.
K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, “Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering”, IEEE Trans. on Circuits and Systems, Vol. CAS-35, March 1988, pp. 334-344. Also see K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, “Planar Embedding: A Linear Time-Algorithm for Vertex Placement and Edge Ordering”, Proc. IEEE Intl. Symp. on Circuits and Systems, San Jose, May 1986..
K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, “On Maximal Planarization of Non-Planar Graphs”, IEEE Trans. on Circuits and Systems, Vol. CAS-33, Aug. 1986, pp. 843- 844. Also see K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, “An Optimal Algorithm for Maximal Planarization of Non-Planar Graphs”, Proc. IEEE Intl. Symp. on Circuits and Systems, San Jose, May 1986.