default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Olsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Martin Olsen
, Lars Nørvang Andersen, Allan Gross:
An asymptotically optimal algorithm for online stacking. Math. Methods Oper. Res. 97(2): 161-178 (2023)- [c27]Michael Lystbæk, Archontis Giannakidis, Michail J. Beliatis, Martin Olsen:
Removing Unwanted Text from Architectural Images with Multi-Scale Deformable Attention-Based Machine Learning. IST 2023: 1-5 - 2022
- [c26]Martin Olsen:
Oblivious Stacking and MAX k-CUT for Circle Graphs. ICCL 2022: 322-335 - 2021
- [j11]Marc Demange, Martin Olsen:
Generalised online colouring problems in overlap graphs. Theor. Comput. Sci. 877: 58-73 (2021) - [c25]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. SOFSEM 2021: 159-174 - [i11]Martin Olsen:
Oblivious Stacking and MAX k-CUT for Circle Graphs. CoRR abs/2106.02113 (2021) - 2020
- [j10]Daniel F. Carlson, Wayne J. Pavalko, Dorthe Petersen, Martin Olsen, Andreas E. Hass:
Maker Buoy Variants for Water Level Monitoring and Tracking Drifting Objects in Remote Areas of Greenland. Sensors 20(5): 1254 (2020) - [c24]Michele Flammini, Bojana Kodric, Martin Olsen, Giovanna Varricchio:
Distance Hedonic Games. AAMAS 2020: 1846-1848 - [c23]Martin Olsen:
Online Stacking Using RL with Positional and Tactical Features. LION 2020: 184-194 - [i10]Martin Olsen, Allan Gross:
An Asymptotically Optimal Algorithm for Online Stacking. CoRR abs/2006.05740 (2020)
2010 – 2019
- 2019
- [j9]Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters:
Fractional Hedonic Games. ACM Trans. Economics and Comput. 7(2): 6:1-6:29 (2019) - [c22]Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini:
Coverage Centrality Maximization in Undirected Networks. AAAI 2019: 501-508 - 2018
- [c21]Runa Linn Egeland, Astrid Lescoeur, Martin Olsen, Mayuran Vasantharajan, Sigve Hovda, Alexey Pavlov:
Miniature Robotic Drilling Rig for Research and Education in Drilling Automation. CCTA 2018: 736-741 - [c20]Lars Nørvang Andersen, Martin Olsen:
Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles. ICCL 2018: 268-278 - [c19]Marc Demange, Martin Olsen:
A Note on Online Colouring Problems in Overlap Graphs and Their Complements. WALCOM 2018: 144-155 - [i9]Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini:
Coverage Centrality Maximization in Undirected Networks. CoRR abs/1811.04331 (2018) - 2017
- [c18]Martin Olsen:
On Covering Codes and Upper Bounds for the Dimension of Simple Games. AAAI 2017: 629-634 - [i8]Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters:
Fractional Hedonic Games. CoRR abs/1705.10116 (2017) - 2016
- [j8]Sascha Kurz, Xavier Molinero, Martin Olsen, Maria José Serna Iglesias:
Dimension and codimension of simple games. Electron. Notes Discret. Math. 55: 147-150 (2016) - [j7]Xavier Molinero, Martin Olsen, Maria J. Serna:
On the complexity of exchanging. Inf. Process. Lett. 116(6): 437-441 (2016) - [c17]Martin Olsen, Sascha Kurz, Xavier Molinero:
On the Construction of High-Dimensional Simple Games. ECAI 2016: 880-885 - [c16]Daan H. M. Schellekens, Martin Bo Møller, Martin Olsen:
Time domain acoustic contrast control implementation of sound zones for low-frequency input signals. ICASSP 2016: 365-369 - [i7]Martin Olsen, Sascha Kurz, Xavier Molinero:
On the Construction of High Dimensional Simple Games. CoRR abs/1602.01581 (2016) - [i6]Sascha Kurz, Xavier Molinero, Martin Olsen, Maria J. Serna:
Dimension and codimension of simple games. CoRR abs/1602.04328 (2016) - [i5]Martin Olsen:
On Covering Codes and Upper Bounds for the Dimension of Simple Games. CoRR abs/1609.04960 (2016) - [i4]Martin Olsen:
Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles. CoRR abs/1610.09132 (2016) - 2015
- [c15]Martin Olsen, Allan Gross:
Probabilistic Analysis of Online Stacking Algorithms. ICCL 2015: 358-369 - [i3]Xavier Molinero, Martin Olsen, Maria J. Serna:
On the Complexity of Exchanging. CoRR abs/1503.06052 (2015) - 2014
- [j6]Martin Olsen, Anastasios Viglas:
On the approximability of the link building problem. Theor. Comput. Sci. 518: 96-116 (2014) - [c14]Martin Olsen, Allan Gross:
Average Case Analysis of Blocks Relocation Heuristics. ICCL 2014: 81-92 - [c13]Christian Koch, Claus Jørgensen, Martin Olsen, Torben Tambo:
We All Know How, Don't We? On the Role of Scrum in IT-Offshoring. TDIT 2014: 96-112 - [c12]Lars Bækgaard, Martin Olsen, Torben Tambo:
Shared Resources in Service Systems. MCIS 2014: 1 - 2013
- [j5]Martin Olsen, Morten Revsbæk:
On Alliance Partitions and Bisection Width for Planar Graphs. J. Graph Algorithms Appl. 17(6): 599-614 (2013) - [j4]Martin Olsen:
A general view on computing communities. Math. Soc. Sci. 66(3): 331-336 (2013) - [c11]Martin Olsen:
On the Complexity of Computing Optimal Private Park-and-Ride Plans. ICCL 2013: 73-82 - [c10]Martin Olsen, Morten Revsbæk:
Alliances and Bisection Width for Planar Graphs. WALCOM 2013: 206-216 - 2012
- [j3]Martin Olsen, Lars Bækgaard, Torben Tambo:
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities. Inf. Process. Lett. 112(23): 903-907 (2012) - [c9]Martin Olsen:
On Defining and Computing Communities. CATS 2012: 97-102 - [i2]Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk:
An approximation algorithm for the link building problem. CoRR abs/1204.1369 (2012) - 2011
- [j2]Josep Freixas, Xavier Molinero, Martin Olsen, Maria J. Serna:
On the complexity of problems on simple games. RAIRO Oper. Res. 45(4): 295-314 (2011) - 2010
- [c8]Martin Olsen:
Maximizing PageRank with New Backlinks. CIAC 2010: 37-48 - [c7]Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk:
A Constant-Factor Approximation Algorithm for the Link Building Problem. COCOA (2) 2010: 87-96
2000 – 2009
- 2009
- [j1]Martin Olsen:
Nash Stability in Additively Separable Hedonic Games and Community Structures. Theory Comput. Syst. 45(4): 917-925 (2009) - 2008
- [c6]Martin Olsen:
The Computational Complexity of Link Building. COCOON 2008: 119-129 - [i1]Josep Freixas, Xavier Molinero, Martin Olsen, Maria J. Serna:
The Complexity of Testing Properties of Simple Games. CoRR abs/0803.0404 (2008) - 2007
- [c5]Martin Olsen:
Nash Stability in Additively Separable Hedonic Games Is NP-Hard. CiE 2007: 598-605 - 2006
- [c4]Thomas T. Hildebrandt, Henning Niss, Martin Olsen:
Formalising Business Process Execution with Bigraphs and Reactive XML. COORDINATION 2006: 113-129 - [c3]Martin Olsen:
Communities in Large Networks: Identification and Ranking. WAW 2006: 84-96 - 2005
- [c2]Thomas T. Hildebrandt, Henning Niss, Martin Olsen, Jacob W. Winther:
Distributed Reactive XML. MTCoord@COORDINATION 2005: 61-80 - 2000
- [c1]Laila Dybkjær, Morten Baun Møller, Niels Ole Bernsen, Michael Grosse, Martin Olsen, Amanda Schiffrin:
Annotating Communication Problems Using the MATE Workbench. LREC 2000
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-09-02 21:20 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:
