| Polynomial-time approximation schemes for geometric intersection graphs T Erlebach, K Jansen, E Seidel SIAM Journal on Computing 34 (6), 1302-1323, 2005 | 359 | 2005 |
| Rankings of graphs HL Bodlaender, JS Deogun, K Jansen, T Kloks, D Kratsch, H Müller, ... SIAM Journal on Discrete Mathematics 11 (1), 168-181, 1998 | 239* | 1998 |
| Improved approximation schemes for scheduling unrelated parallel machines K Jansen, L Porkolab Proceedings of the thirty-first annual ACM Symposium on Theory of Computing …, 1999 | 193 | 1999 |
| Linear-time approximation schemes for scheduling malleable parallel tasks Jansen, Porkolab Algorithmica 32, 507-520, 2002 | 169 | 2002 |
| Generalized coloring for tree-like graphs K Jansen, P Scheffler Discrete Applied Mathematics 75 (2), 135-155, 1997 | 141 | 1997 |
| The complexity of path coloring and call scheduling T Erlebach, K Jansen Theoretical Computer Science 255 (1-2), 33-50, 2001 | 140 | 2001 |
| Time-and angle-resolved photoemission spectroscopy with optimized high-harmonic pulses using frequency-doubled Ti: Sapphire lasers S Eich, A Stange, AV Carr, J Urbancic, T Popmintchev, M Wiesenmayer, ... Journal of Electron Spectroscopy and Related Phenomena 195, 231-236, 2014 | 138 | 2014 |
| An approximation scheme for bin packing with conflicts K Jansen Journal of combinatorial optimization 3 (4), 363-377, 1999 | 138 | 1999 |
| On the complexity of the maximum cut problem HL Bodlaender, K Jansen Nordic Journal of Computing 7 (1), 14-31, 2000 | 136* | 2000 |
| Scheduling with incompatible jobs HL Bodlaender, K Jansen, GJ Woeginger Discrete Applied Mathematics 55 (3), 219-232, 1994 | 132 | 1994 |
| Bin packing with fixed number of bins revisited K Jansen, S Kratsch, D Marx, I Schlotter Journal of Computer and System Sciences 79 (1), 39-49, 2013 | 128 | 2013 |
| Scheduling of virtual connections in fast networks T Erlebach, K Jansen Proceedings of 4th Workshop on Parallel Systems and Algorithms (PASA’96), 13-32, 1996 | 123 | 1996 |
| Approximation algorithms for time constrained scheduling K Jansen, S Öhring Information and computation 132 (2), 85-108, 1997 | 116 | 1997 |
| On rectangle packing: maximizing benefits. K Jansen, G Zhang SODA 4, 204-213, 2004 | 109 | 2004 |
| Restrictions of graph partition problems. Part I HL Bodlaender, K Jansen Theoretical Computer Science 148 (1), 93-109, 1995 | 108 | 1995 |
| An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables K Jansen SIAM Journal on Discrete Mathematics 24 (2), 457-485, 2010 | 103 | 2010 |
| Call scheduling in trees, rings and meshes T Erlebach, K Jansen Proceedings of the thirtieth Hawaii International Conference on System …, 1997 | 101 | 1997 |
| On integer programming, discrepancy, and convolution K Jansen, L Rohwedder arXiv preprint arXiv:1803.04744, 2018 | 96* | 2018 |
| A (5/3+ ε)-approximation for strip packing R Harren, K Jansen, L Prädel, R Van Stee Computational Geometry 47 (2), 248-267, 2014 | 94 | 2014 |
| Optimal wavelength routing on directed fiber trees T Erlebach, K Jansen, C Kaklamanis, M Mihail, P Persiano Theoretical Computer Science 221 (1-2), 119-137, 1999 | 93 | 1999 |
Kim-Manuel KleinUniversität KielVerified email at informatik.uni-kiel.de
