George Steiner

4.6k total citations · 1 hit paper
150 papers, 3.1k citations indexed

About

George Steiner is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, George Steiner has authored 150 papers receiving a total of 3.1k indexed citations (citations by other indexed papers that have themselves been cited), including 71 papers in Industrial and Manufacturing Engineering, 48 papers in Computer Networks and Communications and 23 papers in Computational Theory and Mathematics. Recurrent topics in George Steiner's work include Scheduling and Optimization Algorithms (68 papers), Optimization and Search Problems (43 papers) and Advanced Manufacturing and Logistics Optimization (33 papers). George Steiner is often cited by papers focused on Scheduling and Optimization Algorithms (68 papers), Optimization and Search Problems (43 papers) and Advanced Manufacturing and Logistics Optimization (33 papers). George Steiner collaborates with scholars based in Canada, United States and Israel. George Steiner's co-authors include Dvir Shabtay, John F. Steiner, Gary F. Lewis, Rui Zhang, Jitender S. Deogun, Julian Scott Yeomans, André C. Carpentier, Stavros G. Kolliopoulos, P. Hugh R. Barrett and Jeffrey S. Cohn and has published in prestigious journals such as Circulation, Journal of Clinical Investigation and Academy of Management Journal.

In The Last Decade

George Steiner

136 papers receiving 2.8k citations

Hit Papers

A survey of scheduling with controllable processing times 2007 2026 2013 2019 2007 100 200 300

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
George Steiner Canada 29 1.6k 709 319 305 302 150 3.1k
G. Anthony Gorry United States 24 54 0.0× 156 0.2× 116 0.4× 80 0.3× 174 0.6× 61 2.2k
Huei Lee Taiwan 31 183 0.1× 61 0.1× 213 0.7× 34 0.1× 189 0.6× 121 3.0k
Ou Liu China 27 249 0.2× 134 0.2× 118 0.4× 12 0.0× 127 0.4× 87 2.1k
Wei Tan United States 31 178 0.1× 1.5k 2.1× 32 0.1× 25 0.1× 333 1.1× 102 3.0k
Roger H.L. Chiang United States 16 92 0.1× 248 0.3× 391 1.2× 86 0.3× 1.0k 3.4× 51 2.2k
Chun Ouyang Australia 20 362 0.2× 277 0.4× 77 0.2× 10 0.0× 1.6k 5.2× 77 2.7k
William S. Lovejoy United States 22 185 0.1× 237 0.3× 452 1.4× 4 0.0× 842 2.8× 50 2.1k
Sunju Park South Korea 25 149 0.1× 138 0.2× 49 0.2× 30 0.1× 91 0.3× 180 2.1k
David M. Dilts United States 26 365 0.2× 63 0.1× 632 2.0× 7 0.0× 442 1.5× 78 2.9k
Xudong Lü China 25 111 0.1× 125 0.2× 17 0.1× 15 0.0× 334 1.1× 155 2.1k

Countries citing papers authored by George Steiner

Since Specialization
Citations

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

Fields of papers citing papers by George Steiner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of George Steiner

This figure shows the co-authorship network connecting the top 25 collaborators of George Steiner. A scholar is included among the top collaborators of George Steiner 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 George Steiner. George Steiner 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.
Shabtay, Dvir, George Steiner, & Liron Yedidsion. (2013). A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discrete Applied Mathematics. 182. 115–121. 3 indexed citations
2.
Dror, Moshe & George Steiner. (2010). ‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders. Discrete Applied Mathematics. 158(16). 1767–1776. 1 indexed citations
3.
Oron, Daniel, et al.. (2009). The bipartite margin shop and maximum red matchings free of blue–red alternating cycles. Discrete Optimization. 6(3). 299–309. 2 indexed citations
4.
Shabtay, Dvir, Moshe Kaspi, & George Steiner. (2007). The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times. IIE Transactions. 39(5). 539–557. 27 indexed citations
5.
Shabtay, Dvir & George Steiner. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics. 155(13). 1643–1666. 322 indexed citations breakdown →
6.
Steiner, George, et al.. (2006). Partioning A Bipartite Graph into Vertex-Disjoint Paths.. Ars Combinatoria. 81. 2 indexed citations
7.
Kolliopoulos, Stavros G. & George Steiner. (2006). Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theoretical Computer Science. 355(3). 261–273. 22 indexed citations
8.
Steiner, George. (2003). On the k-path partition of graphs. Theoretical Computer Science. 290(3). 2147–2155. 28 indexed citations
9.
Steiner, George. (2001). Treating lipid abnormalities in patients with type 2 diabetes mellitus. The American Journal of Cardiology. 88(12). 37–40. 25 indexed citations
10.
Lamarche, Benoı̂t, Kristine D. Uffelman, André C. Carpentier, et al.. (1999). Triglyceride enrichment of HDL enhances in vivo metabolic clearance of HDL apo A-I in healthy men. Journal of Clinical Investigation. 103(8). 1191–1199. 187 indexed citations
11.
Steiner, George, et al.. (1997). Wartime industrial statistics. UMI Dissertation Services eBooks.
12.
Steiner, George. (1997). Minimizing the number of tardy jobs with precedence constraints and agreeable due dates. Discrete Applied Mathematics. 72(1-2). 167–177. 4 indexed citations
13.
Deogun, Jitender S., Dieter Kratsch, & George Steiner. (1997). 1-Tough cocomparability graphs are hamiltonian. Discrete Mathematics. 170(1-3). 99–106. 23 indexed citations
14.
Steiner, George. (1995). What Is Comparative Literature?: An Inaugural Lecture Delivered Before the University of Oxford on 11 October, 1994. Medical Entomology and Zoology. 7 indexed citations
15.
Steiner, George, et al.. (1994). A bicriterion objective for levelling the schedule of a mixed-model, JIT assembly process. Mathematical and Computer Modelling. 20(2). 123–134. 4 indexed citations
16.
Miltenburg, John, et al.. (1990). A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems. Mathematical and Computer Modelling. 13(3). 57–66. 77 indexed citations
17.
Steiner, George. (1990). The connection between the bump number problem and flow-shop scheduling with precedence constraints. Computers & Mathematics with Applications. 20(11). 13–18.
18.
Steiner, George. (1985). An algorithm for minimizing setups in precedence constrained scheduling. Journal of Computational and Applied Mathematics. 12-13. 579–589. 2 indexed citations
19.
Steiner, George & Martín Heidegger. (1979). Martin Heidegger: With a New Introduction. Medical Entomology and Zoology. 4 indexed citations
20.
Steiner, George. (1960). Tolstoy or Dostoevsky : an essay in contrast. 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