Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. - Mikael Hammar; Bengt J. Nilsson (FCT, 1997)

On R-trees with Low Stabbing Number. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (ESA, 2000)

Guarding lines and 2-link polygons is apx-hard. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson (CCCG, 2001)

Parallel searching on m rays. - Mikael Hammar; Bengt J. Nilsson; Sven Schuierer (Comput. Geom., 2001)

From Art Galleries to Terrain Modelling - A Meandering Path through Computational Geometry. - Mikael Hammar (2001)

Higher order Delaunay triangulations. - Joachim Gudmundsson; Mikael Hammar; Marc J. van Kreveld (Comput. Geom., 2002)

Box-Trees and R-Trees with Near-Optimal Query Time. - Pankaj K. Agarwal; Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Herman J. Haverkort (Discret. Comput. Geom., 2002)

Approximation Results for Kinetic Variants of TSP. - Mikael Hammar; Bengt J. Nilsson (Discret. Comput. Geom., 2002)

Improved Exploration of Rectilinear Polygons. - Mikael Hammar; Bengt J. Nilsson; Sven Schuierer (Nord. J. Comput., 2002)

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). - Luisa Gargano; Mikael Hammar (ICALP, 2003)

On R-trees with low query complexity. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (Comput. Geom., 2003)

Non-uniform deterministic routing on F-Chord(α). - Gennaro Cordasco; Luisa Gargano; Mikael Hammar; Alberto Negro; Vittorio Scarano (HOT-P2P, 2004)

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. - Luisa Gargano; Mikael Hammar; Anna Pagh (IPDPS, 2004)

Brief announcement: degree: optimal deterministic routing for P2P systems. - Gennaro Cordasco; Luisa Gargano; Mikael Hammar; Vittorio Scarano (PODC, 2004)

F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). - Gennaro Cordasco; Luisa Gargano; Mikael Hammar; Alberto Negro; Vittorio Scarano (SIROCCO, 2004)

Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson (Algorithmica, 2004)

Spanning spiders and light-splitting switches. - Luisa Gargano; Mikael Hammar; Pavol Hell; Ladislav Stacho; Ugo Vaccaro (Discret. Math., 2004)

A System for Virtual Directories Using Euler Diagrams. - Rosario De Chiara; Mikael Hammar; Vittorio Scarano (Euler, 2004)

Degree-Optimal Deterministic Routing for P2P Systems. - Gennaro Cordasco; Luisa Gargano; Mikael Hammar; Vittorio Scarano (ISCC, 2005)

The Online Freeze-Tag Problem. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (LATIN, 2006)

Competitive exploration of rectilinear polygons. - Mikael Hammar; Bengt J. Nilsson; Mia Persson (Theor. Comput. Sci., 2006)

F-Chord: Improved uniform routing on Chord. - Gennaro Cordasco; Luisa Gargano; Alberto Negro; Vittorio Scarano; Mikael Hammar (Networks, 2008)

A note on submodular set cover on matroids. - Luisa Gargano; Mikael Hammar (Discret. Math., 2009)

Degree-Optimal Routing for P2P Systems. - Giovanni Chiola; Gennaro Cordasco; Luisa Gargano; Mikael Hammar; Alberto Negro; Vittorio Scarano (Theory Comput. Syst., 2009)

Using maximum coverage to optimize recommendation systems in e-commerce. - Mikael Hammar; Robin Karlsson; Bengt J. Nilsson (RecSys, 2013)

Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson; Dimitris Paraschakis (RecSys, 2017)

Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson; Dimitris Paraschakis (IUI, 2018)

Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO). - Rasmus Ros; Mikael Hammar (Empir. Softw. Eng., 2020)

A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. - Björn Brodén; Mikael Hammar; Bengt J. Nilsson; Dimitris Paraschakis (ACM Trans. Interact. Intell. Syst., 2020)