In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a
hierarchical organization of clusters in a dataset wrt a parameter mpts. While a small change …

HDBSCAN*, a state-of-the-art density-based hierarchical clustering method, produces a
hierarchical organization of clusters in a dataset wrt a parameter mpts. While the …

We study the historical connectivity query in temporal graphs where edges continuously
arrive. Given an arbitrary time window, and two query vertices, the problem aims to identify if …

The persistent scatterer interferometry (PSI) is a powerful remote sensing technique to
monitor displacements of the Earth's surface. It is based on identifying and analyzing phase …

In the minimum spanning tree (MST) interdiction problem, we are given a graph $ G=(V, E) $
with edge weights, and want to find some $ X\subseteq E $ satisfying a knapsack constraint …

This paper presents a network-based template for analyzing large-scale dynamic data.
Specifically, we propose a novel shared-memory parallel algorithm for updating tree-based …

As systems evolve, analysis results based on models of the system must be updated, in
many cases as fast as possible. Since usually only small parts of the model change, large …

We consider the challenge of implementing the link‐cut tree data structure. This data
structure is well known and has had a wide impact on several theoretical results. However …