# contractionhierarchies
2022 / Improving Time-Dependent Contraction Hierarchies
Shen, B., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2022). Improving Time-Dependent Contraction Hierarchies. In A. Kumar, S. Thiébaux, P. Varakantham, & W. Yeoh (Eds.), Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (virtual), June 13-24, 2022 (pp. 338–347). AAAI Press. https://ojs.aaai.org/index.php/ICAPS/article/view/198182021 / Contracting and Compressing Shortest Path Databases
Shen, B., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2021). Contracting and Compressing Shortest Path Databases. In S. Biundo, M. Do, R. Goldman, M. Katz, Q. Yang, & H. H. Zhuo (Eds.), Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, China (virtual), August 2-13, 2021 (pp. 322–330). AAAI Press. https://ojs.aaai.org/index.php/ICAPS/article/view/159772018 / Forward Search in Contraction Hierarchies
Harabor, D. D., & Stuckey, P. J. (2018). Forward Search in Contraction Hierarchies. Proceedings of the Eleventh International Symposium on Combinatorial Search (SOCS), 55–62.