
Escaping an Infinitude of Lions
We consider the following game played in the Euclidean plane: There is a...
read it

Fullydynamic Planarity Testing in Polylogarithmic Time
Given a dynamic graph subject to insertions and deletions of edges, a na...
read it

WorstCase Polylog Incremental SPQRtrees: Embeddings, Planarity, and Triconnectivity
We show that every labelled planar graph G can be assigned a canonical e...
read it

Random kout subgraph leaves only O(n/k) intercomponent edges
Each vertex of an arbitrary simple graph on n vertices chooses k random ...
read it

Good rdivisions Imply Optimal Amortised Decremental Biconnectivity
We present a data structure that given a graph G of n vertices and m edg...
read it

Decremental SPQRtrees for Planar Graphs
We present a decremental data structure for maintaining the SPQRtree of...
read it

OneWay Trail Orientations
Given a graph, does there exist an orientation of the edges such that th...
read it
Jacob Holm
is this you? claim profile