252 citations · 370 across the 32 of their papers we have counts for
7 papers · 1 filter
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…
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements
Serge Gaspers, Joachim Gudmundsson, Julián Mestre +1
Given a line segment , the so-called barrier, and a set of sensors with varying ranges positioned on the line containing , the barrier coverage problem is to move t…
Compact Flow Diagrams for State Sequences
Kevin Buchin, Maike Buchin, Joachim Gudmundsson +2
We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representatio…
Finding Pairwise Intersections Inside a Query Range
Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-a…
Augmenting graphs to minimize the diameter
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson +1
We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-appro…
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
Patrizio Angelini, William Evans, Fabrizio Frati +1
We show that every -vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any -vertex planar graph. In order to achieve this resul…