On the complexity of local search
STOC '90 Proceedings of the twenty-second 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
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
New results on the old k-opt algorithm for the TSP
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
IEEE Transactions on Knowledge and Data Engineering
Analysis of Random Noise and Random Walk Algorithms
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Handbook of data mining and knowledge discovery
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
Journal of Global Optimization
Combinatorics, Probability and Computing
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analyzing the Performance of Generalized Hill Climbing Algorithms
Journal of Heuristics
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms
Journal of Global Optimization
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Circuit principles and weak pigeonhole variants
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Computing sequential equilibria for two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Enhanced algorithms for local search
Information Processing Letters
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Circuit principles and weak pigeonhole variants
Theoretical Computer Science
Fast-converging tatonnement algorithms for one-time and ongoing market problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Santa Claus Meets Hypergraph Matchings
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
A mini-max spanning forest approach to the political districting problem
International Journal of Systems Science
A Characterisation of Definable NP Search Problems in Peano Arithmetic
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Sublinear-Time Algorithms for Tournament Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nash Dynamics in Congestion Games with Similar Resources
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
A note on the complexity of local search problems
Information Processing Letters
Enhanced algorithms for Local Search
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
Communications of the ACM
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
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
Computational game theory: an introduction
Algorithms and theory of computation handbook
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
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Archive for Mathematical Logic
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
Computers and Industrial Engineering
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
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The tree-string problem: an artificial domain for structure and content search
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
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
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Convergence and approximation in potential games
Theoretical Computer Science
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Proceedings of the 13th ACM Conference on Electronic Commerce
Santa claus meets hypergraph matchings
ACM Transactions on Algorithms (TALG)
The speed of convergence in congestion games under best-response dynamics
ACM Transactions on Algorithms (TALG)
Cache me if you can: capacitated selfish replication games
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Mathematical and Computer Modelling: An International Journal
Order preserving reductions and polynomial improving paths
Operations Research Letters
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Local search and the local structure of NP-complete problems
Operations Research Letters
Complexity of uniqueness and local search in quadratic 0-1 programming
Operations Research Letters
How difficult is the frequency selection problem?
Operations Research Letters
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
On local search for the generalized graph coloring problem
Operations Research Letters
Multi-valued functions in computability theory
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
On the impact of fair best response dynamics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
Information Processing Letters
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
Congestion games with player-specific constants
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
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
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Discrete Applied Mathematics
Exponentiality of the exchange algorithm for finding another room-partitioning
Discrete Applied Mathematics
| Hi-index | 0.02 |