FPT Fest 2023

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.

FPT fest logo
FPT Fest 2023
Felix Reidl

Main content

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.

Mike and Fran
Uni Bergen

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 relativesDimitrios M. Thilikos
Flow augmentation & cutsMagnus Wahlström
TwinwidthEun Jung Kim
Graph isomorphismDaniel Neuen
Computational Social ChoiceJiehua Chen
SchedulingCeline Swennenhuis
FPT in MLRobert Ganian
Structural parameterizationsIgnasi Sau
Logic metatheoremsSebastian Siebertz
Exact algorithmsJesper Nederlof
Mathematical programmingMartin Koutecký
Kernelization and beyondBart M. P. Jansen
SAT and CSPsStefan Szeider

Each mini-symposium lasts for 2 hours.

Together with these mini-symposia, we have invited talks on the following topics:

Invited talks

Counting complexityMarc Roth
TreewidthTuukka Korhonen
PACE challengeAndré Nichterlein
Parameterized complexity & LogicSzymon Toruńczyk
Flow augmentationMarcin Pilipczuk
History of parameterized algorithms and complexityDániel Marx
Visibility Problems, Geometric Intersection Graphs, and Graph DrawingMeirav Zehavi

We are still in the process of finalizing the program.  The tentative program is as follows:

 SundayMonday A June 12Monday BTuesday A June 13Tuesday BWednesday (Mike's day) June 14Thursday A June 15Thursday BFriday June 16
Morning invited talk
09:00 — 10:00
 Flow augmentation:
Marcin Pilipczuk
Visibility Problems, Geometric Intersection Graphs, and Graph Drawing:
Meirav Zehavi

History of parameterized algorithms and complexity:

Dániel Marx

Parameterized complexity & logic:
Szymon Toruńczyk

Marc Roth

Coffee break
10:00 – 10:30
Morning symposium
10:30 — 12:30
 Math programmingFlow augmentation & cut problemsStructural parameterizationsExact algorithms10: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:
Panel discussion
* Daniel Lokshtanov
* Dániel Marx
* Blair D. Sullivan
* Stefan Szeider

Moderated by Bart MP Jansen
Treewidth and relativesSchedulingSAT / CSPs
Lunch break
12:30 — 14:00
Afternoon symposium
14:00 — 16:00
 TwinwidthGraph IsomorphismComputational Social ChoiceKernels and beyond

CS unplugged

Frances A. Rosamond

FPT in machine learningLogic meta-theoremsEnd of fest
Coffee break
16:00 — 16:30
Afternoon invited talk
16:30 — 17:30
 PACE: André NichterleinTime off

Eat dinner on your own

Boat trip at 19:00
Story time

Tuukka Korhonen

EveningWelcome reception  FPT Fest Dinner at 18:30   

Organizing committee

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


Related content