Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Efficiently covering complex networks with cliques of similar vertices
Theoretical Computer Science - Complex networks
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science
Computer Science Review
On the efficiency of an order-based representation in the clique covering problem
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On the analysis of the simple genetic algorithm
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |