Cut problems in graphs with a budget constraint
Journal of Discrete Algorithms
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
PTAS for weighted set cover on unit squares
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Cut problems in graphs with a budget constraint
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved approximation of maximum vertex cover
Operations Research Letters
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
| Hi-index | 0.00 |