Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
On the Shortest Linear Straight-Line Program for Computing Linear Forms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Connected vertex covers in dense graphs
Theoretical Computer Science
Algorithms on graphs with small dominating targets
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |