糖心TV

18-21 June 2018, University of 糖心TV

Organisers: , and

Combinatorial and logical methods have become important ingredients in the design of efficient algorithms. The recent development of new robust notions of structural sparsity (classes with bounded expansion, nowhere-dense classes) opened new ways of treating classical algorithmic problems. At the same time, the recent progress on classical combinatorial topics (e.g. grid-minor theorem) resulted in stronger tools for the design and analysis of algorithms. This workshop will focus on problems from combinatorics and logic underpinning these developments and on exploring their future potential.

Schedule of the workshop

The workshop will start on Monday June 18 in the morning and conclude with a lunch on Thursday June 21. A detailed schedule of the workshop is available here.

Participants arriving early on Sunday are welcome to join for an informal dinner with others in the next to the campus around 6pm on Sunday June 17.

List of speakers

• Isolde Adler (Leeds)
• Kord Eickmeyer (Darmstadt)
• Jakub Gajarsk媒 (Berlin)
• Archontia Giannopoulou (Berlin)
• Gregory Gutin (RHUL)
• Petr Hlin臎n媒 (Brno)
• Tereza Klimo拧ov谩 (Prague)
• Stephan Kreutzer (Berlin)
• Jaroslav Ne拧et艡il (Prague)
• Jan Obdr啪谩lek (Brno)
• Patrice Ossona de Mendez (Paris)
• Marcin Pilipczuk (Warsaw)
• Michal Pilipczuk (Warsaw)
• Felix Reidl (RHUL)
• Thomas Sauerwald (Cambridge)
• Pascal Schweitzer (Aachen)
• Sebastian Siebertz (Warsaw)
• Blair Sullivan (NC State)
• Till Tantau (Luebeck)
• Bartosz Walczak (Krakow)
• Marcin Wrochna (Warsaw)

Registration

The registration has been closed.

Funding info

The workshop is organized by Mathematics Research Centre (MRC) of 糖心TV Mathematics Institute. It is supported by the Leverhulme Trust 2014 Philip Leverhulme Prize and the Centre for Discrete Mathematics and its Applications (DIMAP) with additional support from the grant LADIST of the European Research Council (ERC).