Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Genetic Algorithms + Data Structures = Evolution Programs
Countries citing papers authored by Zbigniew Michalewicz
Since
Specialization
Citations
This map shows the geographic impact of Zbigniew Michalewicz'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 Zbigniew Michalewicz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Zbigniew Michalewicz more than expected).
Fields of papers citing papers by Zbigniew Michalewicz
This network shows the impact of papers produced by Zbigniew Michalewicz. 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 Zbigniew Michalewicz. The network helps show where Zbigniew Michalewicz may publish in the future.
Co-authorship network of co-authors of Zbigniew Michalewicz
This figure shows the co-authorship network connecting the top 25 collaborators of Zbigniew Michalewicz.
A scholar is included among the top collaborators of Zbigniew Michalewicz 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 Zbigniew Michalewicz. Zbigniew Michalewicz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hingston, Philip, Luigi Barone, & Zbigniew Michalewicz. (2008). Design by Evolution: Advances in Evolutionary Design. UWA Profiles and Research Repository (University of Western Australia).22 indexed citations
4.
Eiben, A. E., Bart Jansen, Zbigniew Michalewicz, & Ben Paechter. (2000). Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating. Research Output (Edinburgh Napier University). 128–134.5 indexed citations
5.
Trojanowski, Krzysztof & Zbigniew Michalewicz. (2000). Evolutionary optimization in non-stationary environments. SHILAP Revista de lepidopterología.22 indexed citations
6.
Fogel, David B. & Zbigniew Michalewicz. (1999). Why Evolutionary Algorithms.. Bulletin of the European Association for Theoretical Computer Science. 68. 115–133.1 indexed citations
7.
Krink, Thiemo, et al.. (1999). A PATCHWORK model for evolutionary algorithms with structured and variable size populations. Genetic and Evolutionary Computation Conference. 1321–1328.18 indexed citations
8.
Cao, Hongqing, Lishan Kang, Zbigniew Michalewicz, & Yuping Chen. (1998). A hybrid evolutionary modeling algorithm for system of ordinary differential equations. Neural, Parallel & Scientific Computations archive. 6(2). 171–188.3 indexed citations
9.
Schoenauer, Marc & Zbigniew Michalewicz. (1997). Boundary Operators for Constrained Parameter Optimization Problems.. 322–329.24 indexed citations
Michalewicz, Zbigniew, et al.. (1996). A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems.. 305–312.55 indexed citations
12.
Michalewicz, Zbigniew. (1995). Evolutionary Computation: An Overview.. 322–337.20 indexed citations
13.
Michalewicz, Zbigniew. (1995). Genetic AlgorithmsNumerical Optimizationand Constraints. international conference on Genetic algorithms. 151–158.110 indexed citations
14.
Michalewicz, Zbigniew. (1994). Genetic Algorithms Plus Data Structures Equals Evolution Programs. Springer eBooks.154 indexed citations
Michalewicz, Zbigniew & Cezary Z. Janikow. (1991). Handling Constraints in Genetic Algorithms. international conference on Genetic algorithms. 151–157.219 indexed citations
17.
Groves, Lindsay, et al.. (1991). Genetic algorithms for drawing directed graphs. Elsevier eBooks. 268–276.11 indexed citations
18.
Michalewicz, Zbigniew. (1990). Proceedings of the 5th International Conference SSDBM on Statistical and Scientific Database Management.1 indexed citations
19.
Michalewicz, Zbigniew, et al.. (1986). A query language capable of handling incomplete information and statistics. 107–115.1 indexed citations
20.
Michalewicz, Zbigniew. (1983). Statistical databases: their model, query language and security. 44(1). 391–402.2 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.