Graphs and range searching in external memory

PhD defence, Tuesday 30 October 2012. Freek van Walderveen.

2012.10.30 | Nanna M. E. Pedersen

Freek van Walderveen

Noise in seabed terrain data, removed by the algorithm

In his PhD studies, Freek van Walderveen studied algorithms for handling large graphs that do not fit in the computer’s main memory and have to stay on slow secondary storage such as hard disks. He focused on applications in terrain data cleaning (noise removal), social network analysis, and planar graphs (such as road or river networks without bridges or tunnels).

The second topic in his dissertation is range searching data structures that can be used in (geometric) databases, for example, for efficiently reporting certain statistics for data items contained in given query ranges.

The PhD degree was completed at the Department of Computer Science, Science and Technology, Aarhus University.

Time: Tuesday 30 October at 13.00
Place: Large Lecture Theatre, building 5510, room 103, INCUBA Science Park, Aarhus University, Åbogade 15, 8200 Aarhus N
Title of dissertation: External Memory Graph Algorithms and Range Searching Data Structures
Contact information: Freek van Walderveen,
Members of the assessment committee:
Associate Professor Stephen Alstrup, Department of Computer Science, University of Copenhagen
Professor Ulrich Meyer, Institute for Computer Science, Goethe University Frankfurt, Germany
Professor Peter Bro Miltersen (chair), Department of Computer Science, Aarhus University
Main supervisor:
Professor Lars Arge, Department of Computer Science, Aarhus University
Language: The dissertation will be defended in English

The defence is public.
The dissertation is available for reading at the Graduate School of Science and Technology/GSST, Ny Munkegade 120, building 1521, room 112, 8000 Aarhus C.


PhD defence
Comments on content: 
Revised 16.03.2018