DIREC Algorithms workshop, September 13, 2021
Program
10.00 - 10.01: Welcome
10.01 - 11.01: Computationally hard problems
- Radu Curticapean. Counting (with) homomorphisms.
- Paloma Lima. b-coloring graphs of bounded clique-width. (Slides)
- Jakob Nordström. Leveraging computational complexity theory for verifiably correct combinatorial optimization. (Slides)
11.15 - 12.15: Algorithmic game theory
- Nidhi Rathi. Fair Cake Division under Monotone Likelihood Ratios. (Slides)
- Ioannis Caragiannis. On interim envy-free allocation lotteries.
- Kasper Høgh. FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
13.15 - 13.55: Data structures
- Christian Lebeda. Differentially private sparse vectors with low error, optimal space, and fast access.
- Ioana Bercea. Dictionaries et al.
14.10 - 15.10: Scalable algorithms
- Ora Nova Fandina. Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures.
- Krzysztof Nowicki. Massively Parallel Algorithms for Spanning Trees and Small Cuts.
- Chris Rene Schwiegelshohn. Smaller Coresets for Clustering.
Other confirmed participants:
- Aleksander Christiansen
- Diego F. Aranha
- Eva Rotenberg
- Evangelos Kipouridis
- Irene Parada
- Jacob Holm
- Jakob Andersen
- Joan Boyar
- Jonas Klausen
- Kasper Green Larsen
- Kim Skak Larsen
- Kristoffer Arnsfelt Hansen
- Lene Monrad Favrholdt
- Lorenzo Beretta
- Mikkel Thorup
- Mikael Høgsgaard
- Nutan Limaye
- Philip Bille
- Riko Jacob
- Rolf Fagerberg
- Sophia Yakoubov
- Srikanth Srinivasan
- Thore Husfeldt