Simple Distributed Graph Clustering using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (CoRR, 2017)

Distributed Graph Clustering Using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (Euro-Par, 2018)

A* with Perfect Potentials. - Ben Strasser; Tim Zeitz (CoRR, 2019)

Customizable Contraction Hierarchies with Turn Costs. - Valentin Buchhold; Dorothea Wagner; Tim Zeitz; Michael Zündorf (ATMOS, 2020)

Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas. - Alexander Kleff; Frank Schulz 001; Jakob Wagenblatt; Tim Zeitz (SEA, 2020)

A Fast and Tight Heuristic for A* in Road Networks. - Ben Strasser; Tim Zeitz (SEA, 2021)

Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. - Ben Strasser; Dorothea Wagner; Tim Zeitz (Algorithms, 2021)

Combining Predicted and Live Traffic with Time-Dependent A* Potentials. - Nils Werner; Tim Zeitz (ESA, 2022)

Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST. - Tim Zeitz (SEA, 2022)

Engineering Algorithms for Dynamic and Time-Dependent Route Planning. - Tim Zeitz (2022)

Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks. - Ben Strasser; Tim Zeitz (ACM J. Exp. Algorithmics, 2022)

NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. - Tim Zeitz (Inf. Process. Lett., 2023)

Customizable Contraction Hierarchies - A Survey. - Thomas Bläsius; Valentin Buchhold; Dorothea Wagner; Tim Zeitz; Michael Zündorf (CoRR, 2025)