Astrid Pieterse
Astrid Pieterse
Verified email at informatik.hu-berlin.de - Homepage
Title
Cited by
Cited by
Year
Mosaic drawings and cartograms
RG Cano, K Buchin, T Castermans, A Pieterse, W Sonke, B Speckmann
Computer Graphics Forum 34 (3), 361-370, 2015
292015
Sparsification upper and lower bounds for graph problems and Not-All-Equal SAT
BMP Jansen, A Pieterse
Algorithmica 79 (1), 3-28, 2017
172017
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
BMP Jansen, A Pieterse
10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015
172015
Optimal sparsification for some binary CSPs using low-degree polynomials
BMP Jansen, A Pieterse
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-26, 2019
142019
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
BMP Jansen, A Pieterse
82017
Polynomial kernels for hitting forbidden minors under structural parameterizations
BMP Jansen, A Pieterse
Theoretical Computer Science, 2020
72020
Best-case and worst-case sparsifiability of Boolean CSPs
H Chen, BMP Jansen, A Pieterse
Algorithmica, 1-43, 2020
72020
Parameterized complexity of conflict-free graph coloring
HL Bodlaender, S Kolay, A Pieterse
Workshop on Algorithms and Data Structures, 168-180, 2019
52019
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
EMC Hols, S Kratsch, A Pieterse
arXiv preprint arXiv:1905.03631, 2019
32019
Approximate Turing Kernelization for Problems Parameterized by Treewidth
EMC Hols, S Kratsch, A Pieterse
arXiv preprint arXiv:2004.12683, 2020
12020
Sparsification Lower Bounds for List -Coloring
H Chen, BMP Jansen, K Okrasa, A Pieterse, P Rzążewski
arXiv preprint arXiv:2009.08353, 2020
2020
Tight parameterized preprocessing bounds: sparsification via low-degree polynomials
A Pieterse
2019
The Subset Sum Game Revisited
A Pieterse, GJ Woeginger
International Conference on Algorithmic DecisionTheory, 228-240, 2017
2017
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
A Pieterse
2015
Een moeilijke instantie voor Farthest Insertion
A Pieterse
Technische Universiteit Eindhoven, 2013
2013
The system can't perform the operation now. Try again later.
Articles 1–15