Martin R. Ehmsen

IMADA > Faculty & Staff > Martin R. Ehmsen

Martin R. Ehmsen
M.Sc., Ph.D. student

Personal home page

E-mail: ehmsen@imada.sdu.dk
Work: Dept. of Mathematics & Computer Science
University of Southern Denmark
Campusvej 55
DK-5230 Odense M
Denmark
Telephone: +45 6550 2346
Fax: +45 6550 2325

A Technique for Exact Computation of Precoloring Extension on Interval Graphs: Martin R. Ehmsen and Kim S. Larsen.
Submitted to Information Processing Letters.
Parameterized Analysis of Paging and List Update Algorithms: Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz.
Submitted to Algorithmica.
A Theoretical Comparison of LRU and LRU-2: Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Submitted to Acta Informatica.
Comparing First-Fit and Next-Fit for Online Edge Coloring: Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, and Rodica Mihai.
In Theoretical Computer Science.
Accepted for publication.

Better Bounds on Online Unit Clustering: Martin R. Ehmsen and Kim S. Larsen.
Submitted to 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010.
Parameterized Analysis of Paging and List Update Algorithms: Reza Dorrigiv, Martin R. Ehmsen, and Alejandro López-Ortiz.
In Proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009.
Accepted for publication.
Comparing First-Fit and Next-Fit for Online Edge Coloring: Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, and Rodica Mihai.
In The 19th International Symposium on Algorithms and Computation, volume 5369 of Lecture Notes in Computer Science, pages 89-99. Springer-Verlag, 2008
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem: Joan Boyar, Martin R. Ehmsen, and Kim S. Larsen.
In Fourth Workshop on Approximation and Online Algorithms, volume 4368 of Lecture Notes in Computer Science, pages 95-107. Springer-Verlag, 2006.