Martin Olsen

Orcid: 0000-0002-2740-545X

According to our database1, Martin Olsen authored at least 42 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An asymptotically optimal algorithm for online stacking.
Math. Methods Oper. Res., April, 2023

Removing Unwanted Text from Architectural Images with Multi-Scale Deformable Attention-Based Machine Learning.
Proceedings of the IEEE International Conference on Imaging Systems and Techniques, 2023

2022
Oblivious Stacking and MAX k-CUT for Circle Graphs.
Proceedings of the Computational Logistics - 13th International Conference, 2022

2021
Generalised online colouring problems in overlap graphs.
Theor. Comput. Sci., 2021

Distance Hedonic Games.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020
Maker Buoy Variants for Water Level Monitoring and Tracking Drifting Objects in Remote Areas of Greenland.
Sensors, 2020

An Asymptotically Optimal Algorithm for Online Stacking.
CoRR, 2020

Online Stacking Using RL with Positional and Tactical Features.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
Fractional Hedonic Games.
ACM Trans. Economics and Comput., 2019

Coverage Centrality Maximization in Undirected Networks.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A Note on Online Colouring Problems in Overlap Graphs and Their Complements.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles.
Proceedings of the Computational Logistics - 9th International Conference, 2018

Miniature Robotic Drilling Rig for Research and Education in Drilling Automation.
Proceedings of the IEEE Conference on Control Technology and Applications, 2018

2017
On Covering Codes and Upper Bounds for the Dimension of Simple Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
On the complexity of exchanging.
Inf. Process. Lett., 2016

Dimension and codimension of simple games.
Electron. Notes Discret. Math., 2016

Towards Asymptotically Optimal One-to-One PDP Algorithms for Capacity 2+ Vehicles.
CoRR, 2016

Time domain acoustic contrast control implementation of sound zones for low-frequency input signals.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

On the Construction of High-Dimensional Simple Games.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Probabilistic Analysis of Online Stacking Algorithms.
Proceedings of the Computational Logistics - 6th International Conference, 2015

2014
On the approximability of the link building problem.
Theor. Comput. Sci., 2014

Shared Resources in Service Systems.
Proceedings of the 8th Mediterranean Conference on Information Systems, 2014

We All Know How, Don't We? On the Role of Scrum in IT-Offshoring.
Proceedings of the Creating Value for All Through IT, 2014

Average Case Analysis of Blocks Relocation Heuristics.
Proceedings of the Computational Logistics - 5th International Conference, 2014

2013
A general view on computing communities.
Math. Soc. Sci., 2013

On Alliance Partitions and Bisection Width for Planar Graphs.
J. Graph Algorithms Appl., 2013

Alliances and Bisection Width for Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

On the Complexity of Computing Optimal Private Park-and-Ride Plans.
Proceedings of the Computational Logistics - 4th International Conference, 2013

2012
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities.
Inf. Process. Lett., 2012

An approximation algorithm for the link building problem
CoRR, 2012

On Defining and Computing Communities.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
On the complexity of problems on simple games.
RAIRO Oper. Res., 2011

2010
A Constant-Factor Approximation Algorithm for the Link Building Problem.
Proceedings of the Combinatorial Optimization and Applications, 2010

Maximizing PageRank with New Backlinks.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Nash Stability in Additively Separable Hedonic Games and Community Structures.
Theory Comput. Syst., 2009

2008
The Complexity of Testing Properties of Simple Games
CoRR, 2008

The Computational Complexity of Link Building.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Nash Stability in Additively Separable Hedonic Games Is NP-Hard.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Communities in Large Networks: Identification and Ranking.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Formalising Business Process Execution with Bigraphs and Reactive XML.
Proceedings of the Coordination Models and Languages, 8th International Conference, 2006

2005
Distributed Reactive XML.
Proceedings of the First International Workshop on Methods and Tools for Coordinating Concurrent, 2005

2000
Annotating Communication Problems Using the MATE Workbench.
Proceedings of the Second International Conference on Language Resources and Evaluation, 2000


  Loading...