Colloquium on "Paths, cycles and beyond" given by Fedor Fomin (University
of Bergen). The seminar will take place at 14:00 CET (local time in central
Europe), and will be followed by a discussion session. We would like to
invite you to take part in the event including the networking session. This
new event aims to integrate the European algorithmic community and keep it
connected during the times of the pandemic. The meeting will be held using
Airmeet platform and to attend please go to
https://www.airmeet.com/e/95042280-5fa9-11eb-aaca-7311389a5bfb. You can
find more information about the talk on IGAFIT web page:
http://igafit.mimuw.edu.pl/?page_id=483786.
We invite you to take part in the event. Please advertise broadly and bring
your students/postdocs as well.
The details of the talk are given below.
January 28, 2021, 14:00 CET
Fedor Fomin (University of Bergen)
Title: Paths, cycles and beyond
Abstract: I will speak about old and new parameterized algorithms for
finding long paths and cycles in graphs. In particular, we discuss problems
of finding paths and cycles whose lengths are beyond some "trivial" bounds.
Organization Committee:
Nikhil Bansal
Artur Czumaj
Andreas Feldmann
Danupon Nanongkai
Adi Rosén
Eva Rotenberg
Piotr Sankowski
Christian Sohler
**********************************************************
*
* 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
