This map shows the geographic impact of Peter Merz'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 Peter Merz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Merz more than expected).
This network shows the impact of papers produced by Peter Merz. 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 Peter Merz. The network helps show where Peter Merz may publish in the future.
Co-authorship network of co-authors of Peter Merz
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Merz.
A scholar is included among the top collaborators of Peter Merz 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 Peter Merz. Peter Merz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Neumann, Frank, Carsten Witt, Peter Merz, et al.. (2015). Part E: Evolutionary Computation. 823–1288.35 indexed citations
2.
Merz, Peter, et al.. (2011). Evolutionary computation in combinatorial optimization : 11th European conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011 : proceedings. Springer eBooks.3 indexed citations
Merz, Peter. (2002). A comparison of memetic recombination operators for the traveling salesman problem. Genetic and Evolutionary Computation Conference. 472–479.11 indexed citations
17.
Merz, Peter & Bernd Freisleben. (2001). Memetic Algorithms for the Traveling Salesman Problem. Complex Systems. 13.93 indexed citations
18.
Merz, Peter & Bernd Freisleben. (1999). Fitness landscapes and memetic algorithm design. 245–260.70 indexed citations
19.
Merz, Peter & Bernd Freisleben. (1999). Genetic algorithms for binary quadratic programming. Genetic and Evolutionary Computation Conference. 417–424.53 indexed citations
20.
Merz, Peter & Bernd Freisleben. (1997). A Genetic Local Search Approach to the Quadratic Assignment Problem.. 465–472.75 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.