Conference presentations

The Subset Sum Game Revisited

Astrid Pieterse and Gerhard J. Woeginger.
Presented at ADT 2017, Luxembourg (Luxembourg)

Get slides as [pptx] (recommended) or as [pdf].

IPEC 2017 slide

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].

Sparsification for CSPs title slide

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 bounds title slide

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

Other

Kernelization for graph coloring title slide

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].

Kernelization title slide

2nd Networks Interactive PhD colloquium

Introduction to Kernelization
Presented at the Networks PhD colloquium in Amsterdam on October 21, 2017

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

cat

Department dialogue: personal talk

Introducing myself and my research
Presented at Eindhoven University of Technology on December 17, 2015

Networks day title slide

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

Get slides as [pdf]; [pptx].

Master thesis image (graph for 4-coloring)

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].