An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Lazy Bureaucrat scheduling problem
Information and Computation
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
The maximum resource bin packing problem
Theoretical Computer Science
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
An improved approximation algorithm for the maximum TSP
Theoretical Computer Science
The maximum resource bin packing problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Common deadline lazy bureaucrat scheduling revisited
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.89 |