Astrid Pieterse

Available identifiers

zbMath Open pieterse.astridMaRDI QIDQ786032

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6065467	2023-11-14	Paper
Elimination distances, blocking sets, and kernels for Vertex Cover	2023-02-07	Paper
Approximate Turing Kernelization for Problems Parameterized by Treewidth	2023-02-07	Paper
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover	2022-08-31	Paper
Parameterized Complexity of Conflict-Free Graph Coloring	2021-09-17	Paper
The subset sum game revisited	2021-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q5009477	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	2020-09-17	Paper
Best-case and worst-case sparsifiability of Boolean CSPs	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	2020-01-16	Paper
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials	2019-12-16	Paper
Optimal data reduction for graph coloring using low-degree polynomials	2019-09-10	Paper
The subset sum game revisited	2018-10-25	Paper
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials	2018-03-21	Paper
Sparsification upper and lower bounds for graph problems and not-all-equal SAT	2017-10-10	Paper
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT	2017-09-29	Paper

Research outcomes over time

This page was built for person: Astrid Pieterse