Jesper Jansson

activity

20242026

collaborators

3 papers

math.CO2026

Burning Graph Powers and Branching Trees

Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami +1

Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned…

cs.DS2025

Multiplication of 0-1 matrices via clustering

Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas +1

We study applications of clustering (in particular, the $k$ -center clustering problem) in the design of efficient and practical algorithms for computing an approximate and the exac…

cs.CG2024

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O (lo g n)$ Deterministic Rounds on the Congested Clique

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

We study the problem of computing the Voronoi diagram of a set of $n^{2}$ points with $O (lo g n)$ -bit coordinates in the Euclidean plane in a substantially sublinear in $n$ number of…

Burning Graph Powers and Branching Trees

Multiplication of 0-1 matrices via clustering

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(logn) Deterministic Rounds on the Congested Clique

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O (lo g n)$ Deterministic Rounds on the Congested Clique