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
152016
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
112021
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
52020
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs
J Evald, V Fredslund-Hansen, C Wulff-Nilsen
arXiv preprint arXiv:2110.00074, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–4