We stand with Ukraine  

Astrid Pieterse

Orcid: 0000-0003-3721-6721

Affiliations:
  • Humboldt University of Berlin, Germany
  • Eindhoven University of Technology, The Netherlands (former)


According to our database1, Astrid Pieterse authored at least 13 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Sparsification Lower Bounds for List <i>H</i>-Coloring.
[BibTeX]
[DOI]
Hubie Chen
,
Bart M. P. Jansen
,
Karolina Okrasa
,
Astrid Pieterse
,
Pawel Rzazewski
ACM Trans. Comput. Theory, 2023

2022
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover.
[BibTeX]
[DOI]
Eva-Maria C. Hols
,
Stefan Kratsch
,
Astrid Pieterse
SIAM J. Discret. Math., September, 2022

2021
Parameterized Complexity of Conflict-Free Graph Coloring.
[BibTeX]
[DOI]
Hans L. Bodlaender
,
Sudeshna Kolay
,
Astrid Pieterse
SIAM J. Discret. Math., 2021

The subset sum game revisited.
[BibTeX]
[DOI]
Astrid Pieterse
,
Gerhard J. Woeginger
Theory Comput. Syst., 2021

2020
Polynomial kernels for hitting forbidden minors under structural parameterizations.
[BibTeX]
[DOI]
Bart M. P. Jansen
,
Astrid Pieterse
Theor. Comput. Sci., 2020

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.
[BibTeX]
[DOI]
Hubie Chen
,
Bart M. P. Jansen
,
Astrid Pieterse
Algorithmica, 2020

Sparsification Lower Bounds for List H-Coloring.
[BibTeX]
[DOI]
Hubie Chen
,
Bart M. P. Jansen
,
Karolina Okrasa
,
Astrid Pieterse
,
Pawel Rzazewski
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Approximate Turing Kernelization for Problems Parameterized by Treewidth.
[BibTeX]
[DOI]
Eva-Maria C. Hols
,
Stefan Kratsch
,
Astrid Pieterse
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.
[BibTeX]
[DOI]
Bart M. P. Jansen
,
Astrid Pieterse
ACM Trans. Comput. Theory, 2019

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials.
[BibTeX]
[DOI]
Bart M. P. Jansen
,
Astrid Pieterse
Algorithmica, 2019

2017
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT.
[BibTeX]
[DOI]
Bart M. P. Jansen
,
Astrid Pieterse
Algorithmica, 2017

2015
Mosaic Drawings and Cartograms.
[BibTeX]
[DOI]
Rafael G. Cano
,
Kevin Buchin
,
Thom Castermans
,
Astrid Pieterse
,
Willem Sonke
,
Bettina Speckmann
Comput. Graph. Forum, 2015

Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT.
[BibTeX]
[DOI]
Bart M. P. Jansen
,
Astrid Pieterse
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015


  Loading...