Theory of linear and integer programming
Theory of linear and integer programming
Completely unimodal numberings of a simple polytope
Discrete Applied Mathematics
From linear separability to unimodality: a hierarchy of pseudo-Boolean functions
SIAM Journal on Discrete Mathematics
Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
Improved algorithms for linear inequalities with two variables per inequality
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
The complexity of stochastic games
Information and Computation
Cyclical games with prohibitions
Mathematical Programming: Series A and B
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
The P-matrix problem is co-NP-complete
Mathematical Programming: Series A and B
The complexity of mean payoff games on graphs
Theoretical Computer Science
Linear programming, the simplex algorithm and simple polytopes
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Mathematics of Operations Research
The Generalized Linear Complementarity Problem: Least Element Theory andZ-Matrices
Journal of Global Optimization
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
Theory of Computing Systems
Linear complementarity and p-matrices for stochastic games
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Linear programming polytope and algorithm for mean payoff games
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Simple stochastic games and p-matrix generalized linear complementarity problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.04 |
New efficient algorithms for solving infinite-duration two-person adversary games with the decision problem inNP@?coNP, based on linear programming (LP), LP-representations, combinatorial LP, linear complementarity problem (LCP), controlled LP are surveyed.