Eric Guévremont

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.
SIAM J. Comput., 1998

Worst Case Bounds for Shortest Path Interval Routing.
J. Algorithms, 1998

1996
On Envelopes of Arrangements of Lines.
J. Algorithms, 1996

1995
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing.
Proceedings of the Structure, Information and Communication Complexity, 1995

1992
Recognizing an Envelope of Lines in Linear Time.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992


  Loading...