Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Graph colourings and partitions
Theoretical Computer Science
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science - Approximation and online algorithms
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science
| Hi-index | 0.00 |