The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mikael Hammar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
    Higher Order Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:232-243 [Conf]
  5. 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]
  6. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    Competitive Exploration of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:234-245 [Conf]
  7. 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]
  8. Mikael Hammar, Bengt J. Nilsson
    Approximation Results for Kinetic Variants of TSP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:392-401 [Conf]
  9. 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]
  10. 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]
  11. Mikael Hammar, Bengt J. Nilsson, Mia Persson
    The Online Freeze-Tag Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:569-579 [Conf]
  12. 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]
  13. 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]
  14. Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
    Parallel Searching on m Rays. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:132-142 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]

  25. A note on submodular set cover on matroids. [Citation Graph (, )][DBLP]


Search in 0.251secs, Finished in 0.252secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002