In recent years, significant advances have been made in the design and
e...
Customizable contraction hierarchies are one of the most popular route
p...
We study the problem of computing constrained shortest paths for battery...
We study the problem of servicing a set of ride requests by dispatching ...
Stabbing queries in sets of intervals are usually answered using segment...
Quasi-threshold graphs are {C_4, P_4}-free graphs, i.e., they do not
con...
The balanced hypergraph partitioning problem is to partition a hypergrap...
We study the problem of computing shortest paths in massive road network...
We study the problem of minimizing overall trip time for battery electri...
Weight-balanced trees are a popular form of self-balancing binary search...
We study the problem of computing public transit traffic assignments in ...
In a wind farm turbines convert wind energy into electrical energy. The
...
In this paper, we propose HyperFlowCutter, an algorithm for balanced
hyp...
Graph partitioning has many applications. We consider the acceleration o...
We study a multi-modal route planning scenario consisting of a public tr...
Graph randomisation is an important task in the analysis and synthesis o...
We study large-scale, distributed graph clustering. Given an undirected,...
We consider the problem of quickly computing shortest paths in weighted
...