Mike Fellows - FPT Multivariate Algorithmics

Look closely at the top of the skyscraper and see a swing and 2 people swinging! WOW! Amsterdam is interesting and friendly. We also visited Naarsen-Bussum which was the ancient fort to defend Amsterdam from Spanish, French and others. Also, site of multiple massacres. Our visit to Bussum was to see Eljakim Schrijvers who is Treasurer and Chair of IOI International Programming Computing Challenge and also Bebras.

The audience for the Nerode Prize talk overflowed the room and a second room showed the talk on video. Also, many ESA papers were about Parameterized Complexity. Lots of wonderful new ideas being shared here.

Today Neeldhara posted: Post
See new Tweets
Conversation
Neeldhara 🐦|🐘

This is a nice collection of algorithmic applications of the principle of inclusion-exclusion:

https://cp-algorithms.com/combinatorics/inclusion-exclusion.html -number-of-strings-that-satisfy-a-given-pattern

For even more examples, check out Section 10.1 here:

https://mimuw.edu.pl/~malcin/book/p

A great experience was Dagstuhl Seminar 23291 on Parameterized Complexity and Approximation. It was organized by Karthik C. S. (Rutgers University) ,Parinya Chalermsook (Aalto University, FI), Joachim Spoerhase (University of Sheffield, GB) ,Meirav Zehavi (Ben Gurion University - Beer Sheva, IL) .
A discussion panel included Mike Fellows (Univ Bergen, Western Sydney Univ), Venkatesan Guruswami (UC= Berkeley), Bingkai Lin (Nanjing University, CN), Frances Rosamond (Univ Bergen, Western Sydney Univ, Panel Moderator), Saket Saurabh (Univ Bergen, IMSc), Amir Abboud (Weizmann Institute - Rehovot, IL)