Dear all,
tomorrow I will be speaking about the Target Set Selection problem - specifically I will show why the problem is W[1]-hard when parameterized by treedepth. No previous knowledge of parameterized complexity is needed.
Most probably I will also speak about some algorithms and/or some other hardness proofs for other paramaterizations.
Hope to see you on seminar, Dusan