No. |
Title |
Author |
Year |
---|

1 |
Constructing Concise Convex Covers via Clique Covers (CG Challenge) |
Abrahamsen, Mikkel et al. |
2023 |

2 |
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks |
Abrahamsen, Mikkel et al. |
2023 |

3 |
Geometric Embeddability of Complexes Is ∃ℝ-Complete |
Abrahamsen, Mikkel et al. |
2023 |

4 |
Tiling with Squares and Packing Dominos in Polynomial Time |
Aamand, Anders et al. |
2022 |

5 |
Chasing Puppies: Mobile Beacon Routing on Closed Curves |
Abrahamsen, Mikkel et al. |
2021 |

6 |
Classifying Convex Bodies by Their Contact and Intersection Graphs |
Aamand, Anders et al. |
2021 |

7 |
Online Packing to Minimize Area or Perimeter |
Abrahamsen, Mikkel et al. |
2021 |

8 |
Geometric Multicut |
Abrahamsen, Mikkel et al. |
2019 |

9 |
Best Laid Plans of Lions and Men |
Abrahamsen, Mikkel et al. |
2017 |

10 |
Irrational Guards are Sometimes Needed |
Abrahamsen, Mikkel et al. |
2017 |

11 |
Minimum Perimeter-Sum Partitions in the Plane |
Abrahamsen, Mikkel et al. |
2017 |

12 |
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs |
Abrahamsen, Mikkel et al. |
2017 |

13 |
Range-Clustering Queries |
Abrahamsen, Mikkel et al. |
2017 |

14 |
Finding the Maximum Subset with Bounded Convex Curvature |
Abrahamsen, Mikkel et al. |
2016 |

15 |
Graph Reconstruction with a Betweenness Oracle |
Abrahamsen, Mikkel et al. |
2016 |

16 |
Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace |
Abrahamsen, Mikkel et al. |
2016 |

17 |
An Optimal Algorithm for the Separating Common Tangents of Two Polygons |
Abrahamsen, Mikkel |
2015 |