| 1987 |
|---|
| 7 | | Leonidas J. Guibas,
John Hershberger,
Daniel Leven,
Micha Sharir,
Robert Endre Tarjan:
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.
Algorithmica 2: 209-233 (1987) |
| 6 | | Daniel Leven,
Micha Sharir:
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.
Discrete & Computational Geometry 2: 255-270 (1987) |
| 5 | | Daniel Leven,
Micha Sharir:
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.
Discrete & Computational Geometry 2: 9-31 (1987) |
| 4 | | Daniel Leven,
Micha Sharir:
An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers.
J. Algorithms 8(2): 192-215 (1987) |
| 1986 |
|---|
| 3 | | Micha Sharir,
Richard Cole,
Klara Kedem,
Daniel Leven,
Richard Pollack,
Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences
FOCS 1986: 77-86 |
| 2 | EE | Leonidas J. Guibas,
John Hershberger,
Daniel Leven,
Micha Sharir,
Robert Endre Tarjan:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons.
Symposium on Computational Geometry 1986: 1-13 |
| 1983 |
|---|
| 1 | | Daniel Leven,
Zvi Galil:
NP Completeness of Finding the Chromatic Index of Regular Graphs.
J. Algorithms 4(1): 35-44 (1983) |
