A survey of graph layout problems
ACM Computing Surveys (CSUR)
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
Probability in the Engineering and Informational Sciences
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum cardinality matchings on trees by randomized local search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
Memetic algorithms with variable-depth search to overcome local optima
Proceedings of the 10th annual conference on Genetic and evolutionary computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Simulated annealing beats metropolis in combinatorial optimization
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A simple message passing algorithm for graph partitioning problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.05 |