# Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks +
## 2 Materials and Methods
### Shortcut Unpacking Data
In Proceedings of the 15 th International Symposium on Experimental Algorithms (SEA'16), St. Petersburg, Russia, 5-8 June 2016; Springer: Berlin/Heidelberg, Germany, 2016; Volume 9685, pp. 33-49. * [PERSON] and [PERSON] (2005) [PERSON]; [PERSON] Computing the Shortest Path: A* Search Meets Graph Theory. In Proceedings of the 16 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), Vancouver, BC, Canada, 23-25 January 2005; pp. 156-165. * [PERSON] et al. (1968) [PERSON]; [PERSON]; [PERSON] A Formal Basis for the Heuristic Determination of Minimum Cost Paths. _IEEE Trans. Syst. Sci. Cybern._**1968**, \(4\), 100-107. [CrossRef]
* [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON]; [PERSON] Bidirectional A* Search on Time-Dependent Road Networks. _Networks_**2012**, _59_, 240-251. [CrossRef]
* [PERSON] (2004) [PERSON] An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In _Geoinformation und Mobilitat--von der Forschung zur Praktischen Anwendung_; IGI Prints:Munster, Germany, 2004; Volume 22, pp. 219-230. * [PERSON] (2011) [PERSON] Time-Dependent SHARC-Routing. _Algorithmica_**2011**, _60_, 60-94. [CrossRef]
* [PERSON] et al. (2008) [PERSON]; [PERSON]; [PERSON] Engineering Multilevel Overlay Graphs for Shortest-Path Queries. _ACM J. Exp. Algorithmics_**2008**, _13_, 1-26. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Engineering Oracles for Time-Dependent Road Networks. In Proceedings of the 18 th Meeting on Algorithm Engineering and Experiments (ALENEX'16), Arlington, VA, USA, 10 January 2016; pp. 1-14. * [PERSON] et al. (2017) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Improved Oracles for Time-Dependent Road Networks. In Proceedings of the 17 th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'17), Vienna, Austria, 7-8 September 2017; Volume 59, pp. 4:1-4:17. * [PERSON] (2017) [PERSON] Dynamic Time-Dependent Routing in Road Networks Through Sampling. In Proceedings of the 17 th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'17), Vienna, Austria, 7-8 September 2017; Volume 59, pp. 3:1-3:17. * [PERSON] et al. (2015) [PERSON]; [PERSON]; [PERSON]; [PERSON] Time-dependent vehicle routing problem with path flexibility. _Transp. Res. Part B: Methodol._**2017**, _95_, 169-195. [CrossRef]
* [PERSON] et al. (2015) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Time-dependent routing problems: A review. _Comput. Oper. Res._**2015**, _64_, 189-197. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON] Space-efficient, Fast and Exact Routing in Time-dependent Road Networks. In Proceedings of the 28 th Annual European Symposium on Algorithms (ESA'20), Pisa, Italy, 7-9 September 2020. * [PERSON] and [PERSON] (1989) [PERSON]; [PERSON] _Traveling without Waiting in Time-Dependent Networks Is NP-Hard_; Technical Report; Department Electrical Engineering, Technion-Israel Institute of Technology: Haifa, Israel, 1989. * [PERSON] (1969) [PERSON] An Appraisal of Some Shortest-Path Algorithms. _Oper. Res._**1969**, _17_, 395-412. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON]; [PERSON] Search-space size in contraction hierarchies. _Theor. Comput. Sci._**2016**, _645_, 112-127. [CrossRef]
* [PERSON] (1973) [PERSON] Nested Dissection of a Regular Finite Element Mesh. _SIAM J. Numer. Anal._**1973**, _10_, 345-363. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON]; [PERSON] Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. _Algorithms_**2019**, _12_, 196. [CrossRef]
* [PERSON] (2019) [PERSON] Customizable Contraction Hierarchies with Turn Costs. Bachelor's Thesis, Karlsruhe Institute of Technology, Karlsruhe, Germany, 2019. * [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. _ACM J. Exp.