Your search returned the following 2 documents:

2. Approximating the volume of unions and intersections of high-dimensional geometric objects.
   Karl Bringmann and Tobias Friedrich
   In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 436-447
   
1. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
   Tobias Friedrich and Nils Hebbinghaus
   In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 693-704