| Comparing online algorithms for bin packing problems L Epstein, LM Favrholdt, JS Kohrt Journal of Scheduling 15, 13-21, 2012 | 40 | 2012 |
| The maximum resource bin packing problem J Boyar, L Epstein, LM Favrholdt, JS Kohrt, KS Larsen, MM Pedersen, ... Theoretical Computer Science 362 (1-3), 127-139, 2006 | 36 | 2006 |
| A constant approximation algorithm for sorting buffers JS Kohrt, K Pruhs Latin American Symposium on Theoretical Informatics, 193-202, 2004 | 30 | 2004 |
| Separating online scheduling algorithms with the relative worst order ratio L Epstein, LM Favrholdt, JS Kohrt Journal of Combinatorial Optimization 12, 363-386, 2006 | 19 | 2006 |
| Packet bundling JS Frederiksen, KS Larsen Scandinavian Workshop on Algorithm Theory, 328-337, 2002 | 18 | 2002 |
| A theoretical comparison of LRU and LRU-K J Boyar, MR Ehmsen, JS Kohrt, KS Larsen Acta informatica 47, 359-374, 2010 | 17 | 2010 |
| Dynamic TCP acknowledgment in the LogP model JS Frederiksen, KS Larsen, J Noga, P Uthaisombut Journal of Algorithms 48 (2), 407-428, 2003 | 15 | 2003 |
| List factoring and relative worst order analysis MR Ehmsen, JS Kohrt, KS Larsen Algorithmica 66, 287-309, 2013 | 13 | 2013 |
| The maximum resource bin packing problem J Boyar, L Epstein, LM Favrholdt, JS Kohrt, KS Larsen, MM Pedersen, ... International Symposium on Fundamentals of Computation Theory, 397-408, 2005 | 12 | 2005 |
| Comparing First-Fit and Next-Fit for online edge coloring MR Ehmsen, LM Favrholdt, JS Kohrt, R Mihai Theoretical computer science 411 (16-18), 1734-1741, 2010 | 11 | 2010 |
| Online algorithms under new assumptions JS Kohrt PhD thesis, Department of Mathematics and Computer Science, University of …, 2004 | 10 | 2004 |
| On-line seat reservations via off-line seating arrangements JS Kohrt, KS Larsen International Journal of Foundations of Computer Science 16 (02), 381-397, 2005 | 6 | 2005 |
| The relative worst order ratio applied to scheduling problems L Epstein, LM Favrholdt, JS Kohrt Work in progress, 2004 | 5 | 2004 |
| Online seat reservations via offline seating arrangements JS Frederiksen, KS Larsen Workshop on Algorithms and Data Structures, 174-185, 2003 | 3 | 2003 |
| Approximation Algorithms-The Maximum Resource Bin Packing Problem J Boyar, L Epstein, LM Favrholdt, JS Kohrt, KS Larsen, MM Pedersen, ... Lecture Notes in Computer Science 3623, 397-408, 2005 | | 2005 |
| The Lazy Bin Packing Problem J Boyar, JS Kohrt, KS Larsen, MM Pedersen, S Wøhlk University of Southern Denmark. Department of Mathematics and Computer Science, 2004 | | 2004 |
| Sorting Buffers JS Kohrtl, K Pruhs LATIN...: Theoretical Informatics:... Latin American Symposium: Proceedings, 193, 2004 | | 2004 |
| Packet Bundling KS Larsen, JS Frederiksen Institut for Matematik og Datalogi, Syddansk Universitet, 2002 | | 2002 |
| Two Online Problems Under New Assumptions JS Frederiksen | | 2002 |
