Follow
Jacob Evald
Jacob Evald
Student, University of Copenhagen
Verified email at di.ku.dk
Title
Cited by
Cited by
Year
Tight hardness results for distance and centrality problems in constant degree graphs
S Dahlgaard, J Evald
arXiv preprint arXiv:1609.08403, 2016
182016
Decremental APSP in unweighted digraphs versus an adaptive adversary
J Evald, V Fredslund-Hansen, MP Gutenberg, C Wulff-Nilsen
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
132021
Decremental APSP in directed graphs versus an adaptive adversary
J Evald, V Fredslund-Hansen, MP Gutenberg, C Wulff-Nilsen
arXiv preprint arXiv:2010.00937, 2020
62020
Near-optimal distance oracles for vertex-labeled planar graphs
J Evald, V Fredslund-Hansen, C Wulff-Nilsen
32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–4