Finding maximum cliques in arbitrary and in special graphs

Graph coloring algorithms for fast evaluation of Curtis decompositions

Proceedings of the 36th annual ACM/IEEE Design Automation Conference

An Augmentation Algorithm for the Maximum Weighted Stable Set Problem

Computational Optimization and Applications

Constraint Propagation in Graph Coloring

Journal of Heuristics

A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization

An algorithm for finding a maximum clique in a graph

Operations Research Letters

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Computational Optimization and Applications