20 citations · 134 across the 54 of their papers we have counts for
10 papers · 1 filter
The Complexity of Data-Driven Norm Synthesis and Revision
Davide Dell'Anna, Natasha Alechina, Brian Logan +3
Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should foll…
Rectangular Spiral Galaxies are Still Hard
Erik D. Demaine, Maarten Löffler, Christiane Schmidt
Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that ea…
Embedding Ray Intersection Graphs and Global Curve Simplification
Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embe…
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
Kevin Buchin, Maarten Löffler, Tim Ophelders +3
We consider the problem of computing the Fréchet distance between two curves for which the exact locations of the vertices are unknown. Each vertex may be placed in a given uncerta…
Hard Diagrams of the Unknot
Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler +5
We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in…
Uncertain Curve Simplification
Kevin Buchin, Maarten Löffler, Aleksandr Popov +1
We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contai…