| Parameterized problems complete for nondeterministic FPT time and logarithmic space HL Bodlaender, C Groenland, J Nederlof, CMF Swennenhuis 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 25 | 2022 |
| Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space J Nederlof, M Pilipczuk, CMF Swennenhuis, K Węgrzycki SIAM Journal on Discrete Mathematics 37 (3), 1566-1586, 2023 | 17 | 2023 |
| Parameterized complexities of dominating and independent set reconfiguration HL Bodlaender, C Groenland, CMF Swennenhuis arXiv preprint arXiv:2106.15907, 2021 | 10 | 2021 |
| Parallel machine scheduling with a single resource per job T Janssen, C Swennenhuis, A Bitar, T Bosman, D Gijswijt, L van Iersel, ... arXiv preprint arXiv:1809.05009, 2018 | 7 | 2018 |
| A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics J Nederlof, J Pawlewicz, CMF Swennenhuis, K Węgrzycki SIAM Journal on Computing 52 (6), 1369-1412, 2023 | 6 | 2023 |
| Isolation schemes for problems on decomposable graphs J Nederlof, M Pilipczuk, CMF Swennenhuis, K Węgrzycki arXiv preprint arXiv:2105.01465, 2021 | 5 | 2021 |
| On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan J Nederlof, CMF Swennenhuis Algorithmica 84 (8), 2309-2334, 2022 | 4 | 2022 |
| On the parameterized complexity of the connected flow and many visits TSP problem I Mannens, J Nederlof, C Swennenhuis, K Szilágyi Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021 | 3 | 2021 |
| Makespan Scheduling of Unit Jobs with Precedence Constraints in time J Nederlof, CMF Swennenhuis, K Węgrzycki arXiv preprint arXiv:2208.02664, 2022 | 2 | 2022 |
| Isolation schemes for problems on decomposable graphs. CoRR, abs/2105.01465 J Nederlof, M Pilipczuk, CMF Swennenhuis, K Wegrzycki arXiv preprint arXiv:2105.01465, 2021 | 2 | 2021 |
| A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints J Nederlof, CMF Swennenhuis, K Węgrzycki arXiv preprint arXiv:2312.03495, 2023 | 1 | 2023 |
| Parameterized complexity of partial scheduling J Nederlof, C Swennenhuis arXiv preprint arXiv:1912.03185, 2019 | 1 | 2019 |
| Parallel Machine Scheduling: with Partition Constraints C Swennenhuis | 1 | 2018 |
| Scheduling jobs that change over time C Swennenhuis, FCR Spieksma, RA Pendavingh, R Lambers | | 2023 |
| Scheduling jobs that change over time R Lambers, R Pendavingh, F Spieksma, CMF Swennenhuis arXiv preprint arXiv:2312.09683, 2023 | | 2023 |
| Fine-Grained Parameterized Complexity of Scheduling and Sequencing Problems CMF Swennenhuis | | 2022 |
| Check for updates I Mannens¹, J Nederlof¹, C Swennenhuis, K Szilágyi¹ Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021 | | 2021 |
| A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics J Pawlewicz, K Węgrzycki, C Swennenhuis, J Nederlof | | 2021 |
| Space-filling Curves Heuristics for the 4D Travelling Salesman Problem in Chip Manufacturing Machines CMF Swennenhuis | | 2016 |
