| 2018 | IUI | Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. | Bjrn Brodn, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis |
| 2017 | RecSys | Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. | Bjrn Brodn, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis |
| 2013 | RecSys | Using maximum coverage to optimize recommendation systems in e-commerce. | Mikael Hammar, Robin Karlsson, Bengt J. Nilsson |
| 2006 | LATIN | The Online Freeze-Tag Problem. | Mikael Hammar, Bengt J. Nilsson, Mia Persson |
| 2005 | ISCC | Degree-Optimal Deterministic Routing for P2P Systems. | Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano |
| 2004 | PODC | Brief announcement: degree: optimal deterministic routing for P2P systems. | Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano |
| 2004 | SIROCCO | F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). | Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano |
| 2003 | FCT | Competitive Exploration of Rectilinear Polygons. | Mikael Hammar, Bengt J. Nilsson, Mia Persson |
| 2003 | ICALP | There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). | Luisa Gargano, Mikael Hammar |
| 2000 | ESA | On R-trees with Low Stabbing Number. | Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars |
| 2000 | ESA | Higher Order Delaunay Triangulations. | Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld |
| 1999 | ICALP | Approximation Results for Kinetic Variants of TSP. | Mikael Hammar, Bengt J. Nilsson |
| 1999 | STACS | Parallel Searching on m Rays. | Mikael Hammar, Bengt J. Nilsson, Sven Schuierer |
| 1997 | FCT | Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. | Mikael Hammar, Bengt J. Nilsson |