Hamiltonian cycles in solid grid graphs C Umans, W Lenhart Proceedings 38th Annual Symposium on Foundations of Computer Science, 496-505, 1997 | 113 | 1997 |

Computing the link center of a simple polygon W Lenhart, R Pollack, J Sack, R Seidel, M Sharir, S Suri, G Toussaint, ... Discrete & Computational Geometry 3 (3), 281-293, 1988 | 88 | 1988 |

Reconfiguring closed polygonal chains in Euclideand-space WJ Lenhart, SH Whitesides Discrete & Computational Geometry 13 (1), 123-140, 1995 | 83 | 1995 |

Proximity drawability: A survey extended abstract G Di Battista, W Lenhart, G Liotta International Symposium on Graph Drawing, 328-339, 1994 | 70 | 1994 |

Characterizing proximity trees P Bose, W Lenhart, G Liotta Algorithmica 16 (1), 83-110, 1996 | 69 | 1996 |

Proximity constraints and representable trees P Bose, G Di Battista, W Lenhart, G Liotta International Symposium on Graph Drawing, 340-351, 1994 | 40 | 1994 |

Strictly convex quadrilateralizations of polygons H Everett, W Lenhart, M Overmars, T Shermer, J Urrutia Proceedings of the 4th Canadian Conference on Computational Geometry, 77-83, 1992 | 37 | 1992 |

Bar 1-visibility graphs and their relation to other nearly planar graphs W Evans, M Kaufmann, W Lenhart, G Liotta, T Mchedlidze, S Wismath arXiv preprint arXiv:1312.5520, 2013 | 31 | 2013 |

Proximity drawings of outerplanar graphs W Lenhart, G Liotta International Symposium on Graph Drawing, 286-302, 1996 | 30 | 1996 |

Two-colourings that decompose perfect graphs V Chvátal, WJ Lenhart, N Sbihi Journal of Combinatorial Theory, Series B 49 (1), 1-9, 1990 | 23 | 1990 |

On point-sets that support planar graphs V Dujmović, W Evans, S Lazard, W Lenhart, G Liotta, D Rappaport, ... Computational Geometry 46 (1), 29-50, 2013 | 21* | 2013 |

Drawing outerplanar minimum weight triangulations W Lenhart, G Liotta Information processing letters 57 (5), 253-260, 1996 | 20 | 1996 |

On representing graphs by touching cuboids D Bremner, W Evans, F Frati, L Heyer, SG Kobourov, WJ Lenhart, G Liotta, ... International Symposium on Graph Drawing, 187-198, 2012 | 19 | 2012 |

Planar and plane slope number of partial 2-trees W Lenhart, G Liotta, D Mondal, RI Nishat International Symposium on Graph Drawing, 412-423, 2013 | 17 | 2013 |

The drawability problem for minimum weight triangulations W Lenhart, G Liotta Theoretical Computer Science 270 (1-2), 261-286, 2002 | 15 | 2002 |

Reconfiguring simple polygons WJ Lenhart, SH Whitesides Technical Report SOCS-93.3, School of Computer Science, McGill University, 1993 | 13 | 1993 |

On the P4-structure of perfect graphs. IV. Partner graphs RB Hayward, WJ Lenhart Journal of Combinatorial Theory, Series B 48 (1), 135-139, 1990 | 11 | 1990 |

Point-set embeddability of 2-colored trees F Frati, M Glisse, WJ Lenhart, G Liotta, T Mchedlidze, RI Nishat International Symposium on Graph Drawing, 291-302, 2012 | 10 | 2012 |

On the degree of standard geometric predicates for line transversals in 3D H Everett, S Lazard, W Lenhart, L Zhang Computational Geometry 42 (5), 484-494, 2009 | 9 | 2009 |

Turning a polygon inside-out WJ Lenhart, SH Whitesides Proceedings of the 3rd Canadian Conference on Computational Geometry, 66-69, 1991 | 9 | 1991 |