William Lenhart
List of publications from the DBLP Bibliography Server - FAQ
2006 | ||
---|---|---|
20 | EE | Hazel Everett, Sylvain Lazard, William J. Lenhart, Jeremy Redburn, Linqiao Zhang: Predicates for Line Transversals in 3D. CCCG 2006 |
2004 | ||
19 | EE | Ryan B. Hayward, William J. Lenhart: Bichromatic P4-composition schemes for perfect orderability. Discrete Applied Mathematics 141(1-3): 161-183 (2004) |
2002 | ||
18 | EE | William Lenhart, Giuseppe Liotta: The drawability problem for minimum weight triangulations. Theor. Comput. Sci. 270(1-2): 261-286 (2002) |
2001 | ||
17 | EE | Ryan B. Hayward, William J. Lenhart: Perfectly Orderable P4 Composition. Electronic Notes in Discrete Mathematics 7: 190-193 (2001) |
2000 | ||
16 | EE | William Lenhart, Giuseppe Liotta: Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). Graph Drawing 2000: 338-349 |
1997 | ||
15 | EE | Christopher Umans, William Lenhart: Hamiltonian Cycles in Solid Grid Graphs. FOCS 1997: 496-505 |
14 | William Lenhart, Giuseppe Liotta: Drawable and Forbidden Minimum Weight Triangulations. Graph Drawing 1997: 1-12 | |
1996 | ||
13 | William Lenhart, Giuseppe Liotta: Proximity Drawings of Outerplanar Graphs. Graph Drawing 1996: 286-302 | |
12 | Prosenjit Bose, William Lenhart, Giuseppe Liotta: Characterizing Proximity Trees. Algorithmica 16(1): 83-110 (1996) | |
11 | EE | William Lenhart, Giuseppe Liotta: Drawing Outerplanar Minimum Weight Triangulations. Inf. Process. Lett. 57(5): 253-260 (1996) |
1995 | ||
10 | William Lenhart, Giuseppe Liotta: How to Draw Outerplanar Minimum Weight Triangulations. Graph Drawing 1995: 373-384 | |
9 | William Lenhart, Sue Whitesides: Reconfigurating Closed Polygonal Chains in Euclidean d-Space. Discrete & Computational Geometry 13: 123-140 (1995) | |
1994 | ||
8 | Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Drawability: a Survey. Graph Drawing 1994: 328-339 | |
7 | Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta: Proximity Constraints and Representable Trees. Graph Drawing 1994: 340-351 | |
1993 | ||
6 | Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides: Dominance Drawings of Bipartite Graphs. CCCG 1993: 187-191 | |
5 | EE | George F. Jennings, William J. Lenhart: An art gallery theorem for line segments in the plane. Pattern Recognition Letters 14(9): 727-732 (1993) |
1990 | ||
4 | EE | Ryan B. Hayward, William J. Lenhart: On the P4-structure of Perfect Graphs. IV. Partner graphs. J. Comb. Theory, Ser. B 48(1): 135-139 (1990) |
3 | EE | Vasek Chvátal, William J. Lenhart, Najiba Sbihi: Two-colourings that decompose perfect graphs. J. Comb. Theory, Ser. B 49(1): 1-9 (1990) |
1988 | ||
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. Discrete & Computational Geometry 3: 281-293 (1988) | |
1987 | ||
1 | EE | 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. Symposium on Computational Geometry 1987: 1-10 |
1 | Giuseppe Di Battista | [7] [8] |
2 | Prosenjit Bose | [7] [12] |
3 | Vasek Chvátal | [3] |
4 | Hossam A. ElGindy | [6] |
5 | Hazel Everett | [20] |
6 | Ryan B. Hayward (Ryan Hayward) | [4] [17] [19] |
7 | Michael E. Houle | [6] |
8 | George F. Jennings | [5] |
9 | Sylvain Lazard | [20] |
10 | Giuseppe Liotta | [7] [8] [10] [11] [12] [13] [14] [16] [18] |
11 | Mirka Miller | [6] |
12 | Richard Pollack | [1] [2] |
13 | David Rappaport | [6] |
14 | Jeremy Redburn | [20] |
15 | Jörg-Rüdiger Sack | [1] [2] |
16 | Najiba Sbihi | [3] |
17 | Raimund Seidel | [1] [2] |
18 | Micha Sharir | [1] [2] |
19 | Subhash Suri | [1] [2] |
20 | Godfried T. Toussaint | [1] [2] |
21 | Christopher Umans | [15] |
22 | Sue Whitesides | [1] [2] [6] [9] |
23 | Chee-Keng Yap (Chee Yap) | [1] [2] |
24 | Linqiao Zhang | [20] |