The following pages link to Mikael Hammar (Q202633):
Displayed 23 items.
- Degree-optimal routing for P2P systems (Q841622) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Approximation results for kinetic variants of TSP (Q1611067) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- (Q1849438) (redirect page) (← links)
- Box-trees and R-trees with near-optimal query time (Q1849440) (← links)
- On R-trees with low query complexity (Q1869749) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Online and offline algorithms for the time-dependent TSP with time zones (Q1882408) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- (Q2753933) (← links)
- (Q2753939) (← links)
- (Q2848465) (← links)
- (Q3150180) (← links)
- The Online Freeze-Tag Problem (Q3525792) (← links)
- F-Chord: Improved uniform routing on Chord (Q3548733) (← links)
- (Q4449221) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
- Structural Information and Communication Complexity (Q5315245) (← links)
- Box-trees and R-trees with near-optimal query time (Q5361567) (← links)
- Fundamentals of Computation Theory (Q5900800) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)