| Scalable unsupervised multi-criteria trajectory segmentation and driving preference mining F Barth, S Funke, TS Jepsen, C Proissl Proceedings of the 9th ACM SIGSPATIAL International Workshop on Analytics …, 2020 | 9 | 2020 |
| Distance closures: Unifying search-and lookup-based shortest path speedup techniques D Bahrdt, S Funke, S Makolli, C Proissl 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022 | 6 | 2022 |
| Preference-based trajectory clustering-an application of geometric hitting sets F Barth, S Funke, C Proissl 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021 | 5 | 2021 |
| On the difference between search space size and query complexity in contraction hierarchies C Proissl, T Rupp SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 77-87, 2021 | 2 | 2021 |
| An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions F Barth, S Funke, C Proissl 30th Annual European Symposium on Algorithms (ESA 2022), 2022 | 1 | 2022 |
| On Improving Contraction Hierarchies Using Distance Group Partitions C Proissl SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), 38-48, 2023 | | 2023 |
| On hierarchical search and preference-based routing in transportation networks C Proissl | | 2023 |
| Light Contraction Hierarchies: Hierarchical Search Without Shortcuts C Proissl Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022 | | 2022 |
