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