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

Some Lower Bounds on Geometric Separability Problems.

E. Arkin, F. Hurtado, J. Mitchell, C. Seara, and S. Skiena. Int. J. Comput. Geometry Appl., 16 (1): 1-26 (2006)

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

Matching Points into Noise Regions: Combinatorial Bounds and Algorithms.E. Arkin, K. Kedem, J. Mitchell, J. Sprinzak, and M. Werman. SODA, page 42-51. ACM/SIAM, (1991)An Efficiently Computable Metric for Comparing Polygonal Shapes.E. Arkin, L. Chew, D. Huttenlocher, K. Kedem, and J. Mitchell. SODA, page 129-137. SIAM, (1990)The freeze-tag problem: how to wake up a swarm of robots.E. Arkin, M. Bender, S. Fekete, J. Mitchell, and M. Skutella. SODA, page 568-577. ACM/SIAM, (2002)Approximating the maximum quadratic assignment problem.E. Arkin, and R. Hassin. SODA, page 889-890. ACM/SIAM, (2000)Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem.M. Sztainberg, E. Arkin, M. Bender, and J. Mitchell. IEEE Trans. Robotics, 20 (4): 691-701 (2004)Capturing crossings: Convex hulls of segment and plane intersections.E. Arkin, J. Mitchell, and J. Snoeyink. Inf. Process. Lett., 107 (5): 194-197 (2008)Shortest Path to a Segment and Quickest Visibility Queries.E. Arkin, A. Efrat, C. Knauer, J. Mitchell, V. Polishchuk, G. Rote, L. Schlipf, and T. Talvitie. Symposium on Computational Geometry, volume 34 of LIPIcs, page 658-673. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)Algorithms for two-box covering.E. Arkin, G. Barequet, and J. Mitchell. Symposium on Computational Geometry, page 459-467. ACM, (2006)Point Probe Decision Trees for Geometric Concept Classes.E. Arkin, M. Goodrich, J. Mitchell, D. Mount, C. Piatko, and S. Skiena. WADS, volume 709 of Lecture Notes in Computer Science, page 95-106. Springer, (1993)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)

PUMA

Disambiguation of "Arkin, Esther M."

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

Some Lower Bounds on Geometric Separability Problems.

Please choose a person to relate this publication to

Esther Blumendeller University of Stuttgart

M. Nudischer

M. Kratzer

M. Liewald

M. Fittingho

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Arkin, Esther M."

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Some Lower Bounds on Geometric Separability Problems.

Please choose a person to relate this publication to

Esther Blumendeller University of Stuttgart

M. Nudischer

M. Kratzer

M. Liewald

M. Fittingho

Other publications of authors with the same name

Disambiguation

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

Some Lower Bounds on Geometric Separability Problems.