default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAstrid Pieterse
Person information
- affiliation: Humboldt University of Berlin, Germany
- affiliation (former): Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa
, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ACM Trans. Comput. Theory 15(3-4): 8:1-8:23 (2023)- 2022
- [j9]Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. SIAM J. Discret. Math. 36(3): 1955-1990 (2022) - 2021
- [j8]Astrid Pieterse, Gerhard J. Woeginger:
The subset sum game revisited. Theory Comput. Syst. 65(5): 884-900 (2021) - [j7]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35(3): 2003-2038 (2021) - 2020
- [j6]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82(8): 2200-2242 (2020) - [j5]Bart M. P. Jansen, Astrid Pieterse:
Polynomial kernels for hitting forbidden minors under structural parameterizations. Theor. Comput. Sci. 841: 124-166 (2020) - [c10]Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Approximate Turing Kernelization for Problems Parameterized by Treewidth. ESA 2020: 60:1-60:23 - [c9]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - [c8]Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. STACS 2020: 36:1-36:14 - [i9]Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Approximate Turing Kernelization for Problems Parameterized by Treewidth. CoRR abs/2004.12683 (2020) - [i8]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. CoRR abs/2009.08353 (2020)
2010 – 2019
- 2019
- [j4]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Algorithmica 81(10): 3865-3889 (2019) - [j3]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory 11(4): 28:1-28:26 (2019) - [c7]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. WADS 2019: 168-180 - [i7]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-free Graph Coloring. CoRR abs/1905.00305 (2019) - [i6]Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. CoRR abs/1905.03631 (2019) - 2018
- [c6]Bart M. P. Jansen, Astrid Pieterse:
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ESA 2018: 48:1-48:15 - [c5]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC 2018: 15:1-15:13 - [i5]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. CoRR abs/1802.02050 (2018) - [i4]Bart M. P. Jansen, Astrid Pieterse:
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. CoRR abs/1804.08885 (2018) - [i3]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR abs/1809.06171 (2018) - 2017
- [j2]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. Algorithmica 79(1): 3-28 (2017) - [c4]Astrid Pieterse, Gerhard J. Woeginger:
The Subset Sum Game Revisited. ADT 2017: 228-240 - [c3]Bart M. P. Jansen, Astrid Pieterse:
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. IPEC 2017: 22:1-22:12 - 2016
- [c2]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. MFCS 2016: 71:1-71:14 - [i2]Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials. CoRR abs/1606.03233 (2016) - 2015
- [j1]Rafael G. Cano, Kevin Buchin, Thom Castermans, Astrid Pieterse, Willem Sonke, Bettina Speckmann:
Mosaic Drawings and Cartograms. Comput. Graph. Forum 34(3): 361-370 (2015) - [c1]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. IPEC 2015: 163-174 - [i1]Bart M. P. Jansen, Astrid Pieterse:
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT. CoRR abs/1509.07437 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
