The following pages link to Holger Bast (Q1402218):
Displaying 16 items.
- (Q169711) (redirect page) (← links)
- A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms (Q1402219) (← links)
- Matching algorithms are fast in sparse random graphs (Q2432523) (← links)
- Fast parallel space allocation, estimation, and integer sorting (Q2508339) (← links)
- Fast Routing in Road Networks with Transit Nodes (Q3101693) (← links)
- (Q3574266) (← links)
- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns (Q3586470) (← links)
- Car or Public Transport—Two Worlds (Q3644732) (← links)
- (Q4736837) (← links)
- A perfect parallel dictionary (Q5096824) (← links)
- Scalable Transfer Patterns (Q5232542) (← links)
- STACS 2004 (Q5309689) (← links)
- Delay-Robustness of Transfer Patterns in Public Transportation Route Planning (Q5397841) (← links)
- Result Diversity for Multi-Modal Route Planning (Q5397850) (← links)
- Experimental and Efficient Algorithms (Q5710073) (← links)
- On scheduling parallel tasks at twilight (Q5929028) (← links)