12 citations · 48 across the 27 of their papers we have counts for
6 papers · 1 filter
Designing Problem Sessions for Algorithmic Subjects to Boost Student Confidence
André van Renssen
In this paper, we describe how we changed the structure of problem sessions in an algorithmic subject, in order to improve student confidence. The subject in question is taught to…
Shortest Paths of Mutually Visible Robots
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of point robots inside a simple polygon , the task is to move the robots from their starting positions to their target positions along their shortest paths, whil…
Pattern Formation for Fat Robots with Memory
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of autonomous, anonymous, indistinguishable, silent, and possibly disoriented mobile unit disk (i.e., fat) robots operating following Look-Compute-Move cycles…
Computing a Subtrajectory Cluster from c-packed Trajectories
Joachim Gudmundsson, Zijin Huang, André van Renssen +1
We present a near-linear time approximation algorithm for the subtrajectory cluster problem of -packed trajectories. The problem involves finding subtrajectories within a gi…
Oriented Spanners
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb +4
Given a point set in the Euclidean plane and a parameter , we define an \emph{oriented -spanner} as an oriented subgraph of the complete bi-directed graph such that f…
Pattern Formation for Fat Robots with Lights
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of unit disk robots in the Euclidean plane, we consider the Pattern Formation problem, i.e., the robots must reposition themselves to form a given target patt…