Daniel E. Steffy

727 total citations
16 papers, 388 citations indexed

About

Daniel E. Steffy is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computer Networks and Communications. According to data from OpenAlex, Daniel E. Steffy has authored 16 papers receiving a total of 388 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 7 papers in Numerical Analysis and 5 papers in Computer Networks and Communications. Recurrent topics in Daniel E. Steffy's work include Advanced Optimization Algorithms Research (7 papers), Interconnection Networks and Systems (5 papers) and Numerical Methods and Algorithms (5 papers). Daniel E. Steffy is often cited by papers focused on Advanced Optimization Algorithms Research (7 papers), Interconnection Networks and Systems (5 papers) and Numerical Methods and Algorithms (5 papers). Daniel E. Steffy collaborates with scholars based in United States, Germany and Italy. Daniel E. Steffy's co-authors include Kati Wolter, Ambros Gleixner, Thorsten Koch, Eddie Cheng, Oliver Bastert, Tobias Achterberg, Emilie Danna, Gerald Gamrath, Robert E. Bixby and Ted K. Ralphs and has published in prestigious journals such as Mathematical Programming, Theoretical Computer Science and ACM Transactions on Mathematical Software.

In The Last Decade

Daniel E. Steffy

16 papers receiving 368 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel E. Steffy United States 8 183 113 100 77 66 16 388
Kati Wolter Germany 6 143 0.8× 64 0.6× 96 1.0× 69 0.9× 46 0.7× 6 310
Stefano Smriglio Italy 11 117 0.6× 188 1.7× 176 1.8× 38 0.5× 60 0.9× 23 438
Marco Molinaro United States 10 74 0.4× 96 0.8× 37 0.4× 43 0.6× 43 0.7× 33 234
Gintaras Palubeckis Lithuania 14 127 0.7× 91 0.8× 384 3.8× 44 0.6× 39 0.6× 38 589
Giulia Galbiati Italy 12 269 1.5× 168 1.5× 171 1.7× 5 0.1× 63 1.0× 32 469
David Shallcross United States 11 112 0.6× 213 1.9× 140 1.4× 7 0.1× 129 2.0× 33 433
Leonidas Pitsoulis Greece 10 62 0.3× 71 0.6× 123 1.2× 17 0.2× 30 0.5× 30 326
Alberto Del Pia United States 10 159 0.9× 24 0.2× 94 0.9× 105 1.4× 54 0.8× 37 320
Gary Pamparà South Africa 7 157 0.9× 52 0.5× 76 0.8× 6 0.1× 58 0.9× 13 432
Laurent Hardouin France 16 644 3.5× 115 1.0× 99 1.0× 14 0.2× 17 0.3× 80 785

Countries citing papers authored by Daniel E. Steffy

Since Specialization
Citations

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

Fields of papers citing papers by Daniel E. Steffy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel E. Steffy

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

All Works

16 of 16 papers shown
1.
Chopra, Sunil, et al.. (2018). A concise characterization of strong knapsack facets. Discrete Applied Mathematics. 253. 136–152. 1 indexed citations
2.
Li, Li, et al.. (2017). A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs. Graphs and Combinatorics. 34(1). 241–260. 2 indexed citations
3.
Gleixner, Ambros, Daniel E. Steffy, & Kati Wolter. (2016). Iterative Refinement for Linear Programming. INFORMS journal on computing. 28(3). 449–464. 30 indexed citations
4.
Kılınç-Karzan, Fatma & Daniel E. Steffy. (2016). On sublinear inequalities for mixed integer conic programs. Mathematical Programming. 159(1-2). 585–605. 2 indexed citations
5.
Cheng, Eddie, et al.. (2016). On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. Graphs and Combinatorics. 33(1). 85–102. 2 indexed citations
6.
Cheng, Eddie, et al.. (2013). Strong matching preclusion for augmented cubes. Theoretical Computer Science. 491. 71–77. 21 indexed citations
7.
Cook, William J., Thorsten Koch, Daniel E. Steffy, & Kati Wolter. (2013). A hybrid branch-and-bound approach for exact rational mixed-integer programming. Mathematical Programming Computation. 5(3). 305–344. 23 indexed citations
8.
Cheng, Eddie, László Lipták, & Daniel E. Steffy. (2013). Strong local diagnosability of -star graphs and Cayley graphs generated by 2-trees with missing edges. Information Processing Letters. 113(12). 452–456. 23 indexed citations
9.
Steffy, Daniel E. & Kati Wolter. (2012). Valid Linear Programming Bounds for Exact Mixed-Integer Programming. INFORMS journal on computing. 25(2). 271–284. 7 indexed citations
10.
Gleixner, Ambros, Daniel E. Steffy, & Kati Wolter. (2012). Improving the accuracy of linear programming solvers with iterative refinement. 187–194. 21 indexed citations
11.
Steffy, Daniel E.. (2011). Exact solutions to linear systems of equations using output sensitive lifting. ACM communications in computer algebra. 44(3/4). 160–182. 7 indexed citations
12.
Koch, Thorsten, Tobias Achterberg, Erling Andersen, et al.. (2011). MIPLIB 2010. Mathematical Programming Computation. 3(2). 103–163. 209 indexed citations
13.
Cook, William J. & Daniel E. Steffy. (2011). Solving Very Sparse Rational Systems of Equations. ACM Transactions on Mathematical Software. 37(4). 1–21. 13 indexed citations
14.
Koch, Thorsten, Tobias Achterberg, Erling Andersen, et al.. (2011). Mixed Integer Programming Library version 5. 20 indexed citations
15.
Cheng, Eddie, et al.. (2008). Clinching and Elimination of Playoff Berth in the NHL. 4 indexed citations
16.
Cheng, Eddie, et al.. (2005). Maximal vertex‐connectivity of $\overrightarrow{S_{n,k}}$. Networks. 46(3). 154–162. 3 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 Kati Wolter Breakdown of academic impact, for papers by Stefano Smriglio Breakdown of academic impact, for papers by Marco Molinaro Breakdown of academic impact, for papers by Gintaras Palubeckis Breakdown of academic impact, for papers by Giulia Galbiati Breakdown of academic impact, for papers by David Shallcross Breakdown of academic impact, for papers by Leonidas Pitsoulis Breakdown of academic impact, for papers by Alberto Del Pia Breakdown of academic impact, for papers by Gary Pamparà Breakdown of academic impact, for papers by Laurent Hardouin
Rankless by CCL
2026