arXiv 2016-11-09 EN Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time Wulff-Nilsen, Christian
arXiv 2015-02-13 EN Near-optimal adjacency labeling scheme for power-law graphs Petersen, Casper · Rotbart, Noy · Simonsen, Jakob Grue · Wulff-Nilsen, Christian
arXiv 2014-07-25 EN Faster Fully-Dynamic Minimum Spanning Forest Holm, Jacob · Rotenberg, Eva · Wulff-Nilsen, Christian
arXiv 2014-07-25 EN Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles Wulff-Nilsen, Christian
arXiv 2013-04-17 EN DELTACON: A Principled Massive-Graph Similarity Function Koutra, Danai · Vogelstein, Joshua T. · Faloutsos, Christos
arXiv 2010-01-06 EN Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph Baswana, Neelesh Khanna Surender
arXiv 2007-04-09 EN Fast paths in large-scale dynamic road networks Nannicini, Giacomo · Baptiste, Philippe · Barbier, Gilles · Krob, Daniel +1
