University of Konstanz
Prof. Dr. Ulrik Brandes

Graph Drawing (SS 2013)

+++ Announcements +++

Prof. Seok-Hee Hong from University of Sydney will give a lecture on "Symmetries in graph drawing" on Tue, July 16 in the regular lecture slot.

The evaluation of lecture and tutorial was discussed on June 15.

Layout algorithms for graphs form the basis of effective and efficient visualization of networks.

Thus, automatic graph drawing is important in core areas of computer science like data bases, software engineering, VLSI and network design, and visual user interfaces. It is also relevant in other application areas, for example, in engineering, chemistry and biology, and social or political science.

Various algorithmic methods for automatic graph drawing will be treated, for instance, force-directed or flow-based methods.

General Information

Lecture (M. Mader, B. Pampel)
Algorithmics Group (U. Brandes)
Tue 17:00–18:30 (D 436)
Wed 17:00–18.30 (D 436) bi-weekly
Tutorial (A. Nocaj) Wed 17:00–18:30 (D 436) bi-weekly
oral exams first date: Wed July 31, room E216.
second date: Wed Oct 9, room E216.

Please use for any inquiries or feedback.


Theoretical Assignments

The theoretical assignments are made available on this webpage on Thursdays. The solutions are usually due in written form until the Thursday two weeks after handout at 8 a.m.. You can choose to either deposit them in the box marked "Abgabe" between rooms E202 and E203, or to submit them electronically in one PDF file to: .

In the latter case, please follow the naming schema uXX_name1_name2.pdf, where XX indicates the number of the assignment. We will return the corrected and scored assignments in the tutorial. Whatever is not picked up will be placed back into the handout box marked "Rückgabe".

Practical Assignments

The practical assignments have to be implemented in Java.

We suggest to use the development environment Eclipse (download). Feel free to use any other editor/IDE as long as you submit in the correct way.

The data structures and visualization methods we will be using are provided by the yFiles library (API), contained in the project data for the first practical assignment. The library license is restricted to academic purposes within the algorithmics group. You are neither allowed to distribute the library, nor to use it for projects outside the scope of this lecture.

The submission of practical assignments will be via svn. The base directory is Each group will have access to only one sub-package and the material package. Use your university login firstname.lastname with the corresponding password for access.
Further requirements:

The assignments are returned and discussed during the tutorials. 50 percent of the total score of the assignments, regular attendance at the tutorials, and the presentation of at least one of your solutions are necessary to be admitted to the final exam.

You are permitted and encouraged to work in groups of two.

No. Posted Due Date Tutorial Download
1 25.04.2013 02.05.2013 08.05.2013 u01.pdf
2 02.05.2013 16.05.2013 22.05.2013 u02.pdf
3 16.05.2013 30.05.2013 05.06.2013 u03.pdf
4 31.05.2013 13.06.2013 19.06.2013 u04.pdf
5 13.06.2013 27.06.2013 03.07.2013 u05.pdf
6 27.06.2013 11.07.2013 17.07.2013 u06.pdf
7 11.07.2013 25.07.2013 N/A u07.pdf

Lecture Notes

The lecture will be based on lecture notes (in German, local access) from the same course in 2007.

Slides (local access only)


Further Information