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/0368-3383-01.html

1	Feb 28
2	Mar 6	Bar Aschner	Chapter 2: Kernelization, pp. 17-39.
3	Mar 13	Guy Ben Simhon Boaz Touitou	Chapter 3: Bounded search trees, pp. 51-69.
4	Mar 20	Lior Gluskin Ekaterina Polei	Chapter 4: Iterative compression, pp. 77-94.
5	Mar 27	Ran Feder Ori Yemini	Chapter 5: Randomized methods, pp. 99-122.
6	Apr 3	Elad Marcus Raz Ramon	Chapter 6: Miscellaneous, pp. 129-146.
7	Apr 10	Tomer Bincovich Dan Dorfman	Chapter 7: Treewidth, Sections 7.1-7.3, pp. 151-177.
			-
8	May 1	Orit Sanandaji Keren Zubovsky	Chapter 7: Treewidth, Sections 7.5-7.6, pp. 185-199.
9	May 8	Amit Chen Ilana Serebrin	Chapter 10: Algebraic techniques, Sections 10-10.1, pp. 321-328, Sections 10.4-10.4.1 pp. 337-346.
10	May 15	Omer Shwartz Dor Wucher	Chapter 12: Matroids, Sections 12-12.3, pp. 377-409.
11	May 22	Maor Elias Ofri Nevo	Chapter 13: Fixed-parameter intractability, pp. 421-459. (Some parts will be omitted.)
12	May 29	San Amirieh Barak Mizrahi	Chapter 14: Lower bounds based on the Exponential-time hypothesis, Sections 14-14.4, not including 14.4.1, pp. 467-489.
13	Jun 5	Uri Goodman Omer Kafri	Chapter 15: Lower bounds for kernelization, pp. 523-552.