Mikael Hammar

According to our database, Mikael Hammar authored at least 29 papers between 1997 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO).

Rasmus Ros, Mikael Hammar

Empir. Softw. Eng., 2020

2018

Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis

Proceedings of the 23rd International Conference on Intelligent User Interfaces, 2018

2017

Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis

Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

2013

Using maximum coverage to optimize recommendation systems in e-commerce.

Mikael Hammar, Robin Karlsson, Bengt J. Nilsson

Proceedings of the Seventh ACM Conference on Recommender Systems, 2013

2009

Degree-Optimal Routing for P2P Systems.

Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano

Theory Comput. Syst., 2009

A note on submodular set cover on matroids.

Luisa Gargano, Mikael Hammar

Discret. Math., 2009

2008

F-Chord: Improved uniform routing on Chord.

Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar

Networks, 2008

2006

Competitive exploration of rectilinear polygons.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Theor. Comput. Sci., 2006

The Online Freeze-Tag Problem.

Mikael Hammar, Bengt J. Nilsson, Mia Persson

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Degree-Optimal Deterministic Routing for P2P Systems.

Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano

Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), 2005

2004

A System for Virtual Directories Using Euler Diagrams.

Rosario De Chiara, Mikael Hammar, Vittorio Scarano

Proceedings of the First International Workshop on Euler Diagrams, 2004

Spanning spiders and light-splitting switches.

Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro

Discret. Math., 2004

Online and Offline Algorithms for the Time-Dependent TSP with Time Zones.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson

Algorithmica, 2004

F-Chord: Improved Uniform Routing on Chord: (Extended Abstract).

Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano

Proceedings of the Structural Information and Communication Complexity, 2004

Brief announcement: degree: optimal deterministic routing for P2P systems.

Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks.

Luisa Gargano, Mikael Hammar, Anna Pagh

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Non-uniform deterministic routing on F-Chord(α).

Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano

Proceedings of the International Workshop on Hot Topics in Peer-to-Peer Systems, 2004

2003

On R-trees with low query complexity.

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars

Comput. Geom., 2003

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).

Luisa Gargano, Mikael Hammar

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Improved Exploration of Rectilinear Polygons.

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer

Nord. J. Comput., 2002

Approximation Results for Kinetic Variants of TSP.

Mikael Hammar, Bengt J. Nilsson

Discret. 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

Higher order Delaunay triangulations.

Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld

Comput. Geom., 2002

2001

From Art Galleries to Terrain Modelling - A Meandering Path through Computational Geometry.

Mikael Hammar

PhD thesis, 2001

Parallel searching on m rays.

Mikael Hammar, Bengt J. Nilsson, Sven Schuierer

Comput. Geom., 2001

Guarding lines and 2-link polygons is apx-hard.

Björn Brodén, Mikael Hammar, Bengt J. Nilsson

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

On R-trees with Low Stabbing Number.

Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars

Proceedings of the Algorithms, 2000

1997

Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms.

Mikael Hammar, Bengt J. Nilsson

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997