Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. - Joan Boyar; Martin R. Ehmsen; Kim S. Larsen (WAOA, 2006)

A theoretical comparison of LRU and LRU-K. - Joan Boyar; Martin R. Ehmsen; Jens S. Kohrt; Kim S. Larsen (Acta Informatica, 2010)

Comparing First-Fit and Next-Fit for online edge coloring. - Martin R. Ehmsen; Lene M. Favrholdt; Jens S. Kohrt; Rodica Mihai (Theor. Comput. Sci., 2010)

List Factoring and Relative Worst Order Analysis. - Martin R. Ehmsen; Jens S. Kohrt; Kim S. Larsen (Algorithmica, 2013)

A Technique for Exact Computation of precoloring Extension on Interval Graphs. - Martin R. Ehmsen; Kim S. Larsen (Int. J. Found. Comput. Sci., 2013)

Better bounds on online unit clustering. - Martin R. Ehmsen; Kim S. Larsen (Theor. Comput. Sci., 2013)

Parameterized Analysis of Paging and List Update Algorithms. - Reza Dorrigiv; Martin R. Ehmsen; Alejandro López-Ortiz (Algorithmica, 2015)