2008 |
25 | EE | Gennaro Cordasco,
Luisa Gargano,
Alberto Negro,
Vittorio Scarano,
Mikael Hammar:
F-Chord: Improved uniform routing on Chord.
Networks 52(4): 325-332 (2008) |
2006 |
24 | EE | Mikael Hammar,
Bengt J. Nilsson,
Mia Persson:
The Online Freeze-Tag Problem.
LATIN 2006: 569-579 |
23 | EE | Mikael Hammar,
Bengt J. Nilsson,
Mia Persson:
Competitive exploration of rectilinear polygons.
Theor. Comput. Sci. 354(3): 367-378 (2006) |
2005 |
22 | EE | Gennaro Cordasco,
Luisa Gargano,
Mikael Hammar,
Vittorio Scarano:
Degree-Optimal Deterministic Routing for P2P Systems.
ISCC 2005: 158-163 |
21 | EE | Rosario De Chiara,
Mikael Hammar,
Vittorio Scarano:
A System for Virtual Directories Using Euler Diagrams.
Electr. Notes Theor. Comput. Sci. 134: 33-53 (2005) |
2004 |
20 | EE | Luisa Gargano,
Mikael Hammar,
Anna Pagh:
Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks.
IPDPS 2004 |
19 | EE | Gennaro Cordasco,
Luisa Gargano,
Mikael Hammar,
Vittorio Scarano:
Brief announcement: degree: optimal deterministic routing for P2P systems.
PODC 2004: 395 |
18 | EE | Gennaro Cordasco,
Luisa Gargano,
Mikael Hammar,
Alberto Negro,
Vittorio Scarano:
F-Chord: Improved Uniform Routing on Chord: (Extended Abstract).
SIROCCO 2004: 89-98 |
17 | EE | Björn Brodén,
Mikael Hammar,
Bengt J. Nilsson:
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones.
Algorithmica 39(4): 299-319 (2004) |
16 | EE | Luisa Gargano,
Mikael Hammar,
Pavol Hell,
Ladislav Stacho,
Ugo Vaccaro:
Spanning spiders and light-splitting switches.
Discrete Mathematics 285(1-3): 83-95 (2004) |
2003 |
15 | EE | Mikael Hammar,
Bengt J. Nilsson,
Mia Persson:
Competitive Exploration of Rectilinear Polygons.
FCT 2003: 234-245 |
14 | EE | Luisa Gargano,
Mikael Hammar:
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).
ICALP 2003: 802-816 |
13 | | Mark de Berg,
Joachim Gudmundsson,
Mikael Hammar,
Mark H. Overmars:
On R-trees with low query complexity.
Comput. Geom. 24(3): 179-195 (2003) |
2002 |
12 | | Joachim Gudmundsson,
Mikael Hammar,
Marc J. van Kreveld:
Higher order Delaunay triangulations.
Comput. Geom. 23(1): 85-98 (2002) |
11 | EE | Mikael Hammar,
Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP.
Discrete & Computational Geometry 27(4): 635-651 (2002) |
10 | EE | Pankaj K. Agarwal,
Mark de Berg,
Joachim Gudmundsson,
Mikael Hammar,
Herman J. Haverkort:
Box-Trees and R-Trees with Near-Optimal Query Time.
Discrete & Computational Geometry 28(3): 291-312 (2002) |
9 | | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Improved Exploration of Rectilinear Polygons.
Nord. J. Comput. 9(1): 32-53 (2002) |
2001 |
8 | EE | Björn Brodén,
Mikael Hammar,
Bengt J. Nilsson:
Guarding lines and 2-link polygons is apx-hard.
CCCG 2001: 45-48 |
7 | EE | Pankaj K. Agarwal,
Mark de Berg,
Joachim Gudmundsson,
Mikael Hammar,
Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time.
Symposium on Computational Geometry 2001: 124-133 |
6 | | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Parallel searching on m rays.
Comput. Geom. 18(3): 125-139 (2001) |
2000 |
5 | | Mark de Berg,
Joachim Gudmundsson,
Mikael Hammar,
Mark H. Overmars:
On R-trees with Low Stabbing Number.
ESA 2000: 167-178 |
4 | | Joachim Gudmundsson,
Mikael Hammar,
Marc J. van Kreveld:
Higher Order Delaunay Triangulations.
ESA 2000: 232-243 |
1999 |
3 | EE | Mikael Hammar,
Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP.
ICALP 1999: 392-401 |
2 | EE | Mikael Hammar,
Bengt J. Nilsson,
Sven Schuierer:
Parallel Searching on m Rays.
STACS 1999: 132-142 |
1997 |
1 | | Mikael Hammar,
Bengt J. Nilsson:
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.
FCT 1997: 210-221 |