Christian Schwarz

According to our database, Christian Schwarz authored at least 9 papers between 1992 and 1998.

Collaborative distances:

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

1998

Randomized Data Structures for the Dynamic Closest-Pair Problem.

Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid

SIAM J. Comput., 1998

1995

Simple Randomized Algorithms for Closest Pair Problems.

Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid

Nord. J. Comput., 1995

Static and Dynamic Algorithms for <i>k</i>-Point Clustering Problems.

Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid

J. Algorithms, 1995

Minimal Enclosing Parallelogram with Application.

Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

An Optimal Algorithm for the On-Line Closest-Pair Problem.

Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink

Algorithmica, 1994

1993

Data structures and algorithms for the dynamic closest pair problem.

Christian Schwarz

PhD thesis, 1993

Static and Dynamic Algorithms for k-Point Clustering Problems.

Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Maintaining the Approximate Width of a Set of Points in the Plane.

Günter Rote, Christian Schwarz, Jack Snoeyink

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem.

Christian Schwarz, Michiel H. M. Smid

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992