Pierre Hansen
About
In The Last Decade
Pierre Hansen
441 papers receiving 16.1k citations
Hit Papers
Peers
Comparison fields: 5 of 172
- Industrial and Manufacturing Engineering 7.0k
- Computational Theory and Mathematics 4.3k
- Artificial Intelligence 3.5k
- Organizational Behavior and Human Resource Management 2.5k
- Geometry and Topology 2.4k
Countries citing papers authored by Pierre Hansen
This map shows the geographic impact of Pierre Hansen'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 Pierre Hansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Hansen more than expected).
Fields of papers citing papers by Pierre Hansen
This network shows the impact of papers produced by Pierre Hansen. 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 Pierre Hansen. The network helps show where Pierre Hansen may publish in the future.
Co-authorship network of co-authors of Pierre Hansen
This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Hansen. A scholar is included among the top collaborators of Pierre Hansen 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 Pierre Hansen. Pierre Hansen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | Geometric-arithmetic index and minimum degree of connected graphs | 10 |
| 3 | A Signless Laplacian for the Distance Matrix of a Graph | 6 |
| 4 | On a Conjecture About the Szeged Index | 4 |
| 5 | Bounds and Conjectures for the Signless Laplacian Index of Graphs | 1 |
| 6 | Evaluating a Branch-and-Bound RLT-Based Algorithm for Minimum Sum-of-Squares Clustering | 1 |
| 7 | Clustering - A Chapter for Handbook of Discrete and Combinatorial Optimization | 1 |
| 8 | 6 | |
| 9 | A Survey of Solution Methods for the Continuous Location-Allocation Problem | 71 |
| 10 | 2 | |
| 11 | Variable Neighborhood Search for Extremal Graphs 8: Variations on Graffiti 105 | 17 |
| 12 | 42 | |
| 13 | 9 | |
| 14 | Difficulties of Conditioning and Conditional Independence in Probabilistic Satisfiability | 1 |
| 15 | Variable Neighborhood Search for Extremal Graphs. 4. Chemical Trees with Extremal Connectivity Index | 22 |
| 16 | 1 | |
| 17 | Kekule Count in Tubular Hydrocarbons | 12 |
| 18 | Partial Pivoting in Vertex Enumeration | 2 |
| 19 | On-Line and Off-Line Vertex Enumeration by Adjacency Lists | 1 |
| 20 | Algorithms for voting and competitive location on a network | 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.