1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CG2026
Covering and Partitioning Complex Objects with Small Pieces
Anders Aamand, Mikkel Abrahamsen, Reilly Browne +6
We study the problems of covering or partitioning a polygon (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contain…
cs.DS2017★ 1 cited
One-Way Trail Orientations
Anders Aamand, Niklas Hjuler, Jacob Holm +1
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states…