E-LIB Suche - Ergebnisse für: Pieterse, Astrid

1

Sparsification Lower Bounds for ListH-Coloring:

Chen, Hubie ; Jansen, Bart M. P. ; Okrasa, Karolina..
ACM Transactions on Computation Theory. 15 (2023) 3-4 - p. 1-23 , 2023

Link: https://doi.org/10.1145/..

2

Elimination Distances, Blocking Sets, and Kernels for Verte..:

Hols, Eva-Maria C. ; Kratsch, Stefan ; Pieterse, Astrid
SIAM Journal on Discrete Mathematics. 36 (2022) 3 - p. 1955-1990 , 2022

Link: https://doi.org/10.1137/..

3

The subset sum game revisited:

Pieterse, Astrid ; Woeginger, Gerhard J.
Theory of Computing Systems. 65 (2021) 5 - p. 884-900 , 2021

Link: https://doi.org/10.1007/..

4

Parameterized Complexity of Conflict-Free Graph Coloring:

Bodlaender, Hans L. ; Kolay, Sudeshna ; Pieterse, Astrid
SIAM Journal on Discrete Mathematics. 35 (2021) 3 - p. 2003-2038 , 2021

Link: https://doi.org/10.1137/..

5

Polynomial kernels for hitting forbidden minors under struc..:

Jansen, Bart M.P. ; Pieterse, Astrid
Theoretical Computer Science. 841 (2020) - p. 124-166 , 2020

Link: https://doi.org/10.1016/..

6

Best-Case and Worst-Case Sparsifiability of Boolean CSPs:

Chen, Hubie ; Jansen, Bart M. P. ; Pieterse, Astrid
Algorithmica. 82 (2020) 8 - p. 2200-2242 , 2020

Link: https://doi.org/10.1007/..

7

Optimal Sparsification for Some Binary CSPs Using Low-Degre..:

Jansen, Bart M. P. ; Pieterse, Astrid
ACM Transactions on Computation Theory (TOCT). 11 (2019) 4 - p. 1-26 , 2019

Link: https://dl.acm.org/doi/1..

8

Optimal Sparsification for Some Binary CSPs Using Low-Degre..:

Jansen, Bart M. P. ; Pieterse, Astrid
ACM Transactions on Computation Theory. 11 (2019) 4 - p. 1-26 , 2019

Link: https://doi.org/10.1145/..

9

Optimal Data Reduction for Graph Coloring Using Low-Degree ..:

Jansen, Bart M. P. ; Pieterse, Astrid
Algorithmica. 81 (2019) 10 - p. 3865-3889 , 2019

Link: https://doi.org/10.1007/..

10

Parameterized Complexity of Conflict-Free Graph Coloring:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Bodlaender, Hans L. ; Kolay, Sudeshna ; Pieterse, Astrid - p. 168-180 , 2019

Link: https://doi.org/10.1007/..

11

Sparsification Upper and Lower Bounds for Graph Problems an..:

Jansen, Bart M. P. ; Pieterse, Astrid
Algorithmica. 79 (2016) 1 - p. 3-28 , 2016

Link: https://doi.org/10.1007/..

12

Parameterized complexity of conflict-free graph coloring:

Bodlaender, Hans L ; Kolay, Sudeshna ; Pieterse, Astrid
https://dspace.library.uu.nl/handle/1874/413526. , 2021

Link: https://dspace.library.u..

13

The subset sum game revisited:

Pieterse, Astrid ; Woeginger, Gerhard
info:eu-repo/semantics/altIdentifier/wos/WOS:000617666800001. , 2021

Link: https://publications.rwt..

14

The subset sum game revisited:

Pieterse, Astrid ; Woeginger, Gerhard
1432-4350. , 2021

Link: http://edoc.hu-berlin.de..

15

Elimination Distances, Blocking Sets, and Kernels for Verte..:

Hols, Eva-Maria C ; Kratsch, Stefan ; Pieterse, Astrid
doi:10.4230/LIPIcs.STACS.2020.36. , 2020

Link: https://doi.org/10.4230/..