University of Constance, Computer Science

Upper-Rhine-Region Algorithms Workshop '97

November 14 - 15, 1997

University of Konstanz, Germany
Department of Mathematics and Computer Science

Preliminary Program



Friday November 14, Universität Konstanz, Room A 702

10.30 Registration and Coffee
11.00 Lutz Kettner, ETH Zürich
Designing a Polyhedral Surface Data Structure in C++
Abstract
11.30 Peter Remmele, ETH Zürich
A universal data structure for GIS: the Voronoi diagram
Abstract
12.00 Gabriele Neyer, ETH Zürich
Singularities Make Spatial Join Scheduling Hard
Abstract
Lunch
14.30 Stephane Rivière, Université de Haute-Alsace
Dynamic visibility computations with the visibility complex
Abstract
15.00 Mounir Elbaz, Université de Haute-Alsace
An expected linear time algorithm for 2D Delaunay diagram: theorical and experimental results
Abstract
15.30 Ulrik Brandes, Universität Konstanz
A Framework for Graph Layout
Abstract
Coffee Break
16.45 Prof. Dr. Ernst W. Mayr, TU München
On Polynomial Ideals, Their Complexity, and Applications
(invited talk)
Abstract
18.00 Reception (including dinner)
IBZII, K5 Universität Konstanz



Saturday November 15, Universität Konstanz, Room A 702

9.30 Nora Sleumer, ETH Zürich
A Faster Output-sensitive Algorithm for Enumerating Cells in Arrangements
Abstract
10.00 Stefan Edelkamp, Universität Freiburg
The Branching Factor of Pruned Search Trees
Abstract
10.30 Ambros Marzetta, ETH Zürich
Primal-Dual Methods for Vertex and Facet Enumeration
Abstract
11.00 Coffee Break
11.30 Alois Heinz, Universität Freiburg
Restructuring Neural Trees
Abstract
12.00 René Schott, Université Henri Poincaré-Nancy
Algorithm analysis via diffusion processes
Abstract


University | Department | Computer Science | FTP | Deutsche Leitseite
Barbara Lüthke, October 29, 1997