Hi everybody,

well, I'm not going to present a paper tomorrow. Instead we continue in our series on FPT algorithms and particularly in the introduction to the area of FPT, started by Martin before four weeks. We will talk more about techniques for designing fast exponential algorithms for hard problems.

More concretely, I plan to present a quite surprising application of inclusion-exclusion principle, illustrated on counting Hamiltonian paths and possibly also on Steiner tree, and a nice application of polynomials and the Schwartz-Zippel lemma for Longest path.

The talk will require zero previous knowledge and will be based on the recent and very readable book Parameterized Algorithms:

http://parameterized-algorithms.mimuw.edu.pl/

See you in S6 tomorrow at 9:50.

Best regards, Pavel

On 4/12/2017 at 2:17 PM Jan Musílek wrote:

Dear colleagues,

let me remind you that the doctoral seminar is cancelled tommorow due to Cédric Villani's lecture.

We will continue the series next Thursday with a paper presented by Pavel Veselý.

With best regards, Honza

---

Doctoral seminar announcement mailing list [dokt-seminar-l] To unsubscribe and edit your options, visit: https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l