The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Cyclic games and linear programming
Discrete Applied Mathematics
Faster algorithms for mean-payoff games
Formal Methods in System Design
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
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
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
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |