Daniel Leven

1.1k total citations
10 papers, 694 citations indexed

About

Daniel Leven is a scholar working on Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Daniel Leven has authored 10 papers receiving a total of 694 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computer Graphics and Computer-Aided Design, 5 papers in Computer Networks and Communications and 5 papers in Computer Vision and Pattern Recognition. Recurrent topics in Daniel Leven's work include Computational Geometry and Mesh Generation (7 papers), Robotic Path Planning Algorithms (5 papers) and Optimization and Search Problems (4 papers). Daniel Leven is often cited by papers focused on Computational Geometry and Mesh Generation (7 papers), Robotic Path Planning Algorithms (5 papers) and Optimization and Search Problems (4 papers). Daniel Leven collaborates with scholars based in Israel, United States and France. Daniel Leven's co-authors include Micha Sharir, Robert E. Tarjan, Leonidas Guibas, John Hershberger, Zvi Galil, S. Sifrony, Richard Cole, Richard Pollack, Klara Kedem and V. Conrad and has published in prestigious journals such as Journal of Algorithms, Algorithmica and Discrete & Computational Geometry.

In The Last Decade

Daniel Leven

9 papers receiving 641 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Daniel Leven Israel	8	512	356	167	145	142	10	694
Ferrán Hurtado Spain	15	588 1.1×	229 0.6×	155 0.9×	315 2.2×	51 0.4×	123	815
M. Sharir United States	11	366 0.7×	194 0.5×	104 0.6×	153 1.1×	30 0.2×	13	477
Oswin Aichholzer Austria	17	823 1.6×	328 0.9×	152 0.9×	384 2.6×	55 0.4×	158	1.0k
Thomas C. Shermer Canada	13	425 0.8×	371 1.0×	52 0.3×	213 1.5×	157 1.1×	45	743
Thérèse Biedl Canada	14	345 0.7×	219 0.6×	61 0.4×	223 1.5×	48 0.3×	83	631
Sergio Cabello Slovenia	18	359 0.7×	197 0.6×	172 1.0×	382 2.6×	29 0.2×	75	762
Jeffrey S. Salowe United States	12	266 0.5×	92 0.3×	81 0.5×	144 1.0×	34 0.2×	31	528
Binay Bhattacharya Canada	14	240 0.5×	149 0.4×	103 0.6×	98 0.7×	46 0.3×	69	592
Pável Valtr Czechia	13	321 0.6×	165 0.5×	40 0.2×	244 1.7×	31 0.2×	74	509
Lyle Ramshaw United States	8	209 0.4×	140 0.4×	40 0.2×	113 0.8×	38 0.3×	12	548

Countries citing papers authored by Daniel Leven

Since Specialization

Citations

This map shows the geographic impact of Daniel Leven's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Leven with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Leven more than expected).

Fields of papers citing papers by Daniel Leven

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Leven. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Leven. The network helps show where Daniel Leven may publish in the future.

Co-authorship network of co-authors of Daniel Leven

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Leven. A scholar is included among the top collaborators of Daniel Leven based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Leven. Daniel Leven is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

10 of 10 papers shown

1.

Leven, Daniel, et al.. (2005). Mathematical - Programming Solution of Optimum Dispatch. pas 93. 137–141.

2.

Leven, Daniel & Micha Sharir. (1987). Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams. Discrete & Computational Geometry. 2(1). 9–31. 94 indexed citations

3.

Leven, Daniel & Micha Sharir. (1987). An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers. Journal of Algorithms. 8(2). 192–215. 32 indexed citations

4.

Guibas, Leonidas, John Hershberger, Daniel Leven, Micha Sharir, & Robert E. Tarjan. (1987). Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica. 2(1-4). 209–233. 301 indexed citations

5.

Leven, Daniel & Micha Sharir. (1987). On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space. Discrete & Computational Geometry. 2(3). 255–270. 39 indexed citations

6.

Sharir, Micha, Richard Cole, Klara Kedem, et al.. (1986). Geometric applications of Davenport-Schinzel sequences. 77–86. 21 indexed citations

7.

Guibas, Leonidas, John Hershberger, Daniel Leven, Micha Sharir, & Robert E. Tarjan. (1986). Linear time algorithms for visibility and shortest path problems inside simple polygons. 1–13. 76 indexed citations

8.

Leven, Daniel & Micha Sharir. (1985). An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). 221–227. 36 indexed citations

9.

Leven, Daniel & Zvi Galil. (1983). NP completeness of finding the chromatic index of regular graphs. Journal of Algorithms. 4(1). 35–44. 94 indexed citations

10.

Leven, Daniel, et al.. (1980). Alternating sequential/parallel versions of the simplex algorithm. 6(4). 237–242. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact