Acyclic Directed Hypercubes may have Exponential Diameter. - Hazel Everett; A. Gupta (Inf. Process. Lett., 1989)

Recognizing Visibility Graphs of Spiral Polygons. - Hazel Everett; Derek G. Corneil (J. Algorithms, 1990)

The Graham scan triangulates simple polygons. - Xianshu Kong; Hazel Everett; Godfried T. Toussaint (Pattern Recognit. Lett., 1990)

Visibility graph recognition. - Hazel Everett (1990)

The Aquarium Keeper's Problem. - Jurek Czyzowicz; Peter Egyed; Hazel Everett; David Rappaport; Thomas C. Shermer; Diane L. Souvaine; Godfried T. Toussaint; Jorge Urrutia (SODA, 1991)

A counterexample to a dynamic algorithm for convex hulls of line arrangements. - Binay K. Bhattacharya; Hazel Everett; Godfried T. Toussaint (Pattern Recognit. Lett., 1991)

Recovery of Convex Hulls From External Visibility Graphs. - Hazel Everett; Anna Lubiw; Joseph O'Rourke (CCCG, 1993)

Slicing an ear using prune-and-search. - Hossam A. ElGindy; Hazel Everett; Godfried T. Toussaint (Pattern Recognit. Lett., 1993)

Edge Guarding a Triangulated Polyhedral Terrain. - Hazel Everett; Eduardo Rivera-Campo (CCCG, 1994)

Visibility graphs of polygonal rings. - Leizhen Cai; Hazel Everett (CCCG, 1995)

Negative Results on Characterizing Visibility Graphs. - Hazel Everett; Derek G. Corneil (Comput. Geom., 1995)

Translation queries for sets of polygons. - Mark de Berg; Hazel Everett; Hubert Wagener (Int. J. Comput. Geom. Appl., 1995)

An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. - Hazel Everett; Jean-Marc Robert 001; Marc J. van Kreveld (Int. J. Comput. Geom. Appl., 1996)

Edge Guarding Polyhedral Terrains. - Hazel Everett; Eduardo Rivera-Campo (Comput. Geom., 1997)

An Algorithm for Finding Homogeneous Pairs. - Hazel Everett; Sulamita Klein; Bruce A. Reed (Discret. Appl. Math., 1997)

Path parity and perfection. - Hazel Everett; Celina M. H. de Figueiredo; Cláudia Linhares Sales; Frédéric Maffray; Oscar Porto; Bruce A. Reed (Discret. Math., 1997)

Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. - Jurek Czyzowicz; Hazel Everett; Jean-Marc Robert 001 (Int. J. Comput. Geom. Appl., 1997)

Convexifying star-shaped polygons. - Hazel Everett; Sylvain Lazard; Steven M. Robbins; H. Schröder; Sue Whitesides (CCCG, 1998)

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. - Mark de Berg; Hazel Everett; Leonidas J. Guibas (Comput. Geom., 1998)

The largest k-ball in a d-dimensional box. - Hazel Everett; Ivan Stojmenovic; Pavel Valtr 001; Sue Whitesides (Comput. Geom., 1998)

The Homogeneous Set Sandwich Problem. - Márcia R. Cerioli; Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein (Inf. Process. Lett., 1998)

A Visibility Representation for Graphs in Three Dimensions. - Prosenjit Bose; Hazel Everett; Sándor P. Fekete; Michael E. Houle; Anna Lubiw; Henk Meijer; Kathleen Romanik; Günter Rote; Thomas C. Shermer; Sue Whitesides; Christian Zelle (J. Graph Algorithms Appl., 1998)

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons. - Siu-Wing Cheng; Hazel Everett; Otfried Cheong; René van Oostrum (SCG, 1999)

Stabbing Information of a Simple Polygon. - Hazel Everett; Ferran Hurtado; Marc Noy (Discret. Appl. Math., 1999)

Planar segment visibility graphs. - Hazel Everett; Chính T. Hoàng; Kyriakos Kilakos; Marc Noy (Comput. Geom., 2000)

Bull-Reducible Berge Graphs are Perfect. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (Electron. Notes Discret. Math., 2001)

On the number of lines tangent to four convex polyhedra. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (CCCG, 2002)

Transversals to line segments in R3. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CCCG, 2003)

The number of transversals to line segments in R^3 - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (CoRR, 2003)

Properties of Arrangement Graphs. - Prosenjit Bose; Hazel Everett; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2003)

The Expected Number of 3D Visibility Events Is Linear. - Olivier Devillers; Vida Dujmovic; Hazel Everett; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sylvain Petitjean (SIAM J. Comput., 2003)

The number of lines tangent to arbitrary convex polyhedra in 3D. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (SCG, 2004)

Editorial. - Hazel Everett; Stephen K. Wismath (Comput. Geom., 2004)

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. - Siu-Wing Cheng; Otfried Cheong; Hazel Everett; René van Oostrum (Discret. Comput. Geom., 2004)

An Experimental Assessment of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (CCCG, 2005)

Drawing Kn in Three Dimensions with One Bend Per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (GD, 2005)

Optimal spanners for axis-aligned rectangles. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Hazel Everett; Herman J. Haverkort; Naoki Katoh; Alexander Wolff 001 (Comput. Geom., 2005)

Transversals to Line Segments in Three-Dimensional Space. - Hervé Brönnimann; Hazel Everett; Sylvain Lazard; Frank Sottile; Sue Whitesides (Discret. Comput. Geom., 2005)

The perfection and recognition of bull-reducible Berge graphs. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (RAIRO Theor. Informatics Appl., 2005)

Throwing Stones Inside Simple Polygons . - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (AAIM, 2006)

Predicates for Line Transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Jeremy Redburn; Linqiao Zhang (CCCG, 2006)

Drawing Kn in Three Dimensions with One Bend per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (J. Graph Algorithms Appl., 2006)

Between umbra and penumbra. - Julien Demouth; Olivier Devillers; Hazel Everett; Marc Glisse; Sylvain Lazard; Raimund Seidel (SCG, 2007)

Towards an implementation of the 3D visibility skeleton. - Linqiao Zhang; Hazel Everett; Sylvain Lazard; Sue Whitesides (SCG, 2007)

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (GD, 2007)

Parabola Separation Queries and their Application to Stone Throwing. - Otfried Cheong; Hazel Everett; Hyo-Sil Kim; Sylvain Lazard; René Schott (Int. J. Comput. Geom. Appl., 2007)

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. - Olivier Devillers; Vida Dujmovic; Hazel Everett; Samuel Hornus; Sue Whitesides; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2007)

On the Expected Size of the 2D Visibility Complex. - Hazel Everett; Sylvain Lazard; Sylvain Petitjean; Linqiao Zhang (Int. J. Comput. Geom. Appl., 2007)

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. - Hervé Brönnimann; Olivier Devillers; Vida Dujmovic; Hazel Everett; Marc Glisse; Xavier Goaoc; Sylvain Lazard; Hyeon-Suk Na; Sue Whitesides (SIAM J. Comput., 2007)

On the Size of the 3D Visibility Skeleton: Experimental Results. - Linqiao Zhang; Hazel Everett; Sylvain Lazard; Christophe Weibel; Sue Whitesides (ESA, 2008)

On the complexity of umbra and penumbra. - Julien Demouth; Olivier Devillers; Hazel Everett; Marc Glisse; Sylvain Lazard; Raimund Seidel (Comput. Geom., 2009)

On the degree of standard geometric predicates for line transversals in 3D. - Hazel Everett; Sylvain Lazard; William J. Lenhart; Linqiao Zhang (Comput. Geom., 2009)

The Voronoi Diagram of Three Lines. - Hazel Everett; Daniel Lazard; Sylvain Lazard; Mohab Safey El Din (Discret. Comput. Geom., 2009)

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (Discret. Comput. Geom., 2010)

Farthest-polygon Voronoi diagrams. - Otfried Cheong; Hazel Everett; Marc Glisse; Joachim Gudmundsson; Samuel Hornus; Sylvain Lazard; Mira Lee; Hyeon-Suk Na (Comput. Geom., 2011)