Martin R. Ehmsen

According to our database, Martin R. Ehmsen authored at least 7 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

A Technique for Exact Computation of precoloring Extension on Interval Graphs.

Martin R. Ehmsen, Kim S. Larsen

Int. J. Found. Comput. Sci., 2013

2010

A theoretical comparison of LRU and LRU-K.

Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen

Acta Informatica, 2010

List Factoring and Relative Worst Order Analysis.

Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Better Bounds on Online Unit Clustering.

Martin R. Ehmsen, Kim S. Larsen

Proceedings of the Algorithm Theory, 2010

2009

Parameterized Analysis of Paging and List Update Algorithms.

Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008

Comparing First-Fit and Next-Fit for Online Edge Coloring.

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2006

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.

Joan Boyar, Martin R. Ehmsen, Kim S. Larsen

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006