Low order polynomial bounds on the expected performance of local improvement algorithms
Mathematical Programming: Series A and B
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
A probabilistic analysis of the switching algorithm for the Euclidean TSP
Mathematical Programming: Series A and B
Simple local search problems that are hard to solve
SIAM Journal on Computing
Experiments on traveling salesman heuristics
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Analysis of Local Search Problems and Their Heuristics
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
A fast parallel algorithm for the maximal independent set problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
The relative complexity of NP search problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Analysis of Random Noise and Random Walk Algorithms
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Enhanced algorithms for local search
Information Processing Letters
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Computers and Operations Research
Improving connectionist energy minimization
Journal of Artificial Intelligence Research
A note on the complexity of local search problems
Information Processing Letters
Enhanced algorithms for Local Search
Information Processing Letters
Criteria for the evaluation of self-* systems
Proceedings of the 2010 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
An improved connectionist activation function for energy minimization
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
An empirical study of greedy local search for satisfiability testing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The complexity of rerouting shortest paths
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
The complexity of rerouting shortest paths
Theoretical Computer Science
| Hi-index | 0.00 |