Klaus Jansen

5.4k total citations
158 papers, 2.0k citations indexed

About

Klaus Jansen is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Klaus Jansen has authored 158 papers receiving a total of 2.0k indexed citations (citations by other indexed papers that have themselves been cited), including 99 papers in Industrial and Manufacturing Engineering, 79 papers in Computer Networks and Communications and 45 papers in Computational Theory and Mathematics. Recurrent topics in Klaus Jansen's work include Optimization and Packing Problems (73 papers), Optimization and Search Problems (66 papers) and Scheduling and Optimization Algorithms (57 papers). Klaus Jansen is often cited by papers focused on Optimization and Packing Problems (73 papers), Optimization and Search Problems (66 papers) and Scheduling and Optimization Algorithms (57 papers). Klaus Jansen collaborates with scholars based in Germany, Switzerland and Canada. Klaus Jansen's co-authors include Thomas Erlebach, Roberto Solis-Oba, Lorant Porkolab, Hans L. Bodlaender, Monaldo Mastrolilli, Guochuan Zhang, Gerhard J. Woeginger, Andrea Roli, Hu Zhang and Sabine R. Öhring and has published in prestigious journals such as European Journal of Operational Research, Emerging infectious diseases and Mathematical Programming.

In The Last Decade

Klaus Jansen

148 papers receiving 1.9k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Klaus Jansen Germany 25 1.0k 922 663 278 277 158 2.0k
Clyde Monma United States 25 866 0.9× 816 0.9× 952 1.4× 436 1.6× 179 0.6× 43 2.1k
D. S. Johnson United States 8 594 0.6× 744 0.8× 588 0.9× 226 0.8× 211 0.8× 11 1.7k
Guy Kortsarz United States 25 269 0.3× 1.1k 1.2× 1.1k 1.7× 258 0.9× 186 0.7× 111 1.9k
Yair Bartal Israel 24 303 0.3× 1.2k 1.3× 728 1.1× 121 0.4× 182 0.7× 74 1.9k
Reuven Bar-Yehuda Israel 23 253 0.2× 1.2k 1.3× 757 1.1× 290 1.0× 294 1.1× 58 1.9k
George S. Lueker United States 18 531 0.5× 863 0.9× 1.4k 2.1× 255 0.9× 472 1.7× 41 2.6k
Giorgio Ausiello Italy 18 349 0.3× 718 0.8× 733 1.1× 124 0.4× 128 0.5× 68 1.7k
Serge Plotkin United States 29 452 0.4× 2.3k 2.5× 1.5k 2.3× 574 2.1× 242 0.9× 69 3.3k
Jiřı́ Sgall Czechia 23 605 0.6× 863 0.9× 450 0.7× 133 0.5× 37 0.1× 86 1.6k
Piotr Berman United States 25 205 0.2× 1.2k 1.3× 860 1.3× 470 1.7× 188 0.7× 110 2.2k

Countries citing papers authored by Klaus Jansen

Since Specialization
Citations

This map shows the geographic impact of Klaus Jansen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Klaus Jansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Jansen more than expected).

Fields of papers citing papers by Klaus Jansen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klaus Jansen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Klaus Jansen. The network helps show where Klaus Jansen may publish in the future.

Co-authorship network of co-authors of Klaus Jansen

This figure shows the co-authorship network connecting the top 25 collaborators of Klaus Jansen. A scholar is included among the top collaborators of Klaus Jansen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Klaus Jansen. Klaus Jansen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Fernau, Henning & Klaus Jansen. (2023). Fundamentals of Computation Theory. Lecture notes in computer science.
2.
Jansen, Klaus, et al.. (2021). Peak Demand Minimization via Sliced Strip Packing. ArXiv.org. 1 indexed citations
3.
Grandoni, Fabrizio, et al.. (2020). A Tight (3/2+ε) Approximation for Skewed Strip Packing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
4.
Jansen, Klaus, et al.. (2019). Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory of Computing Systems. 64(1). 120–140. 10 indexed citations
5.
Jansen, Klaus, et al.. (2017). About the structure of the integer cone and its application to bin packing. arXiv (Cornell University). 1571–1581. 2 indexed citations
6.
Jansen, Klaus, et al.. (2013). New approximability results for two-dimensional bin packing. Symposium on Discrete Algorithms. 919–936. 3 indexed citations
7.
Jansen, Klaus, et al.. (2012). A (5/3 + eps)-Approximation for 2D Strip Packing.. 139–142. 1 indexed citations
8.
Jansen, Klaus, et al.. (2011). Faster approximation algorithms for scheduling with fixed jobs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 119. 3–10. 1 indexed citations
9.
Jansen, Klaus. (2009). Parameterized approximation scheme for the multiple knapsack problem. Symposium on Discrete Algorithms. 665–674. 11 indexed citations
10.
Fishkin, Aleksei V., et al.. (2008). On Packing Rectangles with Resource Augmentation: Maximizing the Profit. 3(1). 2 indexed citations
11.
Czumaj, Artur, Klaus Jansen, Friedhelm Meyer auf der Heide, & Ingo Schiermeyer. (2006). Algorithmic Graph Theory. Oberwolfach Reports. 3(1). 379–460. 7 indexed citations
12.
Jansen, Klaus & Roberto Solis-Oba. (2006). An asymptotic approximation algorithm for 3D-strip packing. Symposium on Discrete Algorithms. 143–152. 13 indexed citations
13.
Dı́az, Josep, Klaus Jansen, Andrea Roli, & Uri Zwick. (2006). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial ... (Lecture Notes in Computer Science). Springer eBooks. 1 indexed citations
14.
15.
Jansen, Klaus & Guochuan Zhang. (2004). On rectangle packing: maximizing benefits. Symposium on Discrete Algorithms. 204–213. 34 indexed citations
16.
Erlebach, Thomas, et al.. (2001). Polynomial-time approximation schemes for geometric graphs. Symposium on Discrete Algorithms. 671–679. 58 indexed citations
17.
18.
Jansen, Klaus & Lorant Porkolab. (1999). Linear-time approximation schemes for scheduling malleable parallel tasks. Max Planck Institute for Plasma Physics. 490–498. 23 indexed citations
19.
Solis-Oba, Roberto, Klaus Jansen, & Maxim Sviridenko. (1999). A linear time approximation scheme for the job shop scheduling problem. Max Planck Institute for Plasma Physics. 177–188. 8 indexed citations
20.
Bodlaender, Hans L., Klaus Jansen, Ton Kloks, et al.. (1994). Ranking of Graphs. 292–304. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Clyde Monma Breakdown of academic impact, for papers by D. S. Johnson Breakdown of academic impact, for papers by Guy Kortsarz Breakdown of academic impact, for papers by Yair Bartal Breakdown of academic impact, for papers by Reuven Bar-Yehuda Breakdown of academic impact, for papers by George S. Lueker Breakdown of academic impact, for papers by Giorgio Ausiello Breakdown of academic impact, for papers by Serge Plotkin Breakdown of academic impact, for papers by Jiřı́ Sgall Breakdown of academic impact, for papers by Piotr Berman
Rankless by CCL
2026