default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Lie Hetland
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Halvard Hummel
, Magnus Lie Hetland:
Fair allocation of conflicting items. Auton. Agents Multi Agent Syst. 36(1): 8 (2022)- [c17]Halvard Hummel, Magnus Lie Hetland:
Guaranteeing Half-Maximin Shares Under Cardinality Constraints. AAMAS 2022: 1633-1635 - [c16]Halvard Hummel, Magnus Lie Hetland:
Maximin Shares Under Cardinality Constraints. EUMAS 2022: 188-206 - 2021
- [c15]Magnus Lie Hetland, Halvard Hummel:
Fairest Neighbors - Tradeoffs Between Metric Queries. SISAP 2021: 148-156 - [i9]Halvard Hummel, Magnus Lie Hetland:
Fair Allocation of Conflicting Items. CoRR abs/2104.06280 (2021) - [i8]Halvard Hummel, Magnus Lie Hetland:
Guaranteeing Half-Maximin Shares Under Cardinality Constraints. CoRR abs/2106.07300 (2021) - [i7]Magnus Lie Hetland, Halvard Hummel:
Fairest Neighbors: Tradeoffs Between Metric Queries. CoRR abs/2108.03621 (2021) - 2020
- [c14]Magnus Lie Hetland:
Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem. SISAP 2020: 111-125 - [c13]Magnus Lie Hetland:
Metrics and Ambits and Sprawls, Oh My - Another Tutorial on Metric Indexing. SISAP 2020: 126-139 - [i6]Magnus Lie Hetland:
Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem. CoRR abs/2008.09607 (2020) - [i5]Magnus Lie Hetland:
Metrics and Ambits and Sprawls, Oh My. CoRR abs/2008.09654 (2020)
2010 – 2019
- 2019
- [i4]Magnus Lie Hetland:
Comparison-Based Indexing From First Principles. CoRR abs/1908.06318 (2019) - 2015
- [j7]Magnus Lie Hetland:
Ptolemaic indexing. J. Comput. Geom. 6(1): 165-184 (2015) - 2014
- [j6]Bilegsaikhan Naidan, Magnus Lie Hetland:
Static-to-dynamic transformation for metric indexing structures (extended version). Inf. Syst. 45: 48-60 (2014) - [i3]Magnus Lie Hetland, Ola Martin Lykkja:
A Real-Time Spatial Index for In-Vehicle Units. CoRR abs/1408.0114 (2014) - 2013
- [j5]Magnus Lie Hetland, Tomás Skopal, Jakub Lokoc, Christian Beecks:
Ptolemaic access methods: Challenging the reign of the metric space model. Inf. Syst. 38(7): 989-1006 (2013) - [c12]Magnus Lie Hetland:
Simulating Ability: Representing Skills in Games. SGDA 2013: 226-238 - [i2]Magnus Lie Hetland:
Simulating Ability: Representing Skills in Games. CoRR abs/1307.0201 (2013) - 2012
- [j4]Bilegsaikhan Naidan, Magnus Lie Hetland:
Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search. Int. J. Multim. Data Eng. Manag. 3(4): 75-87 (2012) - [j3]Svein Erik Bratsberg, Magnus Lie Hetland:
Dynamic optimization of queries in pivot-based indexing. Multim. Tools Appl. 60(2): 261-275 (2012) - [c11]Bilegsaikhan Naidan, Magnus Lie Hetland:
Static-to-Dynamic Transformation for Metric Indexing Structures. SISAP 2012: 101-115 - 2011
- [c10]Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland:
The Maximum Flow Problem with Minimum Lot Sizes. ICCL 2011: 170-182 - [c9]Mujahed Eleyat, Dag Haugland, Magnus Lie Hetland, Lasse Natvig:
Parallel algorithms for the maximum flow problem with minimum lot sizes. OR 2011: 83-88 - [c8]Jakub Lokoc, Magnus Lie Hetland, Tomás Skopal, Christian Beecks:
Ptolemaic indexing of the signature quadratic form distance. SISAP 2011: 9-16 - [c7]Bilegsaikhan Naidan, Magnus Lie Hetland, Ole Edsberg:
Approximate similarity search using samples. SISAP 2011: 123-124 - 2010
- [j2]Nils Grimsmo, Truls Amundsen Bjørklund, Magnus Lie Hetland:
Fast Optimal Twig Joins. Proc. VLDB Endow. 3(1): 894-905 (2010) - [c6]Ole Edsberg, Magnus Lie Hetland:
Indexing inexact proximity search with distance regression in pivot space. SISAP 2010: 51-58 - [c5]Nils Grimsmo, Truls Amundsen Bjørklund, Magnus Lie Hetland:
Linear Computation of the Maximum Simultaneous Forward and Backward Bisimulation for Node-Labeled Trees. XSym 2010: 18-32
2000 – 2009
- 2009
- [i1]Magnus Lie Hetland:
Ptolemaic Indexing. CoRR abs/0911.4384 (2009) - 2005
- [j1]Magnus Lie Hetland, Pål Sætrom:
Evolutionary Rule Mining in Time Series Databases. Mach. Learn. 58(2-3): 107-125 (2005) - 2003
- [c4]Amund Tveit, Magnus Lie Hetland, Håavard Engum:
Incremental and Decremental Proximal Support Vector Classification using Decay Coefficients. DaWaK 2003: 422-423 - [c3]Pål Sætrom, Magnus Lie Hetland:
Mining Interesting Temporal Rules with Genetic Programming and Specialized Hardware. ICMLA 2003: 145-151 - [c2]Amund Tveit, Magnus Lie Hetland:
Multicategory Incremental Proximal Support Vector Classifiers. KES 2003: 386-392 - [c1]Magnus Lie Hetland, Pål Sætrom:
The Role of Discretization Parameters in Sequence Rule Evolution. KES 2003: 518-525
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:59 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:
