Christian Schwarz

12 papers A* 2B 1Journal 4Unranked 4

Year	Rank	Type	Title / Venue / Authors
1998	J	`jnl`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1995	—	`conf`	Minimal Enclosing Parallelogram with Application. SCG Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans
1995	J	`jnl`	Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1995	J	`jnl`	Static and Dynamic Algorithms for J. Algorithms Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
1994	J	`jnl`	An Optimal Algorithm for the On-Line Closest-Pair Problem. Algorithmica Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink
1993	—	`—`	Data structures and algorithms for the dynamic closest pair problem. Christian Schwarz
1993	—	`conf`	Maintaining the Approximate Width of a Set of Points in the Plane. CCCG Günter Rote, Christian Schwarz, Jack Snoeyink
1993	A*	`conf`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	—	`conf`	Simple Randomized Algorithms for Closest Pair Problems. CCCG Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	B	`conf`	Static and Dynamic Algorithms for k-Point Clustering Problems. WADS Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
1992	A*	`conf`	An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. SODA Christian Schwarz, Michiel H. M. Smid
1992	—	`conf`	An Optimal Algorithm for the On-Line Closest-Pair Problem. SCG Christian Schwarz, Michiel H. M. Smid, Jack Snoeyink