Alain Hertz
About
In The Last Decade
Alain Hertz
156 papers receiving 4.4k citations
Peers
Comparison fields: 5 of 109
- Industrial and Manufacturing Engineering 3.3k
- Management Science and Operations Research 1.4k
- Artificial Intelligence 982
- Computational Theory and Mathematics 974
- Computer Networks and Communications 898
Countries citing papers authored by Alain Hertz
This map shows the geographic impact of Alain Hertz'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 Alain Hertz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alain Hertz more than expected).
Fields of papers citing papers by Alain Hertz
This network shows the impact of papers produced by Alain Hertz. 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 Alain Hertz. The network helps show where Alain Hertz may publish in the future.
Co-authorship network of co-authors of Alain Hertz
This figure shows the co-authorship network connecting the top 25 collaborators of Alain Hertz. A scholar is included among the top collaborators of Alain Hertz 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 Alain Hertz. Alain Hertz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | 0 | |
| 4 | 4 | |
| 5 | Edge Realizability of Connected Simple Graphs | 0 |
| 6 | Incomplete Service and Split Deliveries in a Routing Problem with Profits | 2 |
| 7 | A Branch-and-Price Algorithm for the Robust Graph Coloring Problem | 2 |
| 8 | The Split Delivery Capacitated Team Orienteering Problem | 5 |
| 9 | The Capacitated Arc Routing Problem with Profits | 2 |
| 10 | 2 | |
| 11 | Comparison of heuristic approaches for the multiple depot vehicle scheduling problem | 16 |
| 12 | Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem | 8 |
| 13 | A Survey of Local Search Methods for Graph Coloring | 4 |
| 14 | An Adaptive Memory Algorithm for the k -Colouring Problem | 4 |
| 15 | A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem | 2 |
| 16 | Data binarization by discriminant elimination | 2 |
| 17 | 30 | |
| 18 | On a Transformation which Preserves the Stability Number | 9 |
| 19 | A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing | 1 |
| 20 | Bounded Vertex Colorings of Graphs | 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.