I agree that this site is using cookies. You can find further informations here.
X
Hammar, Mikael
111  results:
Search for persons X
?
1

Data-driven software design with Constraint Oriented Multi-..:

Ros, Rasmus ; Hammar, Mikael
Empirical Software Engineering.  25 (2020)  5 - p. 3841-3872 , 2020
Link: https://doi.org/10.1007/..
 
?
2

A Bandit-Based Ensemble Framework for Exploration/Exploitat..:

Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J..
ACM Transactions on Interactive Intelligent Systems (TiiS).  10 (2019)  1 - p. 1-32 , 2019
Link: https://dl.acm.org/doi/1..
 
?
3

A Bandit-Based Ensemble Framework for Exploration/Exploitat..:

Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J..
ACM Transactions on Interactive Intelligent Systems.  10 (2019)  1 - p. 1-32 , 2019
Link: https://doi.org/10.1145/..
 
?
4

Ensemble Recommendations via Thompson Sampling : an Expe..:

, In: 23rd International Conference on Intelligent User Interfaces,
Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J.. - p. 19-29 , 2018
Link: https://dl.acm.org/doi/1..
 
?
5

Bandit Algorithms for e-Commerce Recommender Systems : E..:

, In: Proceedings of the Eleventh ACM Conference on Recommender Systems,
Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J.. - p. 349 ff. , 2017
Link: https://dl.acm.org/doi/1..
 
?
6

Using maximum coverage to optimize recommendation systems i..:

, In: Proceedings of the 7th ACM conference on Recommender systems,
Hammar, Mikael ; Karlsson, Robin ; Nilsson, Bengt J. - p. 265-272 , 2013
Link: https://dl.acm.org/doi/1..
 
?
7

Spider Covers and Their Applications:

De Santis, Filomena ; Gargano, Luisa ; Hammar, Mikael..
ISRN Discrete Mathematics.  2012 (2012)  - p. 1-11 , 2012
Link: https://doi.org/10.5402/..
 
?
8

A note on submodular set cover on matroids:

Gargano, Luisa ; Hammar, Mikael
Discrete Mathematics.  309 (2009)  18 - p. 5739-5744 , 2009
Link: https://doi.org/10.1016/..
 
?
9

Degree-Optimal Routing for P2P Systems:

Chiola, Giovanni ; Cordasco, Gennaro ; Gargano, Luisa...
Theory of Computing Systems.  45 (2007)  1 - p. 43-63 , 2007
Link: https://doi.org/10.1007/..
 
?
10

Competitive exploration of rectilinear polygons:

Hammar, Mikael ; Nilsson, Bengt J. ; Persson, Mia
Theoretical Computer Science.  354 (2006)  3 - p. 367-378 , 2006
Link: https://doi.org/10.1016/..
 
?
11

A System for Virtual Directories Using Euler Diagrams:

De Chiara, Rosario ; Hammar, Mikael ; Scarano, Vittorio
Electronic Notes in Theoretical Computer Science.  134 (2005)  - p. 33-53 , 2005
Link: https://doi.org/10.1016/..
 
?
12

Brief announcement : degree: optimal deterministic routi..:

, In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing,
Cordasco, Gennaro ; Gargano, Luisa ; Hammar, Mikael. - p. 395 ff. , 2004
Link: https://dl.acm.org/doi/1..
 
?
13

Spanning spiders and light-splitting switches:

Gargano, Luisa ; Hammar, Mikael ; Hell, Pavol..
Discrete Mathematics.  285 (2004)  1-3 - p. 83-95 , 2004
Link: https://doi.org/10.1016/..
 
?
14

Online and Offline Algorithms for the Time-Dependent TSP wi..:

Brodén, Björn ; Hammar, Mikael ; Nilsson, Brengt J.
Algorithmica.  39 (2004)  4 - p. 299-319 , 2004
Link: https://doi.org/10.1007/..
 
?
15

Higher order Delaunay triangulations:

Gudmundsson, Joachim ; Hammar, Mikael ; van Kreveld, Marc
Computational Geometry.  23 (2002)  1 - p. 85-98 , 2002
Link: https://doi.org/10.1016/..
 
1-15