DECEMBER 3-7, 2017
Tel Aviv, Israel
*The registration deadline is 15th October at the nominal rate of 70
dollars.*
What do we cover—a mix of classical basic results and new trends. In
particular
(1) Basic Materials: The essential parameterized complexity tools such as
branching, kernelization, uses of randomization, sophisticated branching,
iterative compression, hardness tools such as W[1]-hardness, ETH, SETH and
Kernel lower bounds.
(2) Advances in integer programming
(3) FPT Approximation: Upper Bound and Lower Bounds including the hardness
of biclique and dominating set
(4) Lossy Kernelizartion
(5) Structural sparsity and parameterized algorithms (such as parameterized
algorithms on graphs of bounded expansion and nowhere dense graphs)
(6) Computational social choice theory
(7) FPT in P
(8) Techniques in shaving polynomial factors in the running time of FPT
algorithms
Who will teach:
Piotr Faliszewski, AGH University of Science and Technology, Poland
Daniel Marx, Hungarian Academy of Sciences, Hungary
Shmuel Onn, Technion, Israel
Michał Pilipczuk, University of Warsaw, Poland
M. S. Ramanujan, University of Warwick, England
Uri Zwick, Tel Aviv University, Israel
Daniel Lokshtanov, University of Bergen
Saket Saurabh, Institute of Mathematical Sciences
Fedor Fomin, University of Bergen
Hadas Shachnai, Technion, Israel
Meirav Zehavi, Ben Gurion University, Israel
Apart from these we will have open problem session and a survey talk on
what next.
For more information see: https://rapctelaviv.weebly.com/
**********************************************************
*
* 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
