RESEARCHER PROFILE
Klaus Jansen
← Back to Christian-Albrechts-Universität zu Kiel
K
Christian-Albrechts-Universität zu Kiel
Klaus Jansen works in Complexity and Algorithms in Graphs, Scheduling and Optimization Algorithms, Advanced Graph Theory Research, Optimization and Packing Problems, Optimization and Search Problems. Recorded institutional associations include Christian-Albrechts-Universität zu Kiel.
417Publications
5,730Citations
42H-index
Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.
Selected research works
Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
2005 · 174 citationsExperimental and Efficient Algorithms
2003 · 162 citationsRankings of Graphs
1998 · 141 citationsPolynomial-time approximation schemes for geometric graphs
2001 · 118 citationsApproximation Algorithms for Combinatorial Optimization
2000 · 109 citationsGeneralized coloring for tree-like graphs
1997 · 108 citationsThe complexity of path coloring and call scheduling
2001 · 102 citationsAn Approximation Scheme for Bin Packing with Conflicts
1999 · 99 citationsBin packing with fixed number of bins revisited
2012 · 99 citationsScheduling with incompatible jobs
1994 · 88 citationsApproximation Algorithms for Time Constrained Scheduling
1997 · 88 citationsOn the complexity of the maximum cut problem
1994 · 80 citationsAn EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
2010 · 76 citationsRestrictions of graph partition problems. Part I
1995 · 74 citationsImproved approximation schemes for scheduling unrelated parallel machines
1999 · 74 citationsThe mutual exclusion scheduling problem for permutation and comparability graphs
1998 · 70 citationsScheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme
2004 · 69 citationsOptimal wavelength routing on directed fiber trees
1999 · 64 citationsClosing the Gap for Makespan Scheduling via Sparsification Techniques
2020 · 63 citationsImproved Approximation Schemes for Scheduling Unrelated Parallel Machines
2001 · 62 citationsOn the complexity of scheduling incompatible jobs with unit-times
1993 · 61 citationsOn rectangle packing: maximizing benefits
2004 · 60 citationsApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009 · 59 citationsA (5/3+ε) -approximation for strip packing
2013 · 58 citationsApproximation schemes for job shop scheduling problems with controllable processing times
2004 · 57 citations
