 | 1998 |
|---|
| 5 |       | Cyril Gavoille,
Eric Guévremont:
Worst Case Bounds for Shortest Path Interval Routing.
J. Algorithms 27(1): 1-25 (1998) |
| 4 | | David Avis,
Bryan Beresford-Smith,
Luc Devroye,
Hossam A. ElGindy,
Eric Guévremont,
Ferran Hurtado,
Binhai Zhu:
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.
SIAM J. Comput. 28(1): 278-296 (1998) |
| 1996 |
|---|
| 3 | | David Eu,
Eric Guévremont,
Godfried T. Toussaint:
On Envelopes of Arrangements of Lines.
J. Algorithms 21(1): 111-148 (1996) |
| 1995 |
|---|
| 2 |  | Cyril Gavoille,
Eric Guévremont:
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing.
SIROCCO 1995: 113-121 |
| 1992 |
|---|
| 1 | | Eric Guévremont,
Jack Snoeyink:
Recognizing an Envelope of Lines in Linear Time.
ISAAC 1992: 370-377 |
Data released under the ODC-BY 1.0 license — See also our legal information page