Search the dblp DataBase

Publications of Author

1. Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
   Dominance Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   CCCG, 1993, pp:187-191 [Conf]
   
2. 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. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
   
3. Christopher Umans, William Lenhart
   Hamiltonian Cycles in Solid Grid Graphs. [Citation Graph (0, 0)][DBLP]
   FOCS, 1997, pp:496-505 [Conf]
   
4. Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
   Proximity Constraints and Representable Trees. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1994, pp:340-351 [Conf]
   
5. Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
   Proximity Drawability: a Survey. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1994, pp:328-339 [Conf]
   
6. William Lenhart, Giuseppe Liotta
   Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2000, pp:338-349 [Conf]
   
7. William Lenhart, Giuseppe Liotta
   How to Draw Outerplanar Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1995, pp:373-384 [Conf]
   
8. William Lenhart, Giuseppe Liotta
   Proximity Drawings of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1996, pp:286-302 [Conf]
   
9. William Lenhart, Giuseppe Liotta
   Drawable and Forbidden Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1997, pp:1-12 [Conf]
   
10. Prosenjit Bose, William Lenhart, Giuseppe Liotta
    Characterizing Proximity Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:83-110 [Journal]
    
11. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
    
12. William Lenhart, Sue Whitesides
    Reconfigurating Closed Polygonal Chains in Euclidean d-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:123-140 [Journal]
    
13. William Lenhart, Giuseppe Liotta
    Drawing Outerplanar Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:253-260 [Journal]
    
14. William Lenhart, Giuseppe Liotta
    The drawability problem for minimum weight triangulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:261-286 [Journal]
    
15. 
    On the degree of standard geometric predicates for line transversals in 3D. [Citation Graph (, )][DBLP]