Astrid Pieterse

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 25

Top Topics

Polynomial Kernels

Parameterized Complexity

Top Venues

Publications

Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. SIAM J. Discret. Math. 36 (3) (2022)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35 (3) (2021)
Astrid Pieterse, Gerhard J. Woeginger
The subset sum game revisited. Theory Comput. Syst. 65 (5) (2021)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. ISAAC (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. CoRR (2020)
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. STACS (2020)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82 (8) (2020)
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
Approximate Turing Kernelization for Problems Parameterized by Treewidth. CoRR (2020)
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
Approximate Turing Kernelization for Problems Parameterized by Treewidth. ESA (2020)
Bart M. P. Jansen, Astrid Pieterse
Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. 841 (2020)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. WADS (2019)
Bart M. P. Jansen, Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory 11 (4) (2019)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica 81 (10) (2019)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-free Graph Coloring. CoRR (2019)
Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. CoRR (2019)
Bart M. P. Jansen, Astrid Pieterse
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR (2018)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC (2018)
Bart M. P. Jansen, Astrid Pieterse
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA (2018)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR (2018)
Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR (2018)
Astrid Pieterse, Gerhard J. Woeginger
The Subset Sum Game Revisited. ADT (2017)
Bart M. P. Jansen, Astrid Pieterse
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica 79 (1) (2017)
Bart M. P. Jansen, Astrid Pieterse
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC (2017)
Bart M. P. Jansen, Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS (2016)
Bart M. P. Jansen, Astrid Pieterse
Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials. CoRR (2016)
Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann
Mosaic Drawings and Cartograms. Comput. Graph. Forum 34 (3) (2015)
Bart M. P. Jansen, Astrid Pieterse
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC (2015)
Bart M. P. Jansen, Astrid Pieterse
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. CoRR (2015)