Home  Issues  Aims and Scope  Instructions for Authors 
DOI: 10.7155/jgaa.00106
TwoLayer Planarization: Improving on Parameterized Algorithmics
Vol. 9, no. 2, pp. 205238, 2005. Regular paper.
Abstract A bipartite graph is biplanar if the vertices can be
placed on two parallel lines in the plane such that there are
no edge crossings when edges are drawn as straightline segments connecting vertices on one line to vertices on the other line.
We study two problems:
