6 citations · 6 across the 9 of their papers we have counts for
3 papers · 1 filter
Local Density and its Distributed Approximation
Aleksander Bjørn Christiansen, Ivor van der Hoog, Eva Rotenberg
The densest subgraph problem is a classic problem in combinatorial optimisation. Danisch, Chan, and Sozio propose a definition for \emph{local density} that assigns to each vertex…
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs
Ivor van der Hoog, Irene Parada, Eva Rotenberg
A directed graph is upward planar if it admits a planar embedding such that each edge is -monotone. Unlike planarity testing, upward planarity testing is NP-hard except in r…
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity
Jacob Holm, Ivor van der Hoog, Eva Rotenberg
We study dynamic planar graphs with vertices, subject to edge deletion, edge contraction, edge insertion across a face, and the splitting of a vertex in specified corners. We d…