Computing the Link Center of a Simple Polygon. - William J. Lenhart; Richard Pollack; Jörg-Rüdiger Sack; Raimund Seidel; Micha Sharir; Subhash Suri; Godfried T. Toussaint; Sue Whitesides; Chee-Keng Yap (Discret. Comput. Geom., 1988)

Two-colourings that decompose perfect graphs. - Vasek Chvátal; William J. Lenhart; Najiba Sbihi (J. Comb. Theory B, 1990)

On the P4-structure of Perfect Graphs. IV. Partner graphs. - Ryan B. Hayward; William J. Lenhart (J. Comb. Theory B, 1990)

Dominance Drawings of Bipartite Graphs. - Hossam A. ElGindy; Michael E. Houle; William J. Lenhart; Mirka Miller; David Rappaport; Sue Whitesides (CCCG, 1993)

An art gallery theorem for line segments in the plane. - George F. Jennings; William J. Lenhart (Pattern Recognit. Lett., 1993)

Proximity Drawability: a Survey. - Giuseppe Di Battista; William J. Lenhart; Giuseppe Liotta (GD, 1994)

Proximity Constraints and Representable Trees. - Prosenjit Bose; Giuseppe Di Battista; William J. Lenhart; Giuseppe Liotta (GD, 1994)

How to Draw Outerplanar Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (GD, 1995)

Reconfigurating Closed Polygonal Chains in Euclidean d-Space. - William J. Lenhart; Sue Whitesides (Discret. Comput. Geom., 1995)

Proximity Drawings of Outerplanar Graphs. - William J. Lenhart; Giuseppe Liotta (GD, 1996)

Characterizing Proximity Trees. - Prosenjit Bose; William J. Lenhart; Giuseppe Liotta (Algorithmica, 1996)

Drawing Outerplanar Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (Inf. Process. Lett., 1996)

Hamiltonian Cycles in Solid Grid Graphs. - Christopher Umans; William J. Lenhart (FOCS, 1997)

Drawable and Forbidden Minimum Weight Triangulations. - William J. Lenhart; Giuseppe Liotta (GD, 1997)

Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). - William J. Lenhart; Giuseppe Liotta (GD, 2000)

Perfectly Orderable P4 Composition. - Ryan B. Hayward; William J. Lenhart (Electron. Notes Discret. Math., 2001)

The drawability problem for minimum weight triangulations. - William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2002)

Bichromatic P4-composition schemes for perfect orderability. - Ryan B. Hayward; William J. Lenhart (Discret. Appl. Math., 2004)

Predicates for Line Transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Jeremy Redburn; Linqiao Zhang (CCCG, 2006)

On the degree of standard geometric predicates for line transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Linqiao Zhang (Comput. Geom., 2009)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Point-Set Embeddability of 2-Colored Trees. - Fabrizio Frati; Marc Glisse; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Rahnuma Islam Nishat (GD, 2012)

Planar and Plane Slope Number of Partial 2-Trees. - William J. Lenhart; Giuseppe Liotta; Debajyoti Mondal; Rahnuma Islam Nishat (GD, 2013)

On point-sets that support planar graphs. - Vida Dujmovic; William S. Evans; Sylvain Lazard; William J. Lenhart; Giuseppe Liotta; David Rappaport; Stephen K. Wismath (Comput. Geom., 2013)

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Stephen K. Wismath (CoRR, 2013)

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Tamara Mchedlidze; Stephen K. Wismath (J. Graph Algorithms Appl., 2014)

On Partitioning the Edges of 1-Planar Graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (CoRR, 2015)

On partitioning the edges of 1-plane graphs. - William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2017)

3D Snap Rounding. - Olivier Devillers; Sylvain Lazard; William J. Lenhart (SoCG, 2018)

(k, p)-Planarity: A Generalization of Hybrid Planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (CoRR, 2018)

(k, p)-Planarity: A Relaxation of Hybrid Planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (WALCOM, 2019)

On the edge-length ratio of outerplanar graphs. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2019)

Rounding Meshes in 3D. - Olivier Devillers; Sylvain Lazard; William J. Lenhart (Discret. Comput. Geom., 2020)

Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. - Sylvain Lazard; William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2020)

Packing Trees into 1-planar Graphs. - Felice De Luca; Emilio Di Giacomo; Seok-Hee Hong 001; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; Henk Meijer; Alessandra Tappini; Stephen K. Wismath (J. Graph Algorithms Appl., 2021)

(k, p)-planarity: A relaxation of hybrid planarity. - Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph 001; Alessandra Tappini (Theor. Comput. Sci., 2021)

Mutual Witness Proximity Drawings of Isomorphic Trees. - Carolina Haase; Philipp Kindermann; William J. Lenhart; Giuseppe Liotta (GD (1), 2023)

Drawing Partial 2-Trees with Few Slopes. - William J. Lenhart; Giuseppe Liotta; Debajyoti Mondal; Rahnuma Islam Nishat (Algorithmica, 2023)

Mutual witness Gabriel drawings of complete bipartite graphs. - William J. Lenhart; Giuseppe Liotta (Theor. Comput. Sci., 2023)

On 3-layered Cornerhedra: Optimum Box Partitions for Niches. - Ulrike Stege; Sue Whitesides; Laurie J. Heyer; William J. Lenhart (CCCG, 2024)

On the complexity of the storyplan problem. - Carla Binucci; Emilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Antonios Symvonis (J. Comput. Syst. Sci., 2024)