FPT Fest 2023 in the honour of Mike Fellows
June 12 to June 16, 2023, you are cordially invited to attend FPT Fest in the honour of Mike Fellows.
On June 12 — June 16, we are organising a symposium in Bergen, Norway: FPT Fest in the Honour of Mike Fellows.
The symposium will happen in Grand Hotel Terminus, Bergen.
The full program in PDF version: FPT Fest Program.pdf.
Mike Fellows (together with Rod Downey) is one of the principal founders of parameterized complexity, a two-dimensional framework for complexity analysis and algorithm design based on two fundamentally different kinds of timecosts: polynomial timecosts as a function of the overall input size (as in the central concept of P in the one-dimensional classical framework for computational complexity) together with a second dimension of timecosts associated to a vector of relevant secondary measurements, such as input structure, degree of approximation or amount of quantization, algorithmic operational aspects, etc., to confine the explosions.
Besides his work in mathematics, algorithms and complexity theory, Mike is noted for his seminal contributions to the popular communication of the mathematical sciences and related efforts in Computer Science curriculum reform at all age levels, including the much-translated "Computer Science Unplugged" (with New Zealand coauthors Tim Bell and Ian Witten), which has had substantial world-wide impact.
For these two contributions, Mike received Australia's highest civilian honor, Order of Australia, Companion to the Queen (AC), an honor descended from and essentially equivalent to a UK Knighthood. He is also only the second Norwegian to be listed on New Zealand's remarkable Hobbit List (technically: HonFRSNZ), the first being G.O. Sars, one of the world's first Oceanographers, who notably wrote a book about the freshwater crustaceans of New Zealand, thus joining north and south in the early days of Science.
The symposium will consist of a number of invited talks, minisymposia, and one full day (Wednesday) devoted to Mike and his contributions to computer science.
Registration is now closed. If you haven't gotten the chance to register yet, you may contact one of the organizers.
The mini-symposia will deal with the following topics. Behind each topic we list the name of the corresponding mini-symposium organizer.
|Treewidth and relatives||Dimitrios M. Thilikos|
|Flow augmentation & cuts||Magnus Wahlström|
|Twinwidth||Eun Jung Kim|
|Graph isomorphism||Daniel Neuen|
|Computational Social Choice||Jiehua Chen|
|FPT in ML||Robert Ganian|
|Structural parameterizations||Ignasi Sau|
|Logic metatheorems||Sebastian Siebertz|
|Exact algorithms||Jesper Nederlof|
|Mathematical programming||Martin Koutecký|
|Kernelization and beyond||Bart M. P. Jansen|
|SAT and CSPs||Stefan Szeider|
Each mini-symposium lasts for 2 hours.
Together with these mini-symposia, we have invited talks on the following topics:
|Counting complexity||Marc Roth|
|PACE challenge||André Nichterlein|
|Parameterized complexity & Logic||Szymon Toruńczyk|
|Flow augmentation||Marcin Pilipczuk|
|History of parameterized algorithms and complexity||Dániel Marx|
|Visibility Problems, Geometric Intersection Graphs, and Graph Drawing||Meirav Zehavi|
We are still in the process of finalizing the program. The tentative program is as follows:
|Sunday||Monday A June 12||Monday B||Tuesday A June 13||Tuesday B||Wednesday (Mike's day) June 14||Thursday A June 15||Thursday B||Friday June 16|
|Morning invited talk|
09:00 — 10:00
|Visibility Problems, Geometric Intersection Graphs, and Graph Drawing:|
History of parameterized algorithms and complexity:
|Parameterized complexity & logic:|
10:00 – 10:30
10:30 — 12:30
|Math programming||Flow augmentation & cut problems||Structural parameterizations||Exact algorithms||10:30 — 11:30: Mike R. Fellows |
O NO! Unfinished Business in Parameterized Complexity: A Radical Vision of the Future of PC that Comes from its Roots
11:30 – 12:30:
* Daniel Lokshtanov
* Dániel Marx
* Blair D. Sullivan
* Stefan Szeider
Moderated by Bart MP Jansen
|Treewidth and relatives||Scheduling||SAT / CSPs|
12:30 — 14:00
14:00 — 16:00
|Twinwidth||Graph Isomorphism||Computational Social Choice||Kernels and beyond|
|FPT in machine learning||Logic meta-theorems||End of fest|
16:00 — 16:30
|Afternoon invited talk|
16:30 — 17:30
|PACE: André Nichterlein||Time off|
Eat dinner on your own
Boat trip at 19:00
|Evening||Welcome reception||FPT Fest Dinner at 18:30|
This symposium is organized by
- Saket Saurabh
- Fedor V. Fomin
- Bart M. P. Jansen
- Marcin Pilipczuk
- Michał Pilipczuk
- Daniel Lokshtanov
- Pål Grønås Drange