William Lenhart

599 total citations
17 papers, 222 citations indexed

About

William Lenhart is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, William Lenhart has authored 17 papers receiving a total of 222 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Graphics and Computer-Aided Design, 10 papers in Computational Theory and Mathematics and 7 papers in Computer Vision and Pattern Recognition. Recurrent topics in William Lenhart's work include Computational Geometry and Mesh Generation (13 papers), Advanced Graph Theory Research (9 papers) and Digital Image Processing Techniques (4 papers). William Lenhart is often cited by papers focused on Computational Geometry and Mesh Generation (13 papers), Advanced Graph Theory Research (9 papers) and Digital Image Processing Techniques (4 papers). William Lenhart collaborates with scholars based in United States, Canada and Italy. William Lenhart's co-authors include Sue Whitesides, Chris Umans, Micha Sharir, Jörg-Rüdiger Sack, Raimund Seidel, Richard Pollack, Giuseppe Liotta, Prosenjit Bose, G Liotta and Chee Yap and has published in prestigious journals such as Pattern Recognition Letters, Theoretical Computer Science and Journal of Combinatorial Theory Series B.

In The Last Decade

William Lenhart

16 papers receiving 198 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
William Lenhart United States 7 150 76 71 47 42 17 222
Hazel Everett Canada 11 233 1.6× 135 1.8× 105 1.5× 42 0.9× 61 1.5× 45 334
Leonidas Palios Greece 8 146 1.0× 71 0.9× 84 1.2× 37 0.8× 18 0.4× 27 252
Elmar Langetepe Germany 10 114 0.8× 81 1.1× 25 0.4× 86 1.8× 37 0.9× 34 230
Menelaos I. Karavelas Greece 10 142 0.9× 87 1.1× 51 0.7× 38 0.8× 32 0.8× 26 285
Sébastien Collette Belgium 8 95 0.6× 45 0.6× 46 0.6× 81 1.7× 26 0.6× 34 237
Subir Kumar Ghosh India 9 192 1.3× 185 2.4× 35 0.5× 85 1.8× 52 1.2× 21 316
S. Sifrony United States 8 306 2.0× 230 3.0× 72 1.0× 42 0.9× 41 1.0× 10 367
Jules Vleugels Netherlands 9 155 1.0× 196 2.6× 21 0.3× 37 0.8× 75 1.8× 14 295
Jayaram Bhasker United States 7 70 0.5× 40 0.5× 54 0.8× 54 1.1× 12 0.3× 8 239
William Horn United States 8 356 2.4× 245 3.2× 9 0.1× 43 0.9× 52 1.2× 17 449

Countries citing papers authored by William Lenhart

Since Specialization
Citations

This map shows the geographic impact of William Lenhart'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 William Lenhart with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William Lenhart more than expected).

Fields of papers citing papers by William Lenhart

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by William Lenhart. 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 William Lenhart. The network helps show where William Lenhart may publish in the future.

Co-authorship network of co-authors of William Lenhart

This figure shows the co-authorship network connecting the top 25 collaborators of William Lenhart. A scholar is included among the top collaborators of William Lenhart 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 William Lenhart. William Lenhart is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Devillers, Olivier, Sylvain Lazard, & William Lenhart. (2020). Rounding Meshes in 3D. Discrete & Computational Geometry. 64(1). 37–62. 1 indexed citations
2.
Lenhart, William, Giuseppe Liotta, & Fabrizio Montecchiani. (2016). On partitioning the edges of 1-plane graphs. Theoretical Computer Science. 662. 59–65. 2 indexed citations
3.
Dujmović, Vida, William Evans, Sylvain Lazard, et al.. (2012). On point-sets that support planar graphs. Computational Geometry. 46(1). 29–50. 5 indexed citations
4.
Everett, Hazel, et al.. (2008). On the degree of standard geometric predicates for line transversals in 3D. Computational Geometry. 42(5). 484–494.
5.
Lenhart, William & Giuseppe Liotta. (2002). The drawability problem for minimum weight triangulations. Theoretical Computer Science. 270(1-2). 261–286. 4 indexed citations
6.
Umans, Chris & William Lenhart. (2002). Hamiltonian cycles in solid grid graphs. 496–505. 44 indexed citations
7.
Lenhart, William & Giuseppe Liotta. (1996). Proximity Drawings of Outerplanar Graphs. 1190. 286–302. 8 indexed citations
8.
Bose, Prosenjit, William Lenhart, & G Liotta. (1996). Characterizing Proximity Trees. Algorithmica. 16(1). 83–83. 2 indexed citations
9.
Lenhart, William & Giuseppe Liotta. (1996). Drawing outerplanar minimum weight triangulations. Information Processing Letters. 57(5). 253–260. 4 indexed citations
10.
Bose, Prosenjit, William Lenhart, & G Liotta. (1996). Characterizing proximity trees. Algorithmica. 16(1). 83–110. 20 indexed citations
11.
Lenhart, William & Sue Whitesides. (1995). Reconfiguring closed polygonal chains in Euclideand-space. Discrete & Computational Geometry. 13(1). 123–140. 45 indexed citations
12.
ElGindy, Hossam, Michael E. Houle, William Lenhart, et al.. (1993). Dominance Drawings of Bipartite Graphs.. Canadian Conference on Computational Geometry. 187–191. 4 indexed citations
13.
Lenhart, William, et al.. (1993). An art gallery theorem for line segments in the plane. Pattern Recognition Letters. 14(9). 727–732. 2 indexed citations
14.
Hayward, Ryan & William Lenhart. (1990). On the P4-structure of Perfect Graphs. IV. Partner graphs. Journal of Combinatorial Theory Series B. 48(1). 135–139. 6 indexed citations
15.
Chvátal, Vašek, William Lenhart, & Najiba Sbihi. (1990). Two-colourings that decompose perfect graphs. Journal of Combinatorial Theory Series B. 49(1). 1–9. 6 indexed citations
16.
Lenhart, William, Richard Pollack, Jörg-Rüdiger Sack, et al.. (1988). Computing the link center of a simple polygon. Discrete & Computational Geometry. 3(3). 281–293. 27 indexed citations
17.
Lenhart, William, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, & Micha Sharir. (1987). Computing the link center of a simple polygon. 1–10. 42 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

Breakdown of academic impact, for papers by Hazel Everett Breakdown of academic impact, for papers by Leonidas Palios Breakdown of academic impact, for papers by Elmar Langetepe Breakdown of academic impact, for papers by Menelaos I. Karavelas Breakdown of academic impact, for papers by Sébastien Collette Breakdown of academic impact, for papers by Subir Kumar Ghosh Breakdown of academic impact, for papers by S. Sifrony Breakdown of academic impact, for papers by Jules Vleugels Breakdown of academic impact, for papers by Jayaram Bhasker Breakdown of academic impact, for papers by William Horn
Rankless by CCL
2026