Mikael Hammar

818 total citations
26 papers, 482 citations indexed

About

Mikael Hammar is a scholar working on Computer Networks and Communications, Signal Processing and Management Science and Operations Research. According to data from OpenAlex, Mikael Hammar has authored 26 papers receiving a total of 482 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 6 papers in Signal Processing and 6 papers in Management Science and Operations Research. Recurrent topics in Mikael Hammar's work include Peer-to-Peer Network Technologies (6 papers), Caching and Content Delivery (6 papers) and Data Management and Algorithms (6 papers). Mikael Hammar is often cited by papers focused on Peer-to-Peer Network Technologies (6 papers), Caching and Content Delivery (6 papers) and Data Management and Algorithms (6 papers). Mikael Hammar collaborates with scholars based in Sweden, Italy and Netherlands. Mikael Hammar's co-authors include Torkel Wadström, Paul W. O’Toole, Bengt J. Nilsson, Joachim Gudmundsson, Luisa Gargano, Marc van Kreveld, Vittorio Scarano, Herman Haverkort, Ladislav Stacho and Ugo Vaccaro and has published in prestigious journals such as Journal of Clinical Microbiology, Theoretical Computer Science and Networks.

In The Last Decade

Mikael Hammar

26 papers receiving 447 citations

Peers

Mikael Hammar
Peter Höfner Australia
Hosik Choi South Korea
Yongguo Mei United States
Xiaoping Tang United States
Peter Höfner Australia
Mikael Hammar
Citations per year, relative to Mikael Hammar Mikael Hammar (= 1×) peers Peter Höfner

Countries citing papers authored by Mikael Hammar

Since Specialization
Citations

This map shows the geographic impact of Mikael Hammar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mikael Hammar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mikael Hammar more than expected).

Fields of papers citing papers by Mikael Hammar

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mikael Hammar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mikael Hammar. The network helps show where Mikael Hammar may publish in the future.

Co-authorship network of co-authors of Mikael Hammar

This figure shows the co-authorship network connecting the top 25 collaborators of Mikael Hammar. A scholar is included among the top collaborators of Mikael Hammar based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mikael Hammar. Mikael Hammar is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hammar, Mikael, et al.. (2019). A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components. ACM Transactions on Interactive Intelligent Systems. 10(1). 1–32. 4 indexed citations
2.
Hammar, Mikael, et al.. (2018). Ensemble Recommendations via Thompson Sampling. KTH Publication Database DiVA (KTH Royal Institute of Technology). 19–29. 18 indexed citations
3.
Hammar, Mikael, et al.. (2013). Using maximum coverage to optimize recommendation systems in e-commerce. KTH Publication Database DiVA (KTH Royal Institute of Technology). 265–272. 25 indexed citations
4.
Gargano, Luisa & Mikael Hammar. (2008). A note on submodular set cover on matroids. Discrete Mathematics. 309(18). 5739–5744. 6 indexed citations
5.
Chiola, Giovanni, et al.. (2007). Degree-Optimal Routing for P2P Systems. Theory of Computing Systems. 45(1). 43–63. 1 indexed citations
6.
Hammar, Mikael, et al.. (2005). Competitive exploration of rectilinear polygons. Theoretical Computer Science. 354(3). 367–378. 5 indexed citations
7.
Cordasco, Gennaro, et al.. (2005). Non-Uniform Deterministic Routing on F-Chord (α). 16–21. 6 indexed citations
8.
Chiara, Rosario De, Mikael Hammar, & Vittorio Scarano. (2005). A System for Virtual Directories Using Euler Diagrams. Electronic Notes in Theoretical Computer Science. 134. 33–53. 13 indexed citations
9.
Cordasco, Gennaro, Luisa Gargano, Mikael Hammar, & Vittorio Scarano. (2005). Degree-Optimal Deterministic Routing for P2P Systems. 2218. 158–163. 8 indexed citations
10.
Cordasco, Gennaro, et al.. (2004). F-Chord: Improved Uniform Routing on Chord (Extended Abstract). 89–98. 1 indexed citations
11.
Gargano, Luisa, Mikael Hammar, Pavol Hell, Ladislav Stacho, & Ugo Vaccaro. (2004). Spanning spiders and light-splitting switches. Discrete Mathematics. 285(1-3). 83–95. 31 indexed citations
12.
Hammar, Mikael, et al.. (2004). Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica. 39(4). 299–319. 3 indexed citations
13.
Gargano, Luisa, et al.. (2004). Limiting flooding expenses in on-demand source-initiated protocols for mobile wireless networks. 220–227. 14 indexed citations
14.
Cordasco, Gennaro, Luisa Gargano, Mikael Hammar, & Vittorio Scarano. (2004). Brief announcement. 395–395. 3 indexed citations
15.
Hammar, Mikael, Bengt J. Nilsson, & Sven Schuierer. (2002). Improved exploration of rectilinear polygons. Nordic journal of computing. 9(1). 32–53. 5 indexed citations
16.
Gudmundsson, Joachim, Mikael Hammar, & Marc van Kreveld. (2002). Higher order Delaunay triangulations. Computational Geometry. 23(1). 85–98. 46 indexed citations
17.
Hammar, Mikael, et al.. (2001). Guarding Lines and 2-Link Polygons is APX-hard. Malmö University Publications (Malmö University). 45–48. 19 indexed citations
18.
Agarwal, Pankaj K., Mark de Berg, Joachim Gudmundsson, Mikael Hammar, & Herman Haverkort. (2001). Box-trees and R-trees with near-optimal query time. TU/e Research Portal. 124–133. 11 indexed citations
19.
Hammar, Mikael, Bengt J. Nilsson, & Sven Schuierer. (2001). Parallel searching on m rays. Computational Geometry. 18(3). 125–139. 6 indexed citations
20.
Hammar, Mikael, et al.. (1992). Rapid detection of Helicobacter pylori in gastric biopsy material by polymerase chain reaction. Journal of Clinical Microbiology. 30(1). 54–58. 200 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026