Algorithms
Seminar
Supervisor:
Uri Zwick
Spring Semester 2016
Lectures will be
based on the book
Parameterized Algorithms,
by M. Cygan, F.V. Fomin, Ł. Kowalik, , D. Lokshtanov, , D. Marx, M. Pilipczuk,
M. Pilipczuk, S. Saurabh
A draft of the book: A draft of the book
Mailing list: http://listserv.tau.ac.il/archives/0368338301.html
1 
Feb 


2 
Mar 6 
Bar Aschner 
Chapter 2: Kernelization,
pp. 1739. 
3 
Mar 
Guy Ben Simhon 
Chapter 3: Bounded search trees, pp. 5169. 
4 
Mar 20 
Lior Gluskin

Chapter 4: Iterative compression,
pp. 7794.

5 
Mar 27 
Ran Feder 
Chapter 5: Randomized methods, pp. 99122. 
6 
Apr 
Elad Marcus 
Chapter 6: Miscellaneous, pp. 129146. 
7 
Apr 
Tomer Bincovich 
Chapter 7: Treewidth, Sections 7.17.3, pp. 151177. 

 

8 
May 
Orit Sanandaji 
Chapter 7: Treewidth, Sections 7.57.6,
pp. 185199. 
9 
May 
Amit Chen 
Chapter 10: Algebraic techniques, 
10 
May 
Omer Shwartz 
Chapter 12: Matroids, Sections 1212.3,
pp. 377409. 
11 
May 
Maor Elias 
Chapter 13: Fixedparameter intractability, pp. 421459. 
12 
May 
San Amirieh 
Chapter 14: Lower bounds based on the Exponentialtime hypothesis, 
13 
Jun 
Uri
Goodman 
Chapter 15: Lower bounds for kernelization,
pp. 523552. 