| Mosaic drawings and cartograms RG Cano, K Buchin, T Castermans, A Pieterse, W Sonke, B Speckmann Computer Graphics Forum 34 (3), 361-370, 2015 | 48 | 2015 |
| Sparsification upper and lower bounds for graph problems and Not-All-Equal SAT BMP Jansen, A Pieterse Algorithmica 79 (1), 3-28, 2017 | 22 | 2017 |
| Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT BMP Jansen, A Pieterse 10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015 | 22 | 2015 |
| Optimal sparsification for some binary CSPs using low-degree polynomials BMP Jansen, A Pieterse ACM Transactions on Computation Theory (TOCT) 11 (4), 1-26, 2019 | 21 | 2019 |
| Elimination distances, blocking sets, and kernels for vertex cover EMC Hols, S Kratsch, A Pieterse SIAM Journal on Discrete Mathematics 36 (3), 1955-1990, 2022 | 18 | 2022 |
| Polynomial kernels for hitting forbidden minors under structural parameterizations BMP Jansen, A Pieterse Theoretical Computer Science 841, 124-166, 2020 | 17 | 2020 |
| Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials BMP Jansen, A Pieterse | 16 | 2017 |
| Parameterized complexity of conflict-free graph coloring HL Bodlaender, S Kolay, A Pieterse Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 11 | 2019 |
| Best-case and worst-case sparsifiability of Boolean CSPs H Chen, BMP Jansen, A Pieterse arXiv preprint arXiv:1809.06171, 2018 | 11 | 2018 |
| Sparsification Lower Bounds for List H-Coloring H Chen, BMP Jansen, K Okrasa, A Pieterse, P Rzążewski ACM Transactions on Computation Theory 15 (3-4), 1-23, 2023 | 7 | 2023 |
| Best-case and worst-case sparsifiability of Boolean CSPs H Chen, BMP Jansen, A Pieterse Algorithmica 82 (8), 2200-2242, 2020 | 7 | 2020 |
| Parameterized complexity of conflict-free graph coloring HL Bodlaender, S Kolay, A Pieterse SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021 | 4 | 2021 |
| Approximate Turing Kernelization for Problems Parameterized by Treewidth EMC Hols, S Kratsch, A Pieterse arXiv preprint arXiv:2004.12683, 2020 | 2 | 2020 |
| Tight parameterized preprocessing bounds: sparsification via low-degree polynomials A Pieterse | 2 | 2019 |
| The subset sum game revisited A Pieterse, GJ Woeginger Theory of Computing Systems 65 (5), 884-900, 2021 | | 2021 |
| Elimination distances, blocking sets, and kernels for Vertex Cover EMC Hols, S Kratsch, A Pieterse arXiv preprint arXiv:1905.03631, 2019 | | 2019 |
| The subset sum game revisited A Pieterse, GJ Woeginger International Conference on Algorithmic Decision Theory, 228-240, 2017 | | 2017 |
| Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT A Pieterse | | 2015 |
| Een moeilijke instantie voor Farthest Insertion A Pieterse Technische Universiteit Eindhoven, 2013 | | 2013 |
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerifisert e-postadresse på tue.nl
