research
∙
08/15/2022
Degree of Convexity and Expected Distances in Polygons
We present an algorithm for computing the so-called Beer-index of a poly...
share
research
∙
09/30/2021
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs
Given an undirected n-vertex planar graph G=(V,E,ω) with non-negative ed...
research
∙
10/02/2020
Decremental APSP in Directed Graphs Versus an Adaptive Adversary
Given a directed graph G = (V,E), undergoing an online sequence of edge ...
research
∙
09/30/2020
