Mikael Hammar

Publication Activity (10 Years)

Years Active: 1997-2020
Publications (10 Years): 4

Top Venues

RecSys

Empir. Softw. Eng.

IUI

ACM Trans. Interact. Intell. Syst.

Lund University, Sweden (PHD)

Education History

Lund University, Sweden

PHD

Publications

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. ACM Trans. Interact. Intell. Syst. 10 (1) (2020)
Rasmus Ros, Mikael Hammar
Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO). Empir. Softw. Eng. 25 (5) (2020)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. IUI (2018)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis
Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. RecSys (2017)
Mikael Hammar, Robin Karlsson, Bengt J. Nilsson
Using maximum coverage to optimize recommendation systems in e-commerce. RecSys (2013)
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
Degree-Optimal Routing for P2P Systems. Theory Comput. Syst. 45 (1) (2009)
Luisa Gargano, Mikael Hammar
A note on submodular set cover on matroids. Discret. Math. 309 (18) (2009)
Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar
F-Chord: Improved uniform routing on Chord. Networks 52 (4) (2008)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354 (3) (2006)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
The Online Freeze-Tag Problem. LATIN (2006)
Rosario De Chiara, Mikael Hammar, Vittorio Scarano
A System for Virtual Directories Using Euler Diagrams. Electron. Notes Theor. Comput. Sci. 134 (2005)
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano
Degree-Optimal Deterministic Routing for P2P Systems. ISCC (2005)
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
Non-uniform deterministic routing on F-Chord(α). HOT-P2P (2004)
Luisa Gargano, Mikael Hammar, Anna Pagh
Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. IPDPS (2004)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39 (4) (2004)
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano
Brief announcement: degree: optimal deterministic routing for P2P systems. PODC (2004)
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). SIROCCO (2004)
Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
Spanning spiders and light-splitting switches. Discret. Math. 285 (1-3) (2004)
Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
On R-trees with low query complexity. Comput. Geom. 24 (3) (2003)
Mikael Hammar, Bengt J. Nilsson, Mia Persson
Competitive Exploration of Rectilinear Polygons. FCT (2003)
Luisa Gargano, Mikael Hammar
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). ICALP (2003)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9 (1) (2002)
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
Higher order Delaunay triangulations. Comput. Geom. 23 (1) (2002)
Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28 (3) (2002)
Mikael Hammar, Bengt J. Nilsson
Approximation Results for Kinetic Variants of TSP. Discret. Comput. Geom. 27 (4) (2002)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Parallel searching on m rays. Comput. Geom. 18 (3) (2001)
Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
Box-trees and R-trees with near-optimal query time. SCG (2001)
Björn Brodén, Mikael Hammar, Bengt J. Nilsson
Guarding lines and 2-link polygons is apx-hard. CCCG (2001)
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld
Higher Order Delaunay Triangulations. ESA (2000)
Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
On R-trees with Low Stabbing Number. ESA (2000)
Mikael Hammar, Bengt J. Nilsson
Approximation Results for Kinetic Variants of TSP. ICALP (1999)
Mikael Hammar, Bengt J. Nilsson, Sven Schuierer
Parallel Searching on m Rays. STACS (1999)
Mikael Hammar, Bengt J. Nilsson
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT (1997)

Mikael Hammar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikael Hammar