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

Computing the link center of a simple polygon W Lenhart, R Pollack, J Sack, R Seidel, M Sharir Proceedings of the third annual symposium on Computational geometry, 1-10, 1987 | 100 | 1987 |

Reconfiguring closed polygonal chains in Euclidean*d*-spaceWJ Lenhart, SH Whitesides Discrete & Computational Geometry 13, 123-140, 1995 | 87 | 1995 |

Characterizing proximity trees P Bose, W Lenhart, G Liotta Algorithmica 16, 83-110, 1996 | 77 | 1996 |

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

Proximity constraints and representable trees P Bose, G Di Battista, W Lenhart, G Liotta International Symposium on Graph Drawing, 340-351, 1994 | 45 | 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 | 40 | 1992 |

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

Bar 1-visibility graphs and their relation to other nearly planar graphs W Evans, M Kaufmann, W Lenhart, T Mchedlidze, S Wismath Journal of Graph Algorithms and Applications 18 (5), 721-739, 2014 | 34 | 2014 |

Planar and plane slope number of partial 2-trees W Lenhart, G Liotta, D Mondal, RI Nishat Graph Drawing: 21st International Symposium, GD 2013, Bordeaux, France …, 2013 | 32 | 2013 |

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 | 26* | 2013 |

On representing graphs by touching cuboids D Bremner, W Evans, F Frati, L Heyer, SG Kobourov, WJ Lenhart, G Liotta, ... Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 23 | 2013 |

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 |

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

On partitioning the edges of 1-plane graphs WJ Lenhart, G Liotta, F Montecchiani Theoretical Computer Science 662, 59-65, 2017 | 18 | 2017 |

On the edge-length ratio of outerplanar graphs S Lazard, WJ Lenhart, G Liotta Theoretical Computer Science 770, 88-94, 2019 | 16 | 2019 |

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

3D snap rounding O Devillers, S Lazard, W Lenhart Inria Nancy-Grand Est, 2018 | 14 | 2018 |

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

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