Stuart M. Harwood

516 total citations
18 papers, 345 citations indexed

About

Stuart M. Harwood is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Control and Systems Engineering. According to data from OpenAlex, Stuart M. Harwood has authored 18 papers receiving a total of 345 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 7 papers in Numerical Analysis and 6 papers in Control and Systems Engineering. Recurrent topics in Stuart M. Harwood's work include Quantum Computing Algorithms and Architecture (6 papers), Advanced Optimization Algorithms Research (5 papers) and Optimization and Variational Analysis (4 papers). Stuart M. Harwood is often cited by papers focused on Quantum Computing Algorithms and Architecture (6 papers), Advanced Optimization Algorithms Research (5 papers) and Optimization and Variational Analysis (4 papers). Stuart M. Harwood collaborates with scholars based in United States, Switzerland and Ireland. Stuart M. Harwood's co-authors include Paul I. Barton, Kai Höffner, Dimitar Trenev, David E. Bernal, Donny Greenberg, Claudio Gambella, Andrea Simonetto, Fengqi You, Joseph K. Scott and Akshay Ajagekar and has published in prestigious journals such as AIChE Journal, Biotechnology and Bioengineering and Computers & Chemical Engineering.

In The Last Decade

Stuart M. Harwood

17 papers receiving 335 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stuart M. Harwood United States 9 114 108 105 79 47 18 345
Thomas Holenstein Switzerland 10 30 0.3× 171 1.6× 41 0.4× 118 1.5× 14 0.3× 23 318
S. Gustafson United Kingdom 6 14 0.1× 238 2.2× 61 0.6× 52 0.7× 10 0.2× 8 303
Guanxiang Wang China 11 30 0.3× 12 0.1× 12 0.1× 17 0.2× 11 0.2× 24 423
A.S.J. Helberg South Africa 9 12 0.1× 111 1.0× 140 1.3× 80 1.0× 6 0.1× 33 290
Antoine Deza Canada 10 20 0.2× 56 0.5× 16 0.2× 121 1.5× 4 0.1× 59 266
Hanan Alolaiyan Saudi Arabia 11 26 0.2× 151 1.4× 11 0.1× 89 1.1× 99 2.1× 42 425
Vipin Sachdeva United States 10 8 0.1× 68 0.6× 96 0.9× 37 0.5× 28 0.6× 26 373
Paul H. Bardell United States 11 94 0.8× 49 0.5× 46 0.4× 89 1.1× 38 0.8× 19 755
D. R. McGregor United Kingdom 10 31 0.3× 223 2.1× 26 0.2× 65 0.8× 10 0.2× 27 338

Countries citing papers authored by Stuart M. Harwood

Since Specialization
Citations

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

Fields of papers citing papers by Stuart M. Harwood

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stuart M. Harwood

This figure shows the co-authorship network connecting the top 25 collaborators of Stuart M. Harwood. A scholar is included among the top collaborators of Stuart M. Harwood 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 Stuart M. Harwood. Stuart M. Harwood is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Trenev, Dimitar, Pauline J. Ollitrault, Stuart M. Harwood, et al.. (2025). Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis. Quantum. 9. 1630–1630. 2 indexed citations
2.
Laird, Carl D., et al.. (2024). Utilizing modern computer architectures to solve mathematical optimization problems: A survey. Computers & Chemical Engineering. 184. 108627–108627. 3 indexed citations
3.
Harwood, Stuart M., Francisco Trespalacios, Dimitri J. Papageorgiou, & Kevin C. Furman. (2023). Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming. Computational Optimization and Applications. 87(2). 641–676.
4.
Harwood, Stuart M., et al.. (2022). Considerations for evaluating thermodynamic properties with hybrid quantum-classical computing work flows. Physical review. A. 105(1). 5 indexed citations
5.
Bernal, David E., et al.. (2022). Perspectives of quantum computing for chemical engineering. AIChE Journal. 68(6). 33 indexed citations
6.
Papageorgiou, Dimitri J., Stuart M. Harwood, & Francisco Trespalacios. (2022). Pooling problems under perfect and imperfect competition. Computers & Chemical Engineering. 169. 108067–108067. 1 indexed citations
7.
Harwood, Stuart M., Dimitar Trenev, Panagiotis Kl. Barkoutsos, et al.. (2022). Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing. arXiv (Cornell University). 3(1). 1–20. 13 indexed citations
8.
Harwood, Stuart M., Claudio Gambella, Dimitar Trenev, et al.. (2021). Formulating and Solving Routing Problems on Quantum Computers. IEEE Transactions on Quantum Engineering. 2. 1–17. 92 indexed citations
9.
Harwood, Stuart M.. (2021). Analysis of the Alternating Direction Method of Multipliers for Nonconvex Problems. Operations Research Forum. 2(1). 2 indexed citations
10.
Papageorgiou, Dimitri J., Francisco Trespalacios, & Stuart M. Harwood. (2020). A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity. arXiv (Cornell University). 1 indexed citations
11.
Harwood, Stuart M. & Paul I. Barton. (2017). How to solve a design centering problem. Mathematical Methods of Operations Research. 86(1). 215–254. 15 indexed citations
12.
Harwood, Stuart M. & Paul I. Barton. (2017). Affine relaxations for the solutions of constrained parametric ordinary differential equations. Optimal Control Applications and Methods. 39(2). 427–448. 10 indexed citations
13.
Harwood, Stuart M. & Paul I. Barton. (2016). Efficient polyhedral enclosures for the reachable set of nonlinear control systems. Mathematics of Control Signals and Systems. 28(1). 23 indexed citations
14.
Harwood, Stuart M. & Paul I. Barton. (2016). Lower level duality and the global solution of generalized semi-infinite programs. Optimization. 65(6). 1129–1149. 7 indexed citations
15.
Harwood, Stuart M., Joseph K. Scott, & Paul I. Barton. (2015). Bounds on reachable sets using ordinary differential equations with linear programs embedded. IMA Journal of Mathematical Control and Information. 33(2). 519–541. 15 indexed citations
16.
Harwood, Stuart M., Kai Höffner, & Paul I. Barton. (2015). Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded. Numerische Mathematik. 133(4). 623–653. 24 indexed citations
17.
Harwood, Stuart M., Joseph K. Scott, & Paul I. Barton. (2013). Bounds on Reachable Sets Using Ordinary Differential Equations with Linear Programs Embedded. IFAC Proceedings Volumes. 46(23). 62–67. 2 indexed citations
18.
Höffner, Kai, Stuart M. Harwood, & Paul I. Barton. (2012). A reliable simulator for dynamic flux balance analysis. Biotechnology and Bioengineering. 110(3). 792–802. 97 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