1165 København K
Tlf: 21 17 95 65 (man-fre kl. 9-15)
Ph.d.-forsvar — On 30 November, Jacob Holm will defend his PhD thesis at the Department of Computer Science entitled Efficient Graph Algorithms and Data Structures.
Date & Time:
Auditorium 03, HCØ, Universitetsparken 5, 2100 Ø
Efficient Graph Algorithms and Data Structures
The graph is one of the most important abstractions used in computer science. This thesis gives substantial improvements to the state of the art regarding 4 different problems on static or dynamic graphs, namely: Static reachability in planar graphs, Online bipartite matching with recourse, Deterministic fully-dynamic 2-edge connectivity and bridge-finding, and Strong trail orientations of graphs.
Chairman: Associate Professor Thomas Dueholm Hansen, Department of Computer Science, University of Copenhagen
Professor Valerie King, Department of Computer Science, University of Victoria, Canada
Professor Uri Zwick, Department of Computer Science, Tel-Aviv University, Israel
Professor Mikkel Thorup, Department of Computer Science, University of Copenhagen
Professor Stephen Alstrup, Department of Computer Science, University of Copenhagen
For an electronic copy of the thesis, please contact email@example.com