The following pages link to Carsten Grimm (Q2206727):
Displaying 7 items.
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
- A note on the unsolvability of the weighted region shortest path problem (Q2249044) (← links)
- Minimizing the continuous diameter when augmenting a tree with a shortcut (Q2405291) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Optimal Data Structures for Farthest-Point Queries in Cactus Networks (Q2940594) (← links)
- Network farthest-point diagrams (Q2968103) (← links)
- (Q5369529) (← links)
