Jens S. Kohrt

12 papers B 4Journal 8
YearRankTypeTitle / Venue / Authors
2013 J jnl
List Factoring and Relative Worst Order Analysis.
Algorithmica
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2012 J jnl
Comparing online algorithms for bin packing problems.
J. Sched.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2010 J jnl
A theoretical comparison of LRU and LRU-K.
Acta Informatica
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 J jnl
Comparing First-Fit and Next-Fit for online edge coloring.
Theor. Comput. Sci.
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
2010 J jnl
List Factoring and Relative Worst Order Analysis
CoRR
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2010 B conf
List Factoring and Relative Worst Order Analysis.
WAOA
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
2008 B conf
Comparing First-Fit and Next-Fit for Online Edge Coloring.
ISAAC
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
2006 J jnl
Separating online scheduling algorithms with the relative worst order ratio.
J. Comb. Optim.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
2006 J jnl
The maximum resource bin packing problem.
Theor. Comput. Sci.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2005 J jnl
On-line seat reservations via off-line seating arrangements.
Int. J. Found. Comput. Sci.
Jens S. Kohrt, Kim S. Larsen
2005 B conf
The Maximum Resource Bin Packing Problem.
FCT
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk
2004 B conf
A Constant Approximation Algorithm for Sorting Buffers.
LATIN
Jens S. Kohrt, Kirk Pruhs