Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Arkin, Esther M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scandinavian thins on top of cake: New and improved algorithms for stacking and packing
Helmut Alt
,
Esther M. Arkin
,
Alon Efrat
,
George Hart
,
Ferran Hurtado
,
Irina Kostitsyna
,
Alexander Kröller
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
Theory of Computing Systems
54
(4), 2014, pp. 689-714
Convex transversals
Esther M. Arkin
,
Claudia Dieckmann
,
Christian Knauer
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
,
Schlipf
,
Lena
,
Shang Yang
Lecture Notes in Computer Science
6844
, 2011, pp. 49-60
Geometric stable roommates
Esther M. Arkin
,
Sang Won Bae
,
Alon Efrat
,
Kazuya Okamoto
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
Information Processing Letters
109
(4), 2009, pp. 219-224
Capturing crossings: Convex hulls of segment and plane intersections
Esther M. Arkin
,
Joseph S.B. Mitchell
,
Jack Snoeyink
Information Processing Letters
107
(5), 2008, pp. 194-197
The Freeze-Tag Problem: How to wake up a swarm of robots
Esther M. Arkin
,
Michael A. Bender
,
Sándor P. Fekete
,
Joseph S.B. Mitchell
,
Martin Skutella
Algorithmica
46
(2), 2006, pp. 193-221
Approximations for minimum and min-max vehicle routing problems
Esther M. Arkin
,
Refael Hassin
,
Asaf Levin
Journal of Algorithms
59
(1), 2006, pp. 1-18
Optimal covering tours with turn costs
Esther M. Arkin
,
Michael A. Bender
,
Erik D. Demaine
,
Sándor P. Fekete
,
Joseph S.B. Mitchell
,
Saurabh Sethia
SIAM Journal on Computing
35
(3), 2005-2006, pp. 531-566
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
Esther M. Arkin
,
Refael Hassin
,
Shlomi Rubinstein
,
Maxim Sviridenko
Algorithmica
39
(2), 2004, pp. 175-187
Improved approximation algorithms for the freeze-tag problem
Esther M. Arkin
,
Michael A. Bender
,
Dongdong Ge
,
Simai He
,
Joseph S.B. Mitchell
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 295-303
The Lazy Bureaucrat scheduling Problem
Esther M. Arkin
,
Michael A. Bender
,
Joseph S.B. Mitchell
,
Steven S. Skiena
Information and Computation
184
(1), 2003, pp. 129-146
Minimum-link watchman tours
Esther M. Arkin
,
Joseph S.B. Mitchell
,
Christine D. Piatko
Information Processing Letters
86
(4), 2003, pp. 203-207
Approximations for Maximum Transportation Problem With Permutable Supply Vector and other capacitated Star Packing problems
Esther M. Arkin
,
Refael Hassin
,
Shlomi Rubinstein
,
Maxim Sviridenko
Lecture Notes in Computer Science
2368
, 2002, pp. 280-287
A note on orientations of mixed graphs
Esther M. Arkin
,
Refael Hassin
Discrete Applied Mathematics
116
(3), 2002, pp. 271-278
Analysis of heuristics for the Freeze-Tag Problem
Marcelo O. Sztainberg
,
Esther M. Arkin
,
Michael A. Bender
,
Joseph S.B. Mitchell
Lecture Notes in Computer Science
2368
, 2002, pp. 270-279
When can you fold a map?
Esther M. Arkin
,
Michael A. Bender
,
Erik D. Demaine
,
Martin L. Demaine
,
Joseph S.B. Mitchell
,
Saurabh Sethia
,
Steven S. Skiena
Lecture Notes in Computer Science
2125
, 2001, pp. 401-413
On the reflexivity of point sets
Esther M. Arkin
,
Sándor P. Fekete
,
Ferran Hurtado
,
Joseph S.B. Mitchell
,
Marc Noy
,
Vera Sacristán
,
Saurabh Sethia
Lecture Notes in Computer Science
2125
, 2001, pp. 192-204
Approximating the maximum quadratic assignment problem
Esther M. Arkin
,
Refael Hassin
,
Maxim Sviridenko
Information Processing Letters
77
(1), 2001, pp. 13-16
Minimum-diameter covering problems
Esther M. Arkin
,
Refael Hassin
Networks
36
(3), 2000, pp. 147-155
The Lazy Bureaucrat scheduling problem
Esther M. Arkin
,
Michael A. Bender
,
Joseph S.B. Mitchell
,
Steven S. Skiena
Lecture Notes in Computer Science
1663
, 1999, pp. 122-133
On the maximum scatter Traveling Salesperson Problem
Esther M. Arkin
,
Yi-Jen Chiang
,
Joseph S.B. Mitchell
,
Steven S. Skiena
,
Tae-Cheon Yang
SIAM Journal on Computing
29
(2), 1999, pp. 515-544
On the maximum scatter TSP
Esther M. Arkin
,
Yi-Jen Chiang
,
Joseph S.B. Mitchell
,
Steven S. Skiena
,
Tae-Cheon Yang
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 211-220
Restricted delivery problems on a network
Esther M. Arkin
,
Refael Hassin
,
Limor Klein
Networks
29
(4), 1997, pp. 205-216
On local search for weighted
k
-set packing
Esther M. Arkin
,
Refael Hassin
Lecture Notes in Computer Science
1284
, 1997, pp. 13-22
On minimum-area hulls
Esther M. Arkin
,
Yi-Jen Chiang
,
Martin Held
,
Joseph S.B. Mitchell
,
Vera Sacristan
,
Steven S. Skiena
,
Tae-Cheon Yang
Lecture Notes in Computer Science
1136
, 1996, pp. 334-348
Optimization problems related to zigzag pocket machining
Esther M. Arkin
,
Martin Held
,
Christopher L. Smith
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 419-428
Seiten 1
2
>