Stefan Hougardy
About
In The Last Decade
Stefan Hougardy
40 papers receiving 638 citations
Peers
Comparison fields: 5 of 90
- Computational Theory and Mathematics 253
- Electrical and Electronic Engineering 195
- Computer Networks and Communications 171
- Artificial Intelligence 93
- Industrial and Manufacturing Engineering 89
Countries citing papers authored by Stefan Hougardy
This map shows the geographic impact of Stefan Hougardy'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 Stefan Hougardy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Hougardy more than expected).
Fields of papers citing papers by Stefan Hougardy
This network shows the impact of papers produced by Stefan Hougardy. 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 Stefan Hougardy. The network helps show where Stefan Hougardy may publish in the future.
Co-authorship network of co-authors of Stefan Hougardy
This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Hougardy. A scholar is included among the top collaborators of Stefan Hougardy 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 Stefan Hougardy. Stefan Hougardy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 25 | |
| 3 | 0 | |
| 4 | 20 | |
| 5 | 7 | |
| 6 | 13 | |
| 7 | 24 | |
| 8 | 30 | |
| 9 | 3 | |
| 10 | 9 | |
| 11 | 65 | |
| 12 | Lower Bounds for Approximation Algorithms for the Steiner Tree Problem | 7 |
| 13 | Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids | 5 |
| 14 | A 1.598 approximation algorithm for the Steiner problem in graphs | 60 |
| 15 | 37 | |
| 16 | 1 | |
| 17 | 2 | |
| 18 | 3 | |
| 19 | 3 | |
| 20 | 1 |
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.