Tim Zeitz

Orcid: 0000-0003-4746-3582

According to our database1, Tim Zeitz authored at least 12 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2022
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks.
ACM J. Exp. Algorithmics, December, 2022

Engineering Algorithms for Dynamic and Time-Dependent Route Planning.
PhD thesis, 2022

Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Combining Predicted and Live Traffic with Time-Dependent A* Potentials.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks.
Algorithms, 2021

A Fast and Tight Heuristic for A* in Road Networks.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020
Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Customizable Contraction Hierarchies with Turn Costs.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019
A* with Perfect Potentials.
CoRR, 2019

2018
Distributed Graph Clustering Using Modularity and Map Equation.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

2017
Simple Distributed Graph Clustering using Modularity and Map Equation.
CoRR, 2017


  Loading...