Volume 10, Number 1, 2006
Special Issue on Selected Papers from the Engineering and Applications Track of the 12th Annual European Symposium on Algorithms (ESA 2004)
Volume 10, Number 2, 2006
: Upward Planar Drawings and Switch-regularity Heuristics.
: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.