research
∙
03/31/2020
Engineering Exact Quasi-Threshold Editing
Quasi-threshold graphs are {C_4, P_4}-free graphs, i.e., they do not con...
share
research
∙
10/28/2019
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks
We study the problem of computing shortest paths in massive road network...
research
∙
10/28/2019
A* with Perfect Potentials
Quickly determining shortest paths in networks is an important ingredien...
research
∙
10/26/2017
Simple Distributed Graph Clustering using Modularity and Map Equation
We study large-scale, distributed graph clustering. Given an undirected,...
research
∙
02/03/2014
