Mikkel Abrahamsen

activity

20152023

\exists R

-complete

11 citations · 60 across the 20 of their papers we have counts for

collaborators

Showing 2019Show all

4 papers · 1 filter

cs.CC2019★ 6 cited

Dynamic Toolbox for ETRINV

Mikkel Abrahamsen, Tillmann Miltzow

Recently, various natural algorithmic problems have been shown to be $\exists R$ -complete. The reduction relied in many cases on the $\exists R$ -completeness of t…

cs.CG2019

Disks in Curves of Bounded Convex Curvature

Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup

We say that a simple, closed curve $γ$ in the plane has bounded convex curvature if for every point $x$ on $γ$ , there is an open unit disk $U_{x}$ and $ε_{x} > 0$ such that $x\…

cs.CG2019★ 4 cited

Geometric Multicut

Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler +1

We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" $F$ , i.e., a union of curves of minimum total length, that…

cs.CG2019

Classifying Convex Bodies by their Contact and Intersection Graphs

Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen +1

Suppose that $A$ is a convex body in the plane and that $A_{1}, \dots, A_{n}$ are translates of $A$ . Such translates give rise to an intersection graph of $A$ , $G = (V, E)$ , with vertices $…