Final Colloquium 2008

Universität Karlsruhe (TH), 23. Mai 2008

The final colloquium of the DFG priority programme 1126 Algorithms for Large and Complex Networks will be held at Universität Karlsruhe (TH) on May 23rd, 2008.

Colloquium Program

The information desk for on-site registration will open at 9:30. At 10:00 the official program will start with a brief welcome. At noon, we will have a catered lunch break. The colloquium will be concluded with closing words at about 17:15. The colloquium consists of a number of invited talks by experts in the fields of algorithmics and networks. Additionally there will be a poster exhibition during the whole day, showcasing research results of this priority programme 1126.

Confirmed invited speakers are:

Registration

Attendance is free of charge. Please register until May 13th to ease the organization (i.e. have the catering service provide enough beverages and food).

Location and Getting There

The colloquium will take place in the Tulla-Hörsaal (lecture hall Tulla, click for a campus map) at the Universität Karlsruhe (TH) (building 11.40, room 103). It is located at the Southwestern corner of the campus, in the so-called Ehrenhof area of the university.

The lecture hall can be reached easily by tram or by foot. After a 2-minutes walk from the tram stop Kronenplatz / Universität you will arrive at the Tulla-Hörsaal . If you arrive at Karlsruhe by train, you can easily reach the university by one of the trams leaving from the station forecourt, just outside the main entrance. The best connections going from the main train station to the university are the following lines:

(Watch out for "S"-lines. For example, lines "2" and "S2" are not the same line.)

The colloquium location is within walking distance from the city center (less than 15 minutes) and Karlsruhe palace (about 10 minutes).

Accommodation

If you need an accommodation please find a list of hotels below or check Karlsruhe's accommodation page.

Organisation

For any further questions, please feel free to contact us:

Links