Research Programs


Graphs, Hypergraphs, and Computing

14 January - 14 May 2014

Many problems from both everyday applications and other branches of mathematics lead to questions best posed in terms of graphs and hypergraphs. These can be questions about the existence of optimal solutions to optimization problems, the structure of graphs with certain properties or whether solutions can be found efficiently. The different questions are interrelated, e.g. one can often use structural results to designs efficient algorithms for finding optimal solutions.

The programme will bring together researchers from each of these three directions; existence problems, structural problems and algorithms. Our aim is to both promote research within each field, by bringing together researchers from different countries, and to encourage interaction between the fields by having a mix of people from each field present at the institute.
Magnus M. Halldorsson
Reykjavik University
Klas Markström
Umeå University
Andrzej Rucinski
Adam Mickiewicz University
Carsten Thomassen
Technical University of Denmark, DTU


Klas Markström


For practical matters at the Institute, send an e-mail to