Céline M. F. Swennenhuis

activity

20182024

most citedA Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

3 citations · 7 across the 10 of their papers we have counts for

collaborators

Showing 2020 · cs.DSShow all

2 papers · 2 filters

cs.DS2020★ 3 cited

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis +1

In the Bin Packing problem one is given $n$ items with weights $w_{1}, \dots, w_{n}$ and $m$ bins with capacities $c_{1}, \dots, c_{m}$ . The goal is to find a partition of the items into set…

cs.DS2020

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis +1

For many algorithmic problems on graphs of treewidth $t$ , a standard dynamic programming approach gives an algorithm with time and space complexity $2^{\mathcal{O}(t)}\cdot n^{\mat…