RESEARCHER PROFILE

Klaus Jansen

← Back to Christian-Albrechts-Universität zu Kiel

K

Christian-Albrechts-Universität zu Kiel

Complexity and Algorithms in GraphsScheduling and Optimization AlgorithmsAdvanced Graph Theory ResearchOptimization and Packing ProblemsOptimization and Search Problems

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.

  1. Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

    2005 · 174 citations
  2. Experimental and Efficient Algorithms

    2003 · 162 citations
  3. Rankings of Graphs

    1998 · 141 citations
  4. Polynomial-time approximation schemes for geometric graphs

    2001 · 118 citations
  5. Approximation Algorithms for Combinatorial Optimization

    2000 · 109 citations
  6. Generalized coloring for tree-like graphs

    1997 · 108 citations
  7. The complexity of path coloring and call scheduling

    2001 · 102 citations
  8. An Approximation Scheme for Bin Packing with Conflicts

    1999 · 99 citations
  9. Bin packing with fixed number of bins revisited

    2012 · 99 citations
  10. Scheduling with incompatible jobs

    1994 · 88 citations
  11. Approximation Algorithms for Time Constrained Scheduling

    1997 · 88 citations
  12. On the complexity of the maximum cut problem

    1994 · 80 citations
  13. An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

    2010 · 76 citations
  14. Restrictions of graph partition problems. Part I

    1995 · 74 citations
  15. Improved approximation schemes for scheduling unrelated parallel machines

    1999 · 74 citations
  16. The mutual exclusion scheduling problem for permutation and comparability graphs

    1998 · 70 citations
  17. Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

    2004 · 69 citations
  18. Optimal wavelength routing on directed fiber trees

    1999 · 64 citations
  19. Closing the Gap for Makespan Scheduling via Sparsification Techniques

    2020 · 63 citations
  20. Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

    2001 · 62 citations
  21. On the complexity of scheduling incompatible jobs with unit-times

    1993 · 61 citations
  22. On rectangle packing: maximizing benefits

    2004 · 60 citations
  23. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

    2009 · 59 citations
  24. A (5/3+ε) -approximation for strip packing

    2013 · 58 citations
  25. Approximation schemes for job shop scheduling problems with controllable processing times

    2004 · 57 citations

← Return to the university profile