22 citations · 24 across the 2 of their papers we have counts for
2 papers
cs.CG2003★ 2 cited
The Geometric Thickness of Low Degree Graphs
Christian A. Duncan, David Eppstein, Stephen G. Kobourov
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the g…
cs.CG2002★ 22 cited
On Simultaneous Graph Embedding
C. A. Duncan, A. Efrat, C. Erten +2
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given…