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

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.

E. Arkin, A. Efrat, G. Hart, I. Kostitsyna, A. Kröller, J. Mitchell, and V. Polishchuk. FUN, volume 7288 of Lecture Notes in Computer Science, page 16-27. Springer, (2012)

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 M Pechtl

Esther M Thahabi

Brian Arkins

Esther Richthofen

Esther Menzel

Other publications of authors with the same name

Optimal Covering Tours with Turn CostsE. Arkin, M. Bender, E. Demaine, S. Fekete, J. Mitchell, and S. Sethia. (June 2005)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 Snowblower ProblemE. Arkin, M. Bender, J. Mitchell, and V. Polishchuk. CoRR, (2006)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)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)A note on orientations of mixed graphs.E. Arkin, and R. Hassin. Discret. Appl. Math., 116 (3): 271-278 (2002)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. SoCG, volume 34 of LIPIcs, page 658-673. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Lawnmower Problem.E. Arkin, S. Fekete, and J. Mitchell. CCCG, page 461-466. University of Waterloo, (1993)Algorithms for two-box covering.E. Arkin, G. Barequet, and J. Mitchell. SCG, page 459-467. ACM, (2006)

BibSonomy

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

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.

Please choose a person to relate this publication to

Esther M Pechtl

Esther M Thahabi

Brian Arkins

Esther Richthofen

Esther Menzel

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Arkin, Esther M."

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.

Please choose a person to relate this publication to

Esther M Pechtl

Esther M Thahabi

Brian Arkins

Esther Richthofen

Esther Menzel

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

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.