dblp.uni-trier.dewww.uni-trier.de

Mikael Hammar

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
25EEGennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar: F-Chord: Improved uniform routing on Chord. Networks 52(4): 325-332 (2008)
2006
24EEMikael Hammar, Bengt J. Nilsson, Mia Persson: The Online Freeze-Tag Problem. LATIN 2006: 569-579
23EEMikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006)
2005
22EEGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano: Degree-Optimal Deterministic Routing for P2P Systems. ISCC 2005: 158-163
21EERosario De Chiara, Mikael Hammar, Vittorio Scarano: A System for Virtual Directories Using Euler Diagrams. Electr. Notes Theor. Comput. Sci. 134: 33-53 (2005)
2004
20EELuisa Gargano, Mikael Hammar, Anna Pagh: Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. IPDPS 2004
19EEGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano: Brief announcement: degree: optimal deterministic routing for P2P systems. PODC 2004: 395
18EEGennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano: F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). SIROCCO 2004: 89-98
17EEBjö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)
16EELuisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning spiders and light-splitting switches. Discrete Mathematics 285(1-3): 83-95 (2004)
2003
15EEMikael Hammar, Bengt J. Nilsson, Mia Persson: Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245
14EELuisa 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)
11EEMikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. Discrete & Computational Geometry 27(4): 635-651 (2002)
10EEPankaj 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
8EEBjörn Brodén, Mikael Hammar, Bengt J. Nilsson: Guarding lines and 2-link polygons is apx-hard. CCCG 2001: 45-48
7EEPankaj 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
3EEMikael Hammar, Bengt J. Nilsson: Approximation Results for Kinetic Variants of TSP. ICALP 1999: 392-401
2EEMikael 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

Coauthor Index

1Pankaj K. Agarwal [7] [10]
2Mark de Berg [5] [7] [10] [13]
3Björn Brodén [8] [17]
4Rosario De Chiara [21]
5Gennaro Cordasco [18] [19] [22] [25]
6Luisa Gargano [14] [16] [18] [19] [20] [22] [25]
7Joachim Gudmundsson [4] [5] [7] [10] [12] [13]
8Herman J. Haverkort [7] [10]
9Pavol Hell [16]
10Marc J. van Kreveld [4] [12]
11Alberto Negro [18] [25]
12Bengt J. Nilsson [1] [2] [3] [6] [8] [9] [11] [15] [17] [23] [24]
13Mark H. Overmars [5] [13]
14Anna Pagh (Anna Östlin) [20]
15Mia Persson [15] [23] [24]
16Vittorio Scarano [18] [19] [21] [22] [25]
17Sven Schuierer [2] [6] [9]
18Ladislav Stacho [16]
19Ugo Vaccaro [16]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)