Astrid Pieterse

According to our database, Astrid Pieterse authored at least 14 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Kernelization for list <i>H</i>-coloring for graphs with small vertex cover.

Marta Piecyk, Astrid Pieterse, Pawel Rzazewski, Magnus Wahlström

CoRR, July, 2025

2023

Sparsification Lower Bounds for List <i>H</i>-Coloring.

Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski

ACM Trans. Comput. Theory, 2023

2020

Elimination Distances, Blocking Sets, and Kernels for Vertex Cover.

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

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Sparsification Lower Bounds for List H-Coloring.

Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Approximate Turing Kernelization for Problems Parameterized by Treewidth.

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

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Parameterized Complexity of Conflict-Free Graph Coloring.

Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.

Hubie Chen, Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

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

Bart M. P. Jansen, Astrid Pieterse

Algorithmica, 2017

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

The Subset Sum Game Revisited.

Astrid Pieterse, Gerhard J. Woeginger

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Mosaic Drawings and Cartograms.

Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann

Comput. Graph. Forum, 2015

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

Bart M. P. Jansen, Astrid Pieterse

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015