Jacob Evald

According to our database, Jacob Evald authored at least 4 papers between 2016 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs.

Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary.

Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Decremental APSP in Directed Graphs Versus an Adaptive Adversary.

Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

CoRR, 2020

2016

Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs.

Jacob Evald, Søren Dahlgaard

CoRR, 2016