P. Sanders

Publications
Influence

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

R. Geisberger, P. Sanders, Dominik Schultes, D. Delling
Mathematics, Computer Science
WEA
30 May 2008

We present a route planning technique solely based on the concept of node contraction. Expand

Polynomial time algorithms for multicast network code construction

S. Jaggi, P. Sanders, +4 authors L. M. G. M. Tolhuizen
Mathematics, Computer Science
IEEE Transactions on Information Theory
1 June 2005

We present polynomial time algorithms for the design of maximum rate linear multicast network codes by combining techniques from linear algebra, network flows, and (de)randomization. Expand

Exact Routing in Large Road Networks Using Contraction Hierarchies

R. Geisberger, P. Sanders, Dominik Schultes, C. Vetter
Computer Science
Transp. Sci.
1 August 2012

We exploit the inherent hierarchical structure of road networks by adding shortcut edges. Expand

Simple Linear Work Suffix Array Construction

Juha Kärkkäinen, P. Sanders
Computer Science
ICALP
30 June 2003

We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutine. Expand

Route Planning in Transportation Networks

H. Bast, D. Delling, +5 authors Renato F. Werneck
Computer Science
Algorithm Engineering
20 April 2015

We survey recent advances in algorithms for route planning in transportation networks. Expand

Linear work suffix array construction

Juha Kärkkäinen, P. Sanders, S. Burkhardt
Mathematics, Computer Science
JACM
1 November 2006

Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Expand

Δ-stepping: a parallelizable shortest path algorithm

U. Meyer, P. Sanders
Computer Science, Mathematics
2003

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n.log n + log 2 n) time and O( n + m + d L.L) total average-case time, where L denotes the maximum shortest path weight from the source node s to any node reachable from s. Expand

STXXL: standard template library for XXL data sets

R. Dementiev, Lutz Kettner, P. Sanders
Computer Science
Softw. Pract. Exp.
1 May 2008

We present the software library STXXL that is an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks. Expand

Better Approximation of Betweenness Centrality

R. Geisberger, P. Sanders, Dominik Schultes
Mathematics, Computer Science
ALENEX
19 January 2008

In this paper, we propose a framework for unbiased approximation of betweenness that generalizes a previous approach by Brandes. Expand

In Transit to Constant Time Shortest-Path Queries in Road Networks

H. Bast, S. Funke, Domagoj Matijevic, P. Sanders, Dominik Schultes
Computer Science
ALENEX
6 January 2007

We develop an algorithmic approach---transit node routing---that allows us to reduce quickest-path queries in road networks to a small number of table lookups. Expand

Recommended Authors