Mikael Hammar

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