Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The maximum saving partition problem
Operations Research Letters
| Hi-index | 0.89 |