The symposium will happen in Hotel Terminus, Bergen.
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 a 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, mini-symposia, and one full day (Wednesday) devoted to Mike and his contributions to computer science.
https://www.uib.no/en/rg/algo/160260/fpt-fest-2023-honour-mike-fellows
The mini-symposia will deal with the following topics. Behind each topic, we list the name of the corresponding mini-symposium organizer.
Exact algorithms (Jesper Nederlof)
FPT in ML (Robert Ganian)
Flow augmentation & cuts (Magnus Wahlström)
Graph isomorphism (Daniel Neuen)
Kernelization and beyond (Bart M. P. Jansen)
Logic metatheorems (Sebastian Siebertz)
Mathematical programming (Martin Koutecký)
SAT and CSPs (Stefan Szeider)
Scheduling (Celine Swennenhuis)
Social choice & matching (Jiehua Chen)
Structural parameterizations (Ignasi Sau)
Treewidth (Dimitrios M. Thilikos)
Twinwidth (Eun Jung Kim)
Together with this mini-symposia, we have invited talks on the following topics:
Counting complexity (Marc Roth)
Flow augmentation (Marcin Pilipczuk)
History of FPT (Dániel Marx)
Parameterized Computational Geometry (Meirav Zehavi)
Parameterized complexity & Logic (Szymon Toruńczyk)
Treewidth (Tuukka Korhonen)
We are still in the process of finalizing the program. Please visit the website and register for the symposium. Let us all come together and celebrate Mike and his enormous contributions.
All are welcome.
The scientific organizing committee:
Saket Saurabh (chair)
Bart Jansen
Daniel Lokshtanov
Fedor Fomin
Marcin Pilipczuk
Michał Pilipczuk
Pål Grønås Drange
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
