Mikael Hammar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2020

A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-CommerceBjörn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis. tiis, 10(1), 2020. [doi]

Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO)Rasmus Ros, Mikael Hammar. ese, 25(5):3841-3872, 2020. [doi]

2018

Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-CommerceBjörn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis. IUI 2018: 19-29 [doi]

2017

Bandit Algorithms for e-Commerce Recommender Systems: Extended AbstractBjörn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis. recsys 2017: 349 [doi]

2013

Using maximum coverage to optimize recommendation systems in e-commerceMikael Hammar, Robin Karlsson, Bengt J. Nilsson. recsys 2013: 265-272 [doi]

2009

Degree-Optimal Routing for P2P SystemsGiovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano. mst, 45(1):43-63, 2009. [doi]

A note on submodular set cover on matroidsLuisa Gargano, Mikael Hammar. DM, 309(18):5739-5744, 2009. [doi]

2008

F-Chord: Improved uniform routing on ChordGennaro Cordasco, Luisa Gargano, Alberto Negro, Vittorio Scarano, Mikael Hammar. networks, 52(4):325-332, 2008. [doi]

2006

The Online Freeze-Tag ProblemMikael Hammar, Bengt J. Nilsson, Mia Persson. latin 2006: 569-579 [doi]

Competitive exploration of rectilinear polygonsMikael Hammar, Bengt J. Nilsson, Mia Persson. TCS, 354(3):367-378, 2006. [doi]

2005

A System for Virtual Directories Using Euler DiagramsRosario De Chiara, Mikael Hammar, Vittorio Scarano. ENTCS, 134:33-53, 2005. [doi]

Degree-Optimal Deterministic Routing for P2P SystemsGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano. ISCC 2005: 158-163 [doi]

2004

Online and Offline Algorithms for the Time-Dependent TSP with Time ZonesBjörn Brodén, Mikael Hammar, Bengt J. Nilsson. algorithmica, 39(4):299-319, 2004. [doi]

Non-uniform deterministic routing on F-Chord(α)Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano. hotp2p 2004: 16-21 [doi]

Brief announcement: degree: optimal deterministic routing for P2P systemsGennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano. podc 2004: 395 [doi]

F-Chord: Improved Uniform Routing on Chord: (Extended Abstract)Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano. sirocco 2004: 89-98 [doi]

Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless NetworksLuisa Gargano, Mikael Hammar, Anna Pagh. ipps 2004: [doi]

Spanning spiders and light-splitting switchesLuisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro. DM, 285(1-3):83-95, 2004. [doi]

2003

On R-trees with low query complexityMark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars. comgeo, 24(3):179-195, 2003.

There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)Luisa Gargano, Mikael Hammar. icalp 2003: 802-816 [doi]

Competitive Exploration of Rectilinear PolygonsMikael Hammar, Bengt J. Nilsson, Mia Persson. fct 2003: 234-245 [doi]

2002

Box-Trees and R-Trees with Near-Optimal Query TimePankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. dcg, 28(3):291-312, 2002. [doi]

Higher order Delaunay triangulationsJoachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld. comgeo, 23(1):85-98, 2002.

Approximation Results for Kinetic Variants of TSPMikael Hammar, Bengt J. Nilsson. dcg, 27(4):635-651, 2002. [doi]

Improved Exploration of Rectilinear PolygonsMikael Hammar, Bengt J. Nilsson, Sven Schuierer. njc, 9(1):32-53, 2002.

2001

Box-trees and R-trees with near-optimal query timePankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. compgeom 2001: 124-133 [doi]

Guarding lines and 2-link polygons is apx-hardBjörn Brodén, Mikael Hammar, Bengt J. Nilsson. cccg 2001: 45-48 [doi]

From Art Galleries to Terrain Modelling - A Meandering Path through Computational GeometryMikael Hammar. PhD thesis, Lund University, Sweden, 2001. [doi]

Parallel searching on m raysMikael Hammar, Bengt J. Nilsson, Sven Schuierer. comgeo, 18(3):125-139, 2001.

2000

On R-trees with Low Stabbing NumberMark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars. esa 2000: 167-178

Higher Order Delaunay TriangulationsJoachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld. esa 2000: 232-243

1999

Parallel Searching on m RaysMikael Hammar, Bengt J. Nilsson, Sven Schuierer. STACS 1999: 132-142 [doi]

Approximation Results for Kinetic Variants of TSPMikael Hammar, Bengt J. Nilsson. icalp 1999: 392-401 [doi]

1997

Concerning the Time Bounds of Existing Shortest Watchman Route AlgorithmsMikael Hammar, Bengt J. Nilsson. fct 1997: 210-221

Sign in or sign up to see more results.

runs on WebDSL