NP Completeness of Finding the Chromatic Index of Regular Graphs. - Daniel Leven; Zvi Galil (J. Algorithms, 1983)

An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). - Daniel Leven; Micha Sharir (SCG, 1985)

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. - Leonidas J. Guibas; John Hershberger 001; Daniel Leven; Micha Sharir; Robert Endre Tarjan (SCG, 1986)

Geometric Applications of Davenport-Schinzel Sequences - Micha Sharir; Richard Cole 001; Klara Kedem; Daniel Leven; Richard Pollack; Shmuel Sifrony (FOCS, 1986)

Efficient algorithms for motion planning of robot systems amidst obstacles - Daniel Leven (1986)

Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. - Leonidas J. Guibas; John Hershberger 001; Daniel Leven; Micha Sharir; Robert Endre Tarjan (Algorithmica, 1987)

Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. - Daniel Leven; Micha Sharir (Discret. Comput. Geom., 1987)

On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. - Daniel Leven; Micha Sharir (Discret. Comput. Geom., 1987)

An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. - Daniel Leven; Micha Sharir (J. Algorithms, 1987)