This course is a block course (see details below) and in English. It is mainly
conducted by our visiting professor, Drago Bokal, University of Maribor,
and supervised by Markus Chimani.
In the course, we will start with an elementary puzzle that can be solved using
a graph theory model. We will build upon its solution towards graph drawing,
using a recently characterized graph class of 2-crossing-critical graphs. In
this class, we will study graph invariants relevant in algorithms and network
modelling. Students will prepare a research paper that could be a step towards
their thesis or either an academic or professional research career.
The course is a mixture of lectures, flipped classroom, and practical course
(meaning "doing theory in practice", as in "for real").
The central days of the course (mandatory attendance!) are
Mon, Sept. 30rd
Tue, Oct. 1st
Wed, Oct. 2nd
Fri, Oct, 4th.
There will be course material to be read prior to this week (this will be made
available on Sept. 1st at the latest). Having read this material before the
course starts is a prerequisit (and may help you understand whether you are
interested in the course, after all).
Following the core week, you will be writing a paper on the topic. For this,
counseling hours (also via skype with Prof. Bokal) will be available. The
grading is based on the quality of the paper and its genesis.
The target audience for this course is Master students, or at least
BSc students close to graduation. There is a limit on the number of spots.
If we'd be overfull, we'd filter by previous experience with graph
The Opium deadline is Oct. 1st