AlgoMaNet – Algorithms and Mathematics Network
AlgoMaNet is a network based on collaboration among several research groups in the areas of discrete algorithms, discrete mathematics and theoretical computer science, which all are based at Central European universities. The network was founded in 2019 and currently includes Charles University in Prague, Eötvös Loránd University in Budapest, Jagiellonian University in Kraków, Masaryk University in Brno and the University of Warsaw.
The AlgoMaNet network offers lectures on advanced topics primarily to MSc and PhD students affiliated with one of the network universities. The courses are usually organized as one week courses, often in parallel with another course in the same week; it is possible (and common) to attend only one of the two courses offered while the schedule allows attending both courses. The courses are offered as intensive courses with a lecture held on each weekday and a part of each weekday also devoted to solving exercises given during the lectures.
Courses offered in the academic year 2022/23
- Sep 5-9, 2022, Eötvös Loránd University, Budapest
Péter Pál Pach (Budapest University of Technology and Economics): TBA
Courses offered in the academic year 2021/22
- May 23-27, 2022, Jagiellonian University, Kraków
Gwenaël Joret (Université Libre de Bruxelles): Product structure of planar graphs
Piotr Micek (Jagiellonian University): Combinatorics of posets
Courses offered in the academic year 2020/21
- August 23-September 3, 2021, Charles University, Prague
Pavel Hubáček (Charles University): Foundations of theoretical cryptography (Aug 23-27)
Michal Koucký (Charles University): Fine-grained complexity (Aug 30-Sep 3)
These two courses originally planned to be held in May 2020 at Charles University had to be rescheduled to June 2021 and then to August 2021 because of the coronavirus pandemic.
Courses offered in the academic year 2019/20
- January 13-January 24, 2020, University of Warsaw
Mikołaj Bojańczyk (University of Warsaw): Automata, semigroups and logic (Jan 13-17)
Michał Pilipczuk (University of Warsaw): Combinatorics and algorithms for sparse graphs (Jan 20-24)
- January 27-February 7, 2020, Masaryk University, Brno
Andrzej Grzesik (JU Kraków): Extremal graph theory
Petr Hliněný (MU Brno): Topological and geometric graph theory (half course, Feb 3-7)
Dan Kráľ (MU Brno): Regularity method (half course, Jan 27-31)
Contact detailsThe program is overseen by the steering committee assisted by Darina Boukalová (
boukalovaHgT2Q9kuG@firaHqrlEE0.muniRohM6n29j.cz) from Masaryk University, Brno.
- Zdeněk Dvořák (Charles University, Prague)
- Daniel Kráľ (Masaryk University, Brno)
- Dömötör Pálvölgyi (Eötvös Loránd University, Budapest)
- Szymon Toruńczyk (University of Warsaw)
- Bartosz Walczak (Jagiellonian University, Kraków)