STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Strong bounds on the approximability of two Pspace-hard problems in propositional planning
Annals of Mathematics and Artificial Intelligence
On the Complexity of Train Assignment Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
| Hi-index | 0.00 |