Recognizing an Envelope of Lines in Linear Time. - Eric Guévremont; Jack Snoeyink (ISAAC, 1992)

On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing. - Cyril Gavoille; Eric Guévremont (SIROCCO, 1995)

On Envelopes of Arrangements of Lines. - David Eu; Eric Guévremont; Godfried T. Toussaint (J. Algorithms, 1996)

Worst Case Bounds for Shortest Path Interval Routing. - Cyril Gavoille; Eric Guévremont (J. Algorithms, 1998)

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. - David Avis; Bryan Beresford-Smith; Luc Devroye; Hossam A. ElGindy; Eric Guévremont; Ferran Hurtado; Binhai Zhu (SIAM J. Comput., 1998)