22 citations · 22 across the 2 of their papers we have counts for
2 papers
cs.DS2003
Optimal Covering Tours with Turn Costs
Esther M. Arkin, Michael A. Bender, Erik D. Demaine +3
We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it swee…
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…