Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse.

*
This talk was recorded for ESA 2020, Pisa (Italy), online due to Corona
*

Get slides as [pdf], or view this presentation on YouTube.

Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse.

*
Presented at STACS 2020, Montpellier (France)
*

Hans L. Bodlaender, Sudeshna Kolay and Astrid Pieterse.

*
Presented at WADS 2019, Edmonton (Alberta, Canada)
*

Get slides as [pptx].

Astrid Pieterse and Gerhard J. Woeginger.

*
Presented at ADT 2017, Luxembourg (Luxembourg)
*

Bart M.P. Jansen and Astrid Pieterse.

*Presented at IPEC 2017, Vienna (Austria)*

Get slides as [pdf].

Bart M.P. Jansen and Astrid Pieterse.

*Presented at MFCS 2016, Krakow (Poland)*

Get slides as [pdf].

Bart M.P. Jansen and Astrid Pieterse.

*Presented at IPEC 2015, Patras (Greece)*

Get slides as [pdf]; [LaTeX] (zip). The pdf images are created (and can be opened) using Ipe.

Approximate Turing Kernels for Problems Parameterized by Treewidth

*Presented via ZOOM in the Parameterized Complexity Seminar, June 15, 2020*.

This was a 60-minute presentation based on the arxiv paper with the same title, by Eva-Maria C. Hols, Stefan Kratsch and myself.

Tight Parameterized Preprocessing Bounds: Sparsification via Low-Degree Polynomials

*Presented at Eindhoven University of Technology, September 4, 2019*

This 10-minute presentation was a part of my thesis defense. It is a (very) short summary of my thesis, aimed at a broad audience.

Get slides as [pptx].

Parameterized Complexity of Conflict-free Graph Coloring

*Presented at the Workshop on Kernelization (Worker 2019) at the University of Bergen, Norway, June 3-7, 2019*

This presentation was recorded, you can view it on YouTube.

Polynomial kernels for hitting forbidden minors using constant treedepth modulators

*Presented at the NWO-JSPS Seminar at Eindhoven University of Technology, September 13, 2018*

Get slides as [pdf].

Polynomial kernels for hitting forbidden minors using constant treedepth modulators

*Presented at the TACO Day at Maastricht University, April 5, 2018*

Get slides as [pdf].

Sparsification of Constraint Satisfaction Problems with an application to q-Coloring

*Presented at Birkbeck University of London in London, February 20, 2018*

Get slides as [pdf]; [LaTeX] (zip).

Data Reduction for Graph Coloring Using Low-Degree Polynomials

*Presented at the fifth Networks training week in Asperen, October 31, 2017*

Get slides as [pdf].

Introduction to Kernelization

*Presented at the Networks PhD colloquium in Amsterdam on October 21, 2016*

Get slides as [pdf]; [LaTeX] (zip).

Introducing myself and my research

*Presented at Eindhoven University of Technology on December 17, 2015*

Short presentation introducing myself and my research subject.

*Presented at the networks day, Natural History Museum in Rotterdam on October 30, 2015*

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.

Supervisor: Bart M.P. Jansen

*Presented at Eindhoven University of Technology on July 21, 2015*

Get slides as [pdf].