Astrid Pieterse

31 papers A 3B 6Journal 21Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximate Turing kernelization for problems parameterized by treewidth. J. Comput. Syst. Sci. Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2025	J	`jnl`	Kernelization for list CoRR Marta Piecyk, Astrid Pieterse, Pawel Rzazewski, Magnus Wahlström
2023	J	`jnl`	Sparsification Lower Bounds for List ACM Trans. Comput. Theory Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2022	J	`jnl`	Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. SIAM J. Discret. Math. Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2021	J	`jnl`	Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2021	J	`jnl`	The subset sum game revisited. Theory Comput. Syst. Astrid Pieterse, Gerhard J. Woeginger
2020	A	`conf`	Approximate Turing Kernelization for Problems Parameterized by Treewidth. ESA Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2020	J	`jnl`	Approximate Turing Kernelization for Problems Parameterized by Treewidth. CoRR Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2020	J	`jnl`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2020	A	`conf`	Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. STACS Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2020	J	`jnl`	Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. Bart M. P. Jansen, Astrid Pieterse
2020	B	`conf`	Sparsification Lower Bounds for List H-Coloring. ISAAC Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	Sparsification Lower Bounds for List H-Coloring. CoRR Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2019	J	`jnl`	Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. CoRR Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse
2019	J	`jnl`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica Bart M. P. Jansen, Astrid Pieterse
2019	J	`jnl`	Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory Bart M. P. Jansen, Astrid Pieterse
2019	B	`conf`	Parameterized Complexity of Conflict-Free Graph Coloring. WADS Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2019	J	`jnl`	Parameterized Complexity of Conflict-free Graph Coloring. CoRR Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2018	B	`conf`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR Bart M. P. Jansen, Astrid Pieterse
2018	A	`conf`	Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR Bart M. P. Jansen, Astrid Pieterse
2017	B	`conf`	Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC Bart M. P. Jansen, Astrid Pieterse
2017	J	`jnl`	Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica Bart M. P. Jansen, Astrid Pieterse
2017	—	`conf`	The Subset Sum Game Revisited. ADT Astrid Pieterse, Gerhard J. Woeginger
2016	B	`conf`	Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS Bart M. P. Jansen, Astrid Pieterse
2016	J	`jnl`	Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials. CoRR Bart M. P. Jansen, Astrid Pieterse
2015	J	`jnl`	Mosaic Drawings and Cartograms. Comput. Graph. Forum Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann
2015	J	`jnl`	Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. CoRR Bart M. P. Jansen, Astrid Pieterse
2015	B	`conf`	Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC Bart M. P. Jansen, Astrid Pieterse