D. Leven

Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

Micha Sharir, Daniel Leven, M. Sharir, 2016, Discret. Comput. Geom..

On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space

Micha Sharir, Daniel Leven, M. Sharir, 1987, Discret. Comput. Geom..

An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers

Micha Sharir, Daniel Leven, M. Sharir, 1987, J. Algorithms.

An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract)

Micha Sharir, Daniel Leven, M. Sharir, 1985, SCG '85.

NP Completeness of Finding the Chromatic Index of Regular Graphs

Zvi Galil, Daniel Leven, Z. Galil, 1983, J. Algorithms.

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas J. Guibas, Micha Sharir, Robert E. Tarjan, 1987, Algorithmica.

Linear time algorithms for visibility and shortest path problems inside simple polygons

Leonidas J. Guibas, Micha Sharir, Robert E. Tarjan, 2011, SCG '86.