William Lenhart

Publication Activity (10 Years)

Years Active: 1987-2021
Publications (10 Years): 5

Top Topics

Subgraph Isomorphism

Subgraph Mining

Top Venues

J. Graph Algorithms Appl.

Publications

Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-Planar Graphs. WALCOM (2020)
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath
Packing Trees into 1-planar Graphs. CoRR (2019)
Sylvain Lazard, William Lenhart, Giuseppe Liotta
On the Edge-length Ratio of Outerplanar Graphs. CoRR (2017)
Sylvain Lazard, William Lenhart, Giuseppe Liotta
On the Edge-Length Ratio of Outerplanar Graphs. Graph Drawing (2017)
William S. Evans, Michael Kaufmann, William Lenhart, Tamara Mchedlidze, Stephen K. Wismath
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. 18 (5) (2014)
William Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Planar and Plane Slope Number of Partial 2-Trees. Graph Drawing (2013)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On point-sets that support planar graphs. Comput. Geom. 46 (1) (2013)
William S. Evans, Michael Kaufmann, William Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR (2013)
Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
On Point-Sets That Support Planar Graphs. Graph Drawing (2011)
Hazel Everett, Sylvain Lazard, William Lenhart, Linqiao Zhang
On the degree of standard geometric predicates for line transversals in 3D. Comput. Geom. 42 (5) (2009)
William Lenhart, Giuseppe Liotta
The drawability problem for minimum weight triangulations. Theor. Comput. Sci. 270 (1-2) (2002)
William Lenhart, Giuseppe Liotta
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). Graph Drawing (2000)
Christopher Umans, William Lenhart
Hamiltonian Cycles in Solid Grid Graphs. FOCS (1997)
William Lenhart, Giuseppe Liotta
Drawable and Forbidden Minimum Weight Triangulations. Graph Drawing (1997)
William Lenhart, Giuseppe Liotta
Drawing Outerplanar Minimum Weight Triangulations. Inf. Process. Lett. 57 (5) (1996)
Prosenjit Bose, William Lenhart, Giuseppe Liotta
Characterizing Proximity Trees. Algorithmica 16 (1) (1996)
William Lenhart, Giuseppe Liotta
Proximity Drawings of Outerplanar Graphs. Graph Drawing (1996)
William Lenhart, Sue Whitesides
Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discret. Comput. Geom. 13 (1995)
William Lenhart, Giuseppe Liotta
How to Draw Outerplanar Minimum Weight Triangulations. Graph Drawing (1995)
Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
Proximity Constraints and Representable Trees. Graph Drawing (1994)
Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
Proximity Drawability: a Survey. Graph Drawing (1994)
Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
Dominance Drawings of Bipartite Graphs. CCCG (1993)
William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3 (1988)
William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
Computing the Link Center of a Simple Polygon. SCG (1987)