See also my DBLP page.

Conference publications

The Subset Sum Game Revisited

Astrid Pieterse and Gerhard J. Woeginger.
Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT 2017), October 25-27, 2017, Luxembourg, pages 228-240, 2017

[doi]; [BibTeX].

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

Bart M.P. Jansen and Astrid Pieterse.
Accepted to the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), September 4-8, 2017, Vienna. To appear.
Received the excellent student paper award at IPEC 2017. A paper is eligible for the Excellent student paper award if at least one co-author is a student, and at most one co-author is not a student. If there is a non-student author, the students’ contributions must be substantial, and a student must give the presentation at the conference.

Download [pdf].

Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials

Bart M.P. Jansen and Astrid Pieterse.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), August 22-26, 2016, Krakow, Poland, pages 71:1-71:14, 2016.
Received the best paper award at MFCS 2016.

[doi]; [BibTeX]; Full version on [arXiv].

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

Bart M.P. Jansen and Astrid Pieterse.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), September 16-18, 2015, Patras, Greece, pages 163-174, 2015.

[doi]; [BibTeX]; Full version on [arXiv].

Journal articles

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

Bart M.P. Jansen and Astrid Pieterse.
Algorithmica 79(1) 3-28, September 2017.

[doi] (Open access); [BibTeX].

Mosaic Drawings and Cartograms

R.G. Cano, K. Buchin, T.H.A. Castermans, A. Pieterse, W.M. Sonke, and B. Speckmann.
Computer Graphics Forum 34(3) 361-370, June 2015.

[doi]; [BibTeX].

Master thesis

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

Astrid Pieterse, supervisor: Bart M.P. Jansen, August 2015.

[pdf] from the TU/e website.

Other

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (summary)

Astrid Pieterse. The Parameterized Complexity Newsletter volume 13 no 3, October 2017.

This article is a summary of the main algorithmic idea in the IPEC 2017 Best Student Paper Award paper by Bart M. P. Jansen and Astrid Pieterse

Download [pdf], or see the FPT news webpage.