Eyjólfur Ingi Ásgeirsson

Orcid: 0000-0001-6719-0150

Affiliations:
  • Reykjavík University, School of Science and Engineering


According to our database1, Eyjólfur Ingi Ásgeirsson authored at least 20 papers between 2002 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Universal Framework for Wireless Scheduling Problems.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Near-optimal MIP solutions for preference based self-scheduling.
Ann. Oper. Res., 2016

2015
Simulation of Alternative Fuel Markets using Integrated System Dynamics Model of Energy System.
Proceedings of the International Conference on Computational Science, 2015

2014
Measurement Based Interference Models for Wireless Scheduling Algorithms.
CoRR, 2014

Bridging the gap between self schedules and feasible schedules in staff scheduling.
Ann. Oper. Res., 2014

Maximum MIMO Flow in wireless networks under the SINR model.
Proceedings of the 12th International Symposium on Modeling and Optimization in Mobile, 2014

Extending wireless algorithm design to arbitrary environments via metricity.
Proceedings of the 17th ACM International Conference on Modeling, 2014

2012
Wireless Network Stability in the SINR Model.
Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: distributed algorithms for throughput performance in wireless networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Market Penetration of Alternative Fuel Vehicles in Iceland: A Hybrid Modeling Approach.
Proceedings of the Operations Research Proceedings 2012, 2012

A fully distributed algorithm for throughput performance in wireless networks.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011
On a game theoretic approach to capacity maximization in wireless networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Automating a manual production scheduling process at a pharmaceutical company.
Proceedings of the 2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems, 2011

2009
Divide-and-Conquer Approximation Algorithm for Vertex Cover.
SIAM J. Discret. Math., 2009

Bounded-space online bin cover.
J. Sched., 2009

2007
Vertex Cover Approximations on Random Graphs.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2006
Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005
Vertex Cover Approximations: Experiments and Observations.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004
Scheduling an Industrial Production Facility.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Closed On-Line Bin Packing.
Acta Cybern., 2002


  Loading...