Universal sets of n points for one-bend drawings of planar graphs with n vertices
H. Everett, S. Lazard, G. Liotta and S. Wismath
Discrete and Computational Geometry. Online.

The voronoi diagram of three lines
H. Everett, D. Lazard, S. Lazard and M. Safey El Din
Discrete and Computational Geometry, Vol 42, No 1, 2009, pp.94-130

On the complexity of umbra and penumbra
J. Demouth, O. Devillers, H. Everett, M. Glisse, S. Lazard and R. Seidel
Computational Geometry, Vol 42, No 8, 2009, pp.758-771

On the degree of standard geometric predicates for line transversals in 3D
H. Everett, S. Lazard, W. Lenhart and L. Zhang
Computational Geometry, Vol 42, No 5, 2009, pp.484-494

Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra
H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S.Na and S. Whitesides
SIAM Journal on Computing, Vol 37, No 2, 2007, pp. 522-551.

Parabola separation queries and their application to stone throwing
O. Cheong, H. Everett, H.-S. Kim, S. Lazard and R. Schott
International Journal of Computational Geometry and Applications, Vol 17, No 4, 2007, pp. 349-360.

On the expected size of the 2D visibility complex
H. Everett, S. Lazard, S. Petitjean and L. Zhang
International Journal of Computational Geometry and Applications, Vol 17, No 4, 2007, pp. 361-381.

Drawing Kn in three dimensions with one bend per edge
O. Devillers, H. Everett, S. Lazard, M. Pntcheva and S. Wismath
Journal of graph algorithms ans applications Vol 10, No 2, 2006, pp. 287-295.

Maintaining visibility information of planar point sets with a moving viewpoint
O. Devillers, V. Dujmovic, H. Everett, S. Hornus, S.Whitesides and S. Wismath
International Journal of Computational Geometry and Applications, Vol 17, No 4, 2005, pp. 297-304.

The perfection and recognition of bull-reducible Berge graphs
H. Everett, C. de Figueiredo, S. Klein and B. Red
RAIRO Theoretical Informatics and Applications Vol 39, 2005, pp. 145-160.

Transversals to line segments in three-dimensional space
H. Bronnimann, H. Everett, S. Lazard, F. Sottile and S. Whitesides
Discrete and Computational Geometry, Vol 34, No 3, 2005, pp. 381 - 390

Optimal spanners for axis-aligned rectangles
T. Asano, M. de Berg, O. Cheong,H. Everett, H. Haverkort, N. Katoh and A. Wolff
Computational Geometry, Vol 30, No. 1, 2005, p. 59-77

Hierarchical decompositions and circular ray shooting in simple polygons
Siu-Wing Cheng, Otfried Cheong, H. Everett and René van Oostrum
Discrete and Computational Geometry, Vol 32, No. 3, 2004, pp. 401-415

Editorial
H. Everett and S.Wismath
Computational Geometry, Vol 28, No. 1, 2004, p. 1

The expected number of 3D visibility events is linear
O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S.Na and S.Petitjean
SIAM Journal on Computing, Vol 32, No 6, 2003, pp. 1586-1620

Properties of arrangement graphs
P. Bose H. Everett and S. Wismath
International Journal of Computational Geometry and Applications, Vol 13, No 6, 2003, pp. 447-462

Bull-reducible berge graphs are perfect
H. Everett, C. de Figueiredo, S. Klein and B.Reed
Electronic Notes in Discrete Mathematics, Vol 10, 2001, pp.93-95

Planar segment visibility graphs
H. Everett, C. Hoang, K. Kilakos and M. Noy
Computational Geometry, Vol 16, No 4, 2000, pp. 235-243

Stabbing information of a simple polygon
H. Everett, F. Hurtado and M. Noy
Discrete Applied Mathematics, Vol 91, No 1-3, 1999, pp. 67-82

The union of moving polygonal pseudodiscs - combinatorial bounds and applications
M. de Berg, H. Everett and L. Guibas
Computational Geometry, Vol 11, No 2, 1998, pp. 69-81

The largest k-ball in a d-dimensional box
H. Everett, I. Stojmenovic, P. Valtr and S. Whitesides
Computational Geometry, Vol 11, No 2, 1998, pp. 59-67

The homogeneous set sandwich problem
M. Cerioli, H. Everett, C. de Figueiredo and S. Klein
Information Processing Letters, Vol 67, No 1, 1998, pp.31-35

A visibility representation for graphs in three dimensions
P. Bose, H. Everett, S. Fekete, M. Houle,A. Lubiw, H. Meijer, K. Romanik, G. Rote, T. Shermer, S. Whitesides and C. Zelle
Journal of Graph Algorithms and Applications, Vol 2, No 3, 1998, pp.1-16

An algorithm for finding homogeneous pairs
H. Everett, S. Klein and B. Reed
Discrete Applied Mathematics, Vol 72, No 3, 1997, pp. 209-218

Edge guarding polyhedral terrains
H. Everett and E. Rivera-Campo
Computational Geometry, Vol 7, No 3, 1997, pp. 201-203

Separating translates in the plane: combinatorial bounds and an algorithm
J. Czyzowicz, H. Everett and J.-M. Robert
International Journal of Computational Geometry and Applications, Vol 7, No 6, 1997, pp. 551-562

Path parity and perfection
H. Everett, C. de Figueiredo, C. Linhares-Sales, F. Maffray, O. Porto and B. Reed
Discrete Mathematics, Vol 165-166, No 15, 1997, pp. 233-252

An optimal algorithm for computing (<=K)-levels, with applications
H. Everett, J.-M. Robert and M. van Kreveld
International Journal of Computational Geometry and Applications, Vol 6, No 3, 1996, pp. 247-261

Translation queries for sets of polygons
M. de Berg, H. Everett and H. Wagener
International Journal of Computational Geometry and Applications, Vol 5, No 3, 1995, pp. 221-242

Negative results on characterizing visibility graphs
H. Everett and D. Corneil
Computational Geometry, Vol 5, No 2, 1995, pp. 51-63

Slicing an ear using prune-and-search
H. El Gindy, H. Everett and G. Toussaint
Pattern Recognition Letters, Vol 14, No 9, 1993, pp. 719-722

A counterexample to a dynamic algorithm for convex hulls of line arrangements
B. Bhattacharya, H. Everett and G. Toussaint
Pattern Recognition Letters, Vol 12, No 3, 1991, pp. 145-147

The Graham scan triangulates simple polygons
X. Kong, H. Everett and G. Toussaint
Pattern Recognition Letters, Vol 11, No 11, 1990, pp. 713-716

Recognizing visibility graphs of spiral polygons
H. Everett and D. Corneil
Journal of Algorithms, Vol 11, No 1, 1990, pp. 1-26

Acyclic directed hypercubes may have exponential diameter
H. Everett and A. Gupta
Information Processing Letters, Vol 32, No 5, 1989, pp.243-245