Mikael Hammar

University of Salerno, Lund University, Ideon Science Park

Papers

4

Total Citations

45

H-Index

4

About

Mikael Hammar is a computer scientist whose research centers on online algorithms, computational geometry, and search theory, with a particular focus on problems involving exploration, parallel search, and time-critical coordination. His most influential work, "Competitive exploration of rectilinear polygons" (2005, 16 citations), addresses how an autonomous agent can efficiently map unknown polygonal environments, a foundational problem in robotics and geographic information systems. Hammar's contributions to parallel search are equally significant; his papers "Parallel searching on m rays" (2001, 13 citations) and its earlier 1999 version (8 citations) analyze how multiple searchers can optimally locate a target on a set of rays, establishing competitive ratios that inform multi-agent search strategies. He also introduced the "Online Freeze-Tag Problem" (2006, 8 citations), a novel model for waking sleeping robots in minimal time, which has inspired further work in swarm robotics and scheduling. Though his citation counts are modest, Hammar’s work is notable for its clarity and foundational nature, often cited in the context of competitive analysis and exploration algorithms. His research bridges theoretical guarantees with practical applications, making him a respected figure in algorithmic search and exploration.

Research Focus

Key Achievements

4
H-Index
4
Papers
45
Total Citations
11
Avg Citations/Paper
🏆 Most Cited Paper
Competitive exploration of rectilinear polygons
16 citations · 2005
📈 Most Prolific Year: 2005 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: University of Salerno, Lund University, Ideon Science Park

Top Papers

  1. 1
  2. 2
    Parallel searching on m rays
    13 citations · 2001
  3. 3
  4. 4
    Parallel Searching on m Rays
    8 citations · 1999

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 15 days ago