On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Handbook of data mining and knowledge discovery
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
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
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The computational power of discrete hopfield nets with hidden units
Neural Computation
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
MMAS and ACS for GPS surveying problem
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
An Heuristic Method for GPS Surveying Problem
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Memetic Simulated Annealing for the GPS Surveying Problem
Numerical Analysis and Its Applications
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Strong Equilibria in the Max Cut Game
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A note on the complexity of local search problems
Information Processing Letters
Symmetries and the complexity of pure Nash equilibrium
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the complexity of pure Nash equilibria in player-specific network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing stable outcomes in hedonic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The complexity of equilibria in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing stable outcomes in hedonic games with voting-based deviations
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Ant colony optimization for multiple knapsack problem and model bias
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Simulated annealing: a monte carlo method for GPS surveying
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hybrid ACO algorithm for the GPS surveying problem
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Convergence and approximation in potential games
Theoretical Computer Science
Dynamics of profit-sharing games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
On local search for the generalized graph coloring problem
Operations Research Letters
Minimizing expectation plus variance
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
A hybrid method of CSMA/CA and TDMA for real-time data aggregation in wireless sensor networks
Computer Communications
How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems
Proceedings of the 22nd international conference on World Wide Web
Discrete Applied Mathematics
| Hi-index | 0.00 |