Eric Guévremont

According to our database, Eric Guévremont authored at least 5 papers between 1992 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

Worst Case Bounds for Shortest Path Interval Routing.

Cyril Gavoille, Eric Guévremont

J. Algorithms, 1998

1996

On Envelopes of Arrangements of Lines.

David Eu, Eric Guévremont, Godfried T. Toussaint

J. Algorithms, 1996

1995

On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing.

Cyril Gavoille, Eric Guévremont

Proceedings of the Structure, Information and Communication Complexity, 1995

1992

Recognizing an Envelope of Lines in Linear Time.

Eric Guévremont, Jack Snoeyink

Proceedings of the Algorithms and Computation, Third International Symposium, 1992