Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The Shortest Separating Cycle Problem.

E. Arkin, J. Gao, A. Hesterberg, J. Mitchell, and J. Zeng. WAOA, volume 10138 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Esther Blumendeller University of Stuttgart

M. Nudischer

M. Kratzer

M. Liewald

M. Fittingho

Other publications of authors with the same name

Geometric Knapsack Problems.E. Arkin, S. Khuller, and J. Mitchell. Algorithmica, 10 (5): 399-427 (1993)Optimization Problems Related to Zigzag Pocket Machining.E. Arkin, M. Held, and C. Smith. Algorithmica, 26 (2): 197-236 (2000)Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.E. Arkin, R. Hassin, S. Rubinstein, and M. Sviridenko. Algorithmica, 39 (2): 175-187 (2004)Decision trees for geometric models.E. Arkin, H. Meijer, J. Mitchell, D. Rappaport, and S. Skiena. Int. J. Comput. Geometry Appl., 8 (3): 343-364 (1998)Recognizing polygonal parts from width measurements.E. Arkin, M. Held, J. Mitchell, and S. Skiena. Comput. Geom., 9 (4): 237-246 (1998)A note on orientations of mixed graphs.E. Arkin, and R. Hassin. Discrete Applied Mathematics, 116 (3): 271-278 (2002)Letter to the editor: an algorithm for reducing tool retractions in zigzag pocket machining.M. Held, and E. Arkin. Computer-Aided Design, 32 (10): 617-619 (2000)Optimal Covering Tours with Turn Costs.E. Arkin, M. Bender, E. Demaine, S. Fekete, J. Mitchell, and S. Sethia. SIAM J. Comput., 35 (3): 531-566 (2005)On the Maximum Scatter Traveling Salesperson Problem.E. Arkin, Y. Chiang, J. Mitchell, S. Skiena, and T. Yang. SIAM J. Comput., 29 (2): 515-544 (1999)Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.V. Leung, E. Arkin, M. Bender, D. Bunde, J. Johnston, A. Lal, J. Mitchell, C. Phillips, and S. Seiden. CLUSTER, page 296-304. IEEE Computer Society, (2002)