Guntram Scheithauer

2.2k total citations
67 papers, 1.4k citations indexed

About

Guntram Scheithauer is a scholar working on Industrial and Manufacturing Engineering, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics. According to data from OpenAlex, Guntram Scheithauer has authored 67 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Industrial and Manufacturing Engineering, 29 papers in Computer Graphics and Computer-Aided Design and 7 papers in Computational Theory and Mathematics. Recurrent topics in Guntram Scheithauer's work include Optimization and Packing Problems (55 papers), Advanced Manufacturing and Logistics Optimization (36 papers) and Computational Geometry and Mesh Generation (29 papers). Guntram Scheithauer is often cited by papers focused on Optimization and Packing Problems (55 papers), Advanced Manufacturing and Logistics Optimization (36 papers) and Computational Geometry and Mesh Generation (29 papers). Guntram Scheithauer collaborates with scholars based in Germany, Ukraine and Russia. Guntram Scheithauer's co-authors include Johannes Terno, Gleb Belov, Yu. G. Stoyan, Т. Romanova, Jan Riehme, Andreas Fischer, Julia A. Bennell, José Valério de Carvalho, Alexander Pankratov and Sascha Kurz and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Journal of the Operational Research Society.

In The Last Decade

Guntram Scheithauer

66 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Guntram Scheithauer Germany 23 1.3k 524 78 60 49 67 1.4k
Holger Schumann Germany 5 1.0k 0.8× 398 0.8× 69 0.9× 28 0.5× 24 0.5× 16 1.1k
Cláudio Alves Portugal 16 618 0.5× 101 0.2× 81 1.0× 27 0.5× 27 0.6× 42 686
Shinji Imahori Japan 13 485 0.4× 83 0.2× 98 1.3× 57 0.9× 36 0.7× 44 633
Behrooz Alizadeh Iran 14 213 0.2× 134 0.3× 99 1.3× 144 2.4× 76 1.6× 60 620
Zhenyu Li China 10 135 0.1× 124 0.2× 76 1.0× 51 0.8× 13 0.3× 49 395
Anup Kumar United States 14 314 0.2× 21 0.0× 51 0.7× 30 0.5× 24 0.5× 21 691
Sang C. Park South Korea 13 257 0.2× 33 0.1× 15 0.2× 18 0.3× 75 1.5× 48 468
Zihou Yang China 6 645 0.5× 17 0.0× 48 0.6× 5 0.1× 43 0.9× 9 800
Bartholomew O. Nnaji United States 14 365 0.3× 15 0.0× 57 0.7× 45 0.8× 6 0.1× 30 497
Z.D. Zhou China 11 191 0.1× 35 0.1× 18 0.2× 44 0.7× 2 0.0× 31 367

Countries citing papers authored by Guntram Scheithauer

Since Specialization
Citations

This map shows the geographic impact of Guntram Scheithauer'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 Guntram Scheithauer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guntram Scheithauer more than expected).

Fields of papers citing papers by Guntram Scheithauer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Guntram Scheithauer. 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 Guntram Scheithauer. The network helps show where Guntram Scheithauer may publish in the future.

Co-authorship network of co-authors of Guntram Scheithauer

This figure shows the co-authorship network connecting the top 25 collaborators of Guntram Scheithauer. A scholar is included among the top collaborators of Guntram Scheithauer 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 Guntram Scheithauer. Guntram Scheithauer 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.
Scheithauer, Guntram, et al.. (2018). The skiving stock problem and its relation to hypergraph matchings. Discrete Optimization. 29. 77–102. 3 indexed citations
2.
Scheithauer, Guntram, et al.. (2018). Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 4OR. 17(2). 173–200. 6 indexed citations
3.
Fischer, Andreas, et al.. (2018). An improved flow-based formulation and reduction principles for the minimum connectivity inference problem. Optimization. 68(10). 1963–1983. 1 indexed citations
4.
Scheithauer, Guntram, et al.. (2017). An upper bound of Δ(E)<32 for skiving stock instances of the divisible case. Discrete Applied Mathematics. 229. 161–167. 7 indexed citations
5.
Scheithauer, Guntram. (2017). Introduction to Cutting and Packing Optimization. International series in management science/operations research/International series in operations research & management science. 28 indexed citations
6.
Jorswieck, Eduard A., et al.. (2017). Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wireless Communications Letters. 6(4). 494–497. 15 indexed citations
7.
Scheithauer, Guntram, et al.. (2016). Integer rounding and modified integer rounding for the skiving stock problem. Discrete Optimization. 21. 118–130. 13 indexed citations
8.
Stoyan, Yu. G., Guntram Scheithauer, & Georgiy Yaskov. (2016). Packing Unequal Spheres into Various Containers. Cybernetics and Systems Analysis. 52(3). 419–426. 15 indexed citations
9.
Scheithauer, Guntram, et al.. (2015). Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discrete Applied Mathematics. 187. 120–129. 30 indexed citations
10.
Belov, Gleb, et al.. (2011). Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution. Automation and Remote Control. 72(1). 141–159. 4 indexed citations
11.
Scheithauer, Guntram, Yu. G. Stoyan, & Т. Romanova. (2009). Integer Linear Programming Models for the Problem of Covering a Polygonal Region by Rectangles. 3 indexed citations
12.
Stoyan, Yu. G., et al.. (2004). \(\Phi \)-functions for complex 2D-objects. 2(1). 69–84. 28 indexed citations
13.
Stoyan, Yu. G., et al.. (2002). Phi-functions for primary 2D-objects.. 2. 1–32. 42 indexed citations
14.
Scheithauer, Guntram, et al.. (2002). Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Applied Mathematics. 121(1-3). 229–245. 21 indexed citations
15.
Scheithauer, Guntram, et al.. (2002). Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem. Optimization. 51(6). 927–963. 12 indexed citations
16.
Scheithauer, Guntram. (1997). Equivalence and Dominance for Problems of Optimal Packing of Rectangles. 29 indexed citations
17.
Scheithauer, Guntram & Johannes Terno. (1995). A branch&bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae. 23(2). 151–167. 22 indexed citations
18.
Scheithauer, Guntram. (1994). On the MAXGAP Problem for Cutting Stock Problems.. Journal of automata, languages and combinatorics. 30. 111–117. 2 indexed citations
19.
Scheithauer, Guntram. (1991). A Three-dimensional Bin Packing Algorithm. Journal of automata, languages and combinatorics. 27. 263–271. 17 indexed citations
20.
Scheithauer, Guntram & Johannes Terno. (1982). A new extension principle algorithm for the traveling salesman problem. Mathematische Operationsforschung und Statistik Series Optimization. 13(2). 231–245. 2 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

Rankless by CCL
2026