Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs. - Jacob Evald; Søren Dahlgaard (CoRR, 2016)

Decremental APSP in Directed Graphs Versus an Adaptive Adversary. - Jacob Evald; Viktor Fredslund-Hansen; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (CoRR, 2020)

Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. - Jacob Evald; Viktor Fredslund-Hansen; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (ICALP, 2021)

Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. - Jacob Evald; Viktor Fredslund-Hansen; Christian Wulff-Nilsen (ISAAC, 2021)