Daniel E. Steffy
Impact in
- Numerical Analysis top 5%
- Advanced Optimization Algorithms Research
-
- Formal Methods in Verification
- Numerical Methods and Algorithms
- Polynomial and algebraic computation
- Complexity and Algorithms in Graphs
Papers in
-
- Numerical Methods and Algorithms 9
- Polynomial and algebraic computation 6
- Formal Methods in Verification 5
-
- Advanced Optimization Algorithms Research 8
- Co-authors
- Kati Wolter (7 shared papers)Ambros Gleixner (6 shared papers)Thorsten Koch (4 shared papers)William J. Cook (3 shared papers)Ted K. Ralphs (3 shared papers)Oliver Bastert (2 shared papers)Emilie Danna (2 shared papers)Timo Berthold (2 shared papers)
- Journals
- Graphs and Combinatorics (2 papers)INFORMS journal on computing (2 papers)Mathematical Programming Computation (2 papers)Theoretical Computer Science (1 paper)ACM Transactions on Mathematical Software (1 paper)
- Partner nations
- United StatesGermanyItaly
In The Last Decade
Daniel E. Steffy
21 papers receiving 510 citations
Peers
Comparison fields: 5 of 57
- Numerical Analysis 98
- Computational Theory and Mathematics 262
- Industrial and Manufacturing Engineering 139
- Computer Networks and Communications 158
- Software 24
Countries citing papers authored by Daniel E. Steffy
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
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-authors
The 21 scholars most cited alongside Daniel E. Steffy, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 263 | |
| 2 | 2016 | 38 | |
| 3 | 2011 | 34 | |
| 4 | 2013 | 31 | |
| 5 | Mixed Integer Programming Library version 5 | 2011 | 27 |
| 6 | 2012 | 26 | |
| 7 | 2013 | 24 | |
| 8 | 2013 | 22 | |
| 9 | 2011 | 15 | |
| 10 | 2017 | 14 | |
| 11 | 2011 | 9 | |
| 12 | 2012 | 8 | |
| 13 | 2018 | 7 | |
| 14 | Clinching and Elimination of Playoff Berth in the NHL | 2008 | 5 |
| 15 | 2005 | 4 | |
| 16 | 2015 | 3 | |
| 17 | 2016 | 2 | |
| 18 | 2017 | 2 | |
| 19 | 2016 | 2 | |
| 20 | 2019 | 1 |
About Daniel E. Steffy
Daniel E. Steffy is a scholar working on Computational Theory and Mathematics, Numerical Analysis, Computer Networks and Communications, Control and Systems Engineering and Artificial Intelligence, having authored 21 papers that have together received 538 indexed citations. Recurring topics across this work include Numerical Methods and Algorithms (9 papers), Advanced Optimization Algorithms Research (8 papers), Polynomial and algebraic computation (6 papers), Interconnection Networks and Systems (5 papers), Formal Methods in Verification (5 papers), Optimization and Mathematical Programming (3 papers), graph theory and CDMA systems (3 papers) and Logic, programming, and type systems (2 papers). The work is most often cited by research in Numerical Analysis (98 citations), Computational Theory and Mathematics (262 citations), Industrial and Manufacturing Engineering (139 citations), Computer Networks and Communications (158 citations) and Software (24 citations). Daniel E. Steffy has collaborated with scholars based in United States, Germany and Italy. Frequent co-authors include Kati Wolter, Ambros Gleixner, Thorsten Koch, William J. Cook, Ted K. Ralphs, Oliver Bastert, Emilie Danna, Timo Berthold, Robert E. Bixby and Stefan Heinz. Their work appears in journals such as Graphs and Combinatorics, INFORMS journal on computing, Mathematical Programming Computation, Theoretical Computer Science and ACM Transactions on Mathematical Software.
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.