Astrid Pieterse

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Sparsification lower bounds for list \(H\)-coloring (available as arXiv preprint)	2023-11-14	Paper
Elimination distances, blocking sets, and kernels for Vertex Cover (available as arXiv preprint)	2023-02-07	Paper
Approximate Turing Kernelization for Problems Parameterized by Treewidth (available as arXiv preprint)	2023-02-07	Paper
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover SIAM Journal on Discrete Mathematics	2022-08-31	Paper
Parameterized Complexity of Conflict-Free Graph Coloring SIAM Journal on Discrete Mathematics	2021-09-17	Paper
The subset sum game revisited Theory of Computing Systems	2021-08-05	Paper
Best-case and worst-case sparsifiability of Boolean CSPs (available as arXiv preprint)	2021-08-04	Paper
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.	2021-08-04	Paper
Polynomial kernels for hitting forbidden minors under structural parameterizations Theoretical Computer Science	2020-09-17	Paper
Polynomial kernels for hitting forbidden minors under structural parameterizations Theoretical Computer Science	2020-09-17	Paper
Best-case and worst-case sparsifiability of Boolean CSPs Algorithmica	2020-08-12	Paper
Optimal data reduction for graph coloring using low-degree polynomials	2020-05-27	Paper
Parameterized complexity of conflict-free graph coloring (available as arXiv preprint)	2020-01-16	Paper
Optimal sparsification for some binary CSPs using low-degree polynomials ACM Transactions on Computation Theory	2019-12-16	Paper
Optimal data reduction for graph coloring using low-degree polynomials Algorithmica	2019-09-10	Paper
The subset sum game revisited Algorithmic Decision Theory	2018-10-25	Paper
Optimal sparsification for some binary CSPs using low-degree polynomials (available as arXiv preprint)	2018-03-21	Paper
Sparsification upper and lower bounds for graph problems and not-all-equal SAT Algorithmica	2017-10-10	Paper
Sparsification upper and lower bounds for graphs problems and not-all-equal SAT (available as arXiv preprint)	2017-09-29	Paper

Research outcomes over time

This page was built for person: Astrid Pieterse