Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. - Egon Balas; Jue Xue (SIAM J. Comput., 1991)

Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. - Egon Balas; Jue Xue (SIAM J. Comput., 1992)

The maximum clique problem. - Panos M. Pardalos; Jue Xue (J. Glob. Optim., 1994)

Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. - Jue Xue (Networks, 1994)

Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. - Egon Balas; Jue Xue (Algorithmica, 1996)

Solving the Minimum Weighted Integer Coloring Problem. - Jue Xue (Comput. Optim. Appl., 1998)

A network-flow-based lower bound for the minimum weighted integer coloring problem. - Jue Xue; Ju Liu (Inf. Process. Lett., 2000)

Graph Coloring. - Jue Xue (Encyclopedia of Optimization, 2009)