Annual winter school

The 19th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place March 22 – March 24 at Dr Holms, Geilo.

This year we organized it jointly with the machine learning group, and it was organized as an open problem session.

The program included:

• Open problem sessions with problems by ALGO and ML
• Master presentations
• Skiing

The 18th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place March 30 - April 1 at Dr Holms, Geilo.

The program included:

• Jan Kratochvil, New Results on the Complexity of Graph Covers
• Open Problem Session by 1.Lars and 2.Kenneth (and 5.X if time and anyone volunteers)
• Kenneth Langeland, Vertex Cover Heuristics using Graph Neural Networks
• Open problem session by 3.Mateus and 4.Petr and 5.X (as above)
• Group Work on Open Problems
• Petra Wolf, Decomposing Automata - Fewer rejections make things easier
• Sjur Flåm, Computer Science and Economics
• Master student presentations
• Skiing

The 2019 winter school took place in Hotel Finse 1222.

The program included:

• Practical Kernelization I-II (Lecture by Christian Schulz)
• Open problems session, hosted by Fedor
• Introduction to Bayesian networks I: representation (Lecture by Pekka Parviainen)
• Practical Kernelization III: exercies (Christian Schulz)
• Introduction to Bayesian networks II: inference  (Lecture by Pekka Parviainen)
• Introduction to Bayesian networks III: learning (Pekka Parviainen)
• Master presentations
• Guest student presentations
• Group work on open problems

The 16th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place at Geilo Hotel on March 21-23, 2018.

The program included:

• Lecture by Mike Fellows, The past and future of parameterized complexity
• Open problems session, hosted by Daniel (Birk gives small presentation)
• Lecture by Chunlei Li, Tutorial on block-chain
• Lecture by Marija Slavkovik, Consensus and compsomise in social choice -the challenge
• Master student presentations
• Lecture by Christoph Tratner, Recommender systems
• Lecture by Julien Baste, F-deletion parameterized by treewidth

The 15th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place in Myrkdalen betwenn February 20 and 22, 2017.

The program included:

• Edith Elkind: Computational Social Choice (Six parts)
• Fredrik Manne: Greedy Matchings and Stable Marriages
• Sushmita Gupta: Popular Matching: A Brief Overview
• Open Problem Session
• Amer Mouawad: Fast Bounded-Difference Min-Plus Product.
• Master student presentations

The 14th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place March 7-9 2016 at Finse.

The program included sessions on:

• Stable Matching paper
• Lossy Kernels
• Derandomization paper
• MSR talk
• Master presentations
• Open problems

The 13th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place 16-18 February, 2015 in Ustaoset, at Ustaoset Hotel.

The 12th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place March 19-21, 2014, in Finse at Hotel 1222.

The program included:

• Introduction to Circuit Complexity
• Lecture on Circuit Complexity
• New developments on Circuit Complexity
• Introduction to LP Branching
• New developments on LP Branching
• Rump sessions
• Presentations by master students

The 11th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place 20-22 February, 2013 in Ustaoset, at Ustaoset Hotel. 

The program included:

• Group sessions:
  • Preliminaries
  • Weighted bipartite matching
  • Counting perfect matchings in planar graphs
  • Replacement paths
  • Network Coding
• Lectures by Marek Cygan

The 10th Annual Winter School in Algorithms, Graph Theory and Combinatorics took place 22-24 February, 2012 in Finse.

The program included team presentations and discussions.

The Ninth Annual Winter School in Algorithms, Graph Theory and Combinatorics took place 23-25 February 2011 at Geilo, an alpine skiing center 40 km East of Finse.

The program included four three-hour tutorials:

• Sparsification using VC-dimension, by Yuri Rabinovich from Haifa University.
• Nowhere dense graphs and algorithms, by Zdenek Dvorak from Charles University.
• LP and graph algorithms in sage, by Nathann Cohen from Sophia-Antipolis.
• Multicore programming: architecture and optimization, by Erik Hagersten from Uppsala University.

The 8th Annual Winter School in Algorithms, Graph Theory and Combinatorics 2010 took place February 24-26 2010 at Hotel Finse 1222.

The program (likely) included:

• Josef Cibulka, Forbidden 0-1 matrices and runtime of algorithms
• Erik Jan van Leeuwen, Approximation algorithms (tutorial-style?)
• Christophe Paul, Split decompositions (tutorial-style?)
• Benjamin Leveque, Coloring perfect graphs by contraction
• Daniel Paulusma, k-path problem in claw-free graphs
• Ondra Suchy, Directed Steiner trees
• Yngve Villanger, Global graph structures for exact algorithms

Jean Blair, Tomas Gavenciak, Fredrik Manne and Jan Arne Telle were responsible for several open problem sessions oriented towards both students and researchers.

The 7th Annual Winter School in Algorithms, Graph Theory and Combinatorics 2009 was held 12-15 March 2009 at Hotel Erboy, Istanbul, Turkey.

This year's "winter" school was organized as a part of our NordForsk project NoNA - Nordic Network on Algorithms.

The program included:

• Tutorial by Dimitrios Thilikos
• Tutorial by Pierre Fraigniaud
• Lecture by Michel Habib

The 6th Annual Winter School in Algorithms, Graph Theory and Combinatorics 2007 was held 05-07 March, 2007, at Hotel Finse 1222.

Program included:

Monday:

• Session 1: Short presentation of the four major session topics 
  D. Meister, Ch. Papadopoulos, Y. Villanger, Xin Q.
• Session 2:
  • Minimizing Movement
  • Group Daniel Meister
  • Talk Bernard Lidicky

Tuesday:

• Session 3: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
• Group Xin Qin
• Session 4: Finding a Heaviest Triangle is not Harder than Matrix Multiplication
• Group Yngve Villanger
• Talk Ondra Suchy

Wednesday:

• Session 5: Line-of-Sight Networks
• Group Charis Papadopoulos

The 5th Annual Winter School in Algorithms, Graph Theory and Combinatorics 2005 took place 12-14 February, 2006, at Hotel Finse 1222.

The program included:

• Working sessions
• Problem solving sessions

The 4th Annual Winter School in Algorithms, Graph Theory and Combinatorics 2005 was held 01-04 April, 2005, at Ustedalen hotel, Geilo.

This year's winter school is organized as a part of our NordForsk project NoNA - Nordic Network on Algorithms.

The 3rd Annual Winter School in Algorithms, Graph Theory and Combinatorics 2004 took place 01-03 February, 2004, at Hotel Finse 1222.

The program included workings sessions and problem solving sessions.

The 2nd Annual Winter School in Algorithms, Graph Theory and Combinatorics 2003 took place 23-25 February, 2003, at Hotel Finse 1222.

The program included group work with sessions on these subjects:

• Distributed graph algorithms
• Robust algorithms and unit disc graphs
• Graph algorithms in data mining
• The web graph

The 1st Annual Winter School in Algorithms, Graph Theory and Combinatorics took place 24-26 February, 2002, at Hotel Finse 1222.

The program included group work and sessions around these subjects:

• Graphs that are intersections of curves
• Tree-decompositions of graphs
• Algorithms for minimal triangulation of graphs
• Self-stabilizing algorithms