| 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 | 7 | 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), 15 …, 2021 | 6 | 2021 |
| „Scalable Ultrafast Almost-optimal Euclidean Shortest Paths “ S Funke, D Koch, C Proissl, A Schneewind, A Weiß, F Weitbrecht Proceedings of the Thirty-Third International Joint Conference on Artificial …, 2024 | 4 | 2024 |
| Improved Lightweight Rendering of Road Networks based on Contraction Hierarchies L Berner, J Erwerle, S Funke, C Proissl, F Rieg, S Storandt 2024 IEEE 17th Pacific Visualization Conference (PacificVis), 202-211, 2024 | 2 | 2024 |
| 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), 14: 1-14: 12, 2022 | 2 | 2022 |
| 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 |
| Fast and stronger lower bounds for planar Euclidean shortest paths S Funke, D Koch, C Proissl, C Staib, F Weitbrecht Proceedings of the Thirty-Third International Joint Conference on Artificial …, 2025 | 1 | 2025 |
| Computing the exact radius of large graphs S Funke, C Proissl, S Storandt 23rd International Symposium on Experimental Algorithms (SEA 2025), 17: 1-17: 14, 2025 | 1 | 2025 |
| Revisiting the Bus Stop Problem in Road Networks C Proissl, D Koch Proceedings of the 32nd ACM International Conference on Advances in …, 2024 | | 2024 |
| Greedy SLIM: A SLIM-Based Approach For Preference Elicitation C Proissl, A Vatic, H Waldschmidt arXiv preprint arXiv:2406.06061, 2024 | | 2024 |
| 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 Dissertation, Stuttgart, Universität Stuttgart, 2023, 2023 | | 2023 |
| Light Contraction Hierarchies: Hierarchical Search Without Shortcuts C Proissl Proceedings of the International Symposium on Combinatorial Search 15 (1 …, 2022 | | 2022 |
| Pathfindervis. L Baur, S Funke, T Rupp, F Barth, C Proissl, N Wolpert SIGSPATIAL/GIS, 55:1-55:4, 2022 | | 2022 |
