Claudius Proissl

According to our database, Claudius Proissl authored at least 16 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Computing the Exact Radius of Large Graphs.

Stefan Funke, Claudius Proissl, Sabine Storandt

Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths.

Stefan Funke, Daniel Koch, Claudius Proissl, Christian Staib, Felix Weitbrecht

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024

Greedy SLIM: A SLIM-Based Approach For Preference Elicitation.

Claudius Proissl, Amel Vatic, Helmut Waldschmidt

CoRR, 2024

Improved Lightweight Rendering of Road Networks based on Contraction Hierarchies.

Lukas Berner, Johannes Erwerle, Stefan Funke, Claudius Proissl, Florian Rieg, Sabine Storandt

Proceedings of the 17th IEEE Pacific Visualization Conference, 2024

Scalable Ultrafast Almost-optimal Euclidean Shortest Paths.

Stefan Funke, Daniel Koch, Claudius Proissl, Axel Schneewind, Armin Weiß, Felix Weitbrecht

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Revisiting the Bus Stop Problem in Road Networks.

Claudius Proissl, Daniel Koch

Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems, 2024

2023

On hierarchical search and preference-based routing in transportation networks.

Claudius Proissl

PhD thesis, 2023

On Improving Contraction Hierarchies Using Distance Group Partitions.

Claudius Proissl

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Light Contraction Hierarchies: Hierarchical Search Without Shortcuts.

Claudius Proissl

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions.

Florian Barth, Stefan Funke, Claudius Proissl

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques.

Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets.

Florian Barth, Stefan Funke, Claudius Proissl

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

On the Difference between Search Space Size and Query Complexity in Contraction Hierarchies.

Claudius Proissl, Tobias Rupp

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Scalable unsupervised multi-criteria trajectory segmentation and driving preference mining.

Florian Barth, Stefan Funke, Tobias Skovgaard Jepsen, Claudius Proissl

Proceedings of the BIGSPATIAL '20: Proceedings of the 9th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2020

2019

Coordinating Users of Shared Facilities via Data-driven Predictive Assistants and Game Theory.

Philipp Geiger, Michel Besserve, Justus Winkelmann, Claudius Proissl, Bernhard Schölkopf

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

2018

Coordination via predictive assistants from a game-theoretic view.

Philipp Geiger, Justus Winkelmann, Claudius Proissl, Michel Besserve, Bernhard Schölkopf

CoRR, 2018