Conference presentations
Approximate Turing Kernels for Problems Parameterized by Treewidth
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.
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse.
Presented at STACS 2020, Montpellier (France)
Parameterized Complexity of Conflict-free Graph Coloring
Hans L. Bodlaender, Sudeshna Kolay and Astrid Pieterse.
Presented at WADS 2019, Edmonton (Alberta, Canada)
Get slides as [pptx].
The Subset Sum Game Revisited
Astrid Pieterse and Gerhard J. Woeginger.
Presented at ADT 2017, Luxembourg (Luxembourg)
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
Bart M.P. Jansen and Astrid Pieterse.
Presented at IPEC 2017, Vienna (Austria)
Get slides as [pdf].
Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials
Bart M.P. Jansen and Astrid Pieterse.
Presented at MFCS 2016, Krakow (Poland)
Get slides as [pdf].
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
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.
Posters
Other
Seminar talk
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.
Thesis defense
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].
Workshop on Kernelization
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.
NWO-JSPS Seminar: Computations on Networks with a Tree-Structure: From Theory to Practice
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].
TACO day 2018
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].
Seminar talk
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).
5th Networks training week
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].
2nd Networks Interactive PhD colloquium
Introduction to Kernelization
Presented at the Networks PhD colloquium in Amsterdam on October 21, 2016
Get slides as [pdf]; [LaTeX] (zip).
Department dialogue: personal talk
Introducing myself and my research
Presented at Eindhoven University of Technology on December 17, 2015
4th Networks day
Short presentation introducing myself and my research subject.
Presented at the networks day, Natural History Museum in Rotterdam on October 30, 2015
Master thesis presentation
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].