| Customizable Route Planning in Road Networks | 24 | 0.87 | 2017 |
| On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. | 4 | 0.37 | 2016 |
| Accelerating Local Search for the Maximum Independent Set Problem. | 6 | 0.44 | 2016 |
| Highway Dimension and Provably Efficient Shortest Path Algorithms. | 3 | 0.40 | 2016 |
| Public Transit Labeling | 9 | 0.53 | 2015 |
| Navigation made personal: inferring driving preferences from GPS traces. | 11 | 0.67 | 2015 |
| Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. | 8 | 0.48 | 2015 |
| An exact combinatorial algorithm for minimum graph bisection | 9 | 0.51 | 2015 |
| Finding Near-Optimal Independent Sets at Scale | 8 | 0.50 | 2015 |
| Robust Distance Queries on Massive Networks. | 22 | 0.84 | 2014 |
| Hub Labels: Theory and Practice | 9 | 0.54 | 2014 |
| Sketch-based Influence Maximization and Computation: Scaling up with Guarantees | 83 | 1.96 | 2014 |
| Customizing Driving Directions with GPUs. | 4 | 0.46 | 2014 |
| Timed Influence: Computation and Maximization. | 4 | 0.40 | 2014 |
| A Robust and Scalable Algorithm for the Steiner Problem in Graphs. | 9 | 0.55 | 2014 |
| Computing classic closeness centrality, at scale | 18 | 0.82 | 2014 |
| Alternative routes in road networks | 31 | 1.60 | 2013 |
| PHAST: Hardware-Accelerated Shortest Path Trees | 57 | 1.92 | 2013 |
| Faster Customization of Road Networks. | 21 | 0.77 | 2013 |
| Customizable Route Planning in Road Networks (Extended Abstract). | 1 | 0.36 | 2013 |
| Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths | 17 | 0.67 | 2013 |
| Customizable Point-of-Interest Queries in Road Networks | 6 | 0.48 | 2013 |
| Hub Label Compression. | 8 | 0.49 | 2013 |
| Round-Based Public Transit Routing (Extended Abstract). | 0 | 0.34 | 2013 |
| Computing Multimodal Journeys in Practice. | 10 | 0.75 | 2013 |
| Hierarchical hub labelings for shortest paths | 80 | 2.24 | 2012 |
| Better bounds for graph bisection | 12 | 0.67 | 2012 |
| Round-Based Public Transit Routing. | 31 | 1.46 | 2012 |
| HLDB: location-based services in databases | 26 | 0.77 | 2012 |
| Exact Combinatorial Branch-and-Bound for Graph Bisection. | 14 | 0.59 | 2012 |
| Robust Mobile Route Planning with Limited Connectivity. | 4 | 0.45 | 2012 |
| Real-world route planning | 0 | 0.34 | 2012 |
| Fast local search for the steiner problem in graphs | 5 | 0.43 | 2012 |
| Graph Partitioning with Natural Cuts | 51 | 1.84 | 2011 |
| Customizable Route Planning | 58 | 1.94 | 2011 |
| Shortest Paths In Road Networks: From Practice To Theory And Back | 0 | 0.34 | 2011 |
| Maximum flows by incremental breadth-first search | 24 | 0.88 | 2011 |
| VC-dimension and shortest path algorithms | 34 | 1.32 | 2011 |
| A hub-based labeling algorithm for shortest paths in road networks | 99 | 3.40 | 2011 |
| DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines | 15 | 0.63 | 2011 |
| Faster Batched Shortest Paths in Road Networks. | 19 | 0.87 | 2011 |
| Fast Local Search for Steiner Trees in Graphs | 9 | 0.56 | 2010 |
| Highway Dimension, Shortest Paths, and Provably Efficient Algorithms | 66 | 2.88 | 2010 |
| An Experimental Study of Minimum Mean Cycle Algorithms | 11 | 0.66 | 2009 |
| Virtual ring routing trends | 1 | 0.35 | 2009 |
| Fast local search for the maximum independent set problem | 55 | 1.63 | 2008 |
| Shortest-path feasibility algorithms: An experimental evaluation | 11 | 0.70 | 2008 |
| A fast swap-based local search procedure for location problems | 20 | 1.07 | 2007 |
| Better Landmarks Within Reach | 36 | 2.50 | 2007 |
| Data structures for mergeable trees | 1 | 0.37 | 2007 |
