Mikael Hammar

Available identifiers

Publication	Date of Publication	Type
Concerning the time bounds of existing shortest watchman route algorithms	2022-12-09	Paper
Box-trees and R-trees with near-optimal query time	2017-09-29	Paper
A system for virtual directories using Euler diagrams	2013-09-26	Paper
Spider covers and their applications	2013-02-21	Paper
Fundamentals of Computation Theory	2010-04-20	Paper
A note on submodular set cover on matroids	2009-12-15	Paper
Degree-optimal routing for P2P systems	2009-09-18	Paper
F-Chord: Improved uniform routing on Chord	2008-12-17	Paper
The Online Freeze-Tag Problem	2008-09-18	Paper
Competitive exploration of rectilinear polygons	2006-04-28	Paper
Structural Information and Communication Complexity	2005-09-07	Paper
Online and offline algorithms for the time-dependent TSP with time zones	2004-10-01	Paper
Spanning spiders and light-splitting switches	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4449221	2004-02-08	Paper
On R-trees with low query complexity	2003-04-28	Paper
Box-trees and R-trees with near-optimal query time	2002-12-01	Paper
Higher order Delaunay triangulations	2002-09-03	Paper
Approximation results for kinetic variants of TSP	2002-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q3150180	2002-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q2753939	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q2753933	2001-11-11	Paper
Parallel searching on \(m\) rays	2001-09-27	Paper

This page was built for person: Mikael Hammar