11 citations · 60 across the 20 of their papers we have counts for
3 papers · 1 filter
Escaping an Infinitude of Lions
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg +1
We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed for some value…
Tiling with Squares and Packing Dominos in Polynomial Time
Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle +1
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems…
Framework for -Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be h…