Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
2-Restricted extensions of partial embeddings of graphs
European Journal of Combinatorics - Special issue: Topological graph theory II
Errors in graph embedding algorithms
Journal of Computer and System Sciences
Hi-index | 0.00 |