default search action
Mikael Hammar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j14]Rasmus Ros
, Mikael Hammar:
Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO). Empir. Softw. Eng. 25(5): 3841-3872 (2020) - [j13]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
A Bandit-Based Ensemble Framework for Exploration/Exploitation of Diverse Recommendation Components: An Experimental Study within E-Commerce. ACM Trans. Interact. Intell. Syst. 10(1): 4:1-4:32 (2020)
2010 – 2019
- 2018
- [c19]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
Ensemble Recommendations via Thompson Sampling: an Experimental Study within e-Commerce. IUI 2018: 19-29 - 2017
- [c18]Björn Brodén, Mikael Hammar, Bengt J. Nilsson, Dimitris Paraschakis:
Bandit Algorithms for e-Commerce Recommender Systems: Extended Abstract. RecSys 2017: 349 - 2013
- [c17]Mikael Hammar, Robin Karlsson, Bengt J. Nilsson:
Using maximum coverage to optimize recommendation systems in e-commerce. RecSys 2013: 265-272
2000 – 2009
- 2009
- [j12]Luisa Gargano
A note on submodular set cover on matroids. Discret. Math. 309(18): 5739-5744 (2009) - [j11]Giovanni Chiola, Gennaro Cordasco
Degree-Optimal Routing for P2P Systems. Theory Comput. Syst. 45(1): 43-63 (2009) - 2008
- [j10]Gennaro Cordasco
F-Chord: Improved uniform routing on Chord. Networks 52(4): 325-332 (2008) - 2006
- [j9]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3): 367-378 (2006) - [c16]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
The Online Freeze-Tag Problem. LATIN 2006: 569-579 - 2005
- [c15]Gennaro Cordasco
Degree-Optimal Deterministic Routing for P2P Systems. ISCC 2005: 158-163 - 2004
- [j8]Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Algorithmica 39(4): 299-319 (2004) - [j7]Luisa Gargano
Spanning spiders and light-splitting switches. Discret. Math. 285(1-3): 83-95 (2004) - [c14]Gennaro Cordasco
Non-uniform deterministic routing on F-Chord(α). HOT-P2P 2004: 16-21 - [c13]Luisa Gargano, Mikael Hammar, Anna Pagh:
Limiting Flooding Expenses in On-demand Source-Initiated Protocols for Mobile Wireless Networks. IPDPS 2004 - [c12]Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vittorio Scarano:
Brief announcement: degree: optimal deterministic routing for P2P systems. PODC 2004: 395 - [c11]Gennaro Cordasco, Luisa Gargano
F-Chord: Improved Uniform Routing on Chord: (Extended Abstract). SIROCCO 2004: 89-98 - [c10]Rosario De Chiara, Mikael Hammar, Vittorio Scarano
A System for Virtual Directories Using Euler Diagrams. Euler 2004: 33-53 - 2003
- [j6]Mark de Berg, Joachim Gudmundsson
On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) - [c9]Mikael Hammar, Bengt J. Nilsson, Mia Persson:
Competitive Exploration of Rectilinear Polygons. FCT 2003: 234-245 - [c8]Luisa Gargano
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). ICALP 2003: 802-816 - 2002
- [j5]Joachim Gudmundsson
Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002) - [j4]Mikael Hammar, Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP. Discret. Comput. Geom. 27(4): 635-651 (2002) - [j3]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28(3): 291-312 (2002) - [j2]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Improved Exploration of Rectilinear Polygons. Nord. J. Comput. 9(1): 32-53 (2002) - 2001
- [b1]Mikael Hammar:
From Art Galleries to Terrain Modelling - A Meandering Path through Computational Geometry. Lund University, Sweden, 2001 - [j1]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel searching on m rays. Comput. Geom. 18(3): 125-139 (2001) - [c7]Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
Guarding lines and 2-link polygons is apx-hard. CCCG 2001: 45-48 - [c6]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. SCG 2001: 124-133 - 2000
- [c5]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - [c4]Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld:
Higher Order Delaunay Triangulations. ESA 2000: 232-243
1990 – 1999
- 1999
- [c3]Mikael Hammar, Bengt J. Nilsson:
Approximation Results for Kinetic Variants of TSP. ICALP 1999: 392-401 - [c2]Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel Searching on m Rays. STACS 1999: 132-142 - 1997
- [c1]Mikael Hammar, Bengt J. Nilsson:
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. FCT 1997: 210-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: