activity
20092025
most citedBarrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements

3 citations · 11 across the 15 of their papers we have counts for

collaborators
Showing cs.CGShow all

27 papers · 1 filter

cs.CG2025

Theoretical analysis of beaconless geocast protocols in 1D

Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler +3

Beaconless geocast protocols are routing protocols used to send messages in mobile ad-hoc wireless networks, in which the only information available to each node is its own locatio…

cs.CG2023

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…

cs.CG2023

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…

cs.CG2022

Approximating the lambda-low-density value

Joachim Gudmundsson, Zijin Huang, Sampson Wong

The use of realistic input models has gained popularity in the theory community. Assuming a realistic input model often precludes complicated hypothetical inputs, and the analysis…

cs.CG2022★ 3 cited

Map matching queries on realistic input graphs under the Fréchet distance

Joachim Gudmundsson, Martin P. Seybold, Sampson Wong

Map matching is a common preprocessing step for analysing vehicle trajectories. In the theory community, the most popular approach for map matching is to compute a path on the road…

cs.CG2022

The Mutual Visibility Problem 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 fundamental problem of providing mutual visibility to them: the robots must reposition themselves…