Solving the Minimum Weighted Integer Coloring Problem
Computational Optimization and Applications
Graph coloring algorithms for fast evaluation of Curtis decompositions
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The resolution complexity of random graphk-colorability
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
Turán Graphs and the Number of Colorings
SIAM Journal on Discrete Mathematics
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
| Hi-index | 0.00 |