| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A cutting plane algorithm for graph coloring
|
Méndez-Díaz, Isabel
|
|
2008
|
156 |
2 |
p. 159-179
21 p.
|
article
|
| 2 |
An adaptive memory algorithm for the k-coloring problem
|
Galinier, Philippe
|
|
2008
|
156 |
2 |
p. 267-279
13 p.
|
article
|
| 3 |
An ant-based algorithm for coloring graphs
|
Bui, Thang N.
|
|
2008
|
156 |
2 |
p. 190-200
11 p.
|
article
|
| 4 |
Another look at graph coloring via propositional satisfiability
|
Van Gelder, Allen
|
|
2008
|
156 |
2 |
p. 230-243
14 p.
|
article
|
| 5 |
A semidefinite programming-based heuristic for graph coloring
|
Dukanovic, Igor
|
|
2008
|
156 |
2 |
p. 180-189
10 p.
|
article
|
| 6 |
Coloring graphs by iterated local search traversing feasible and infeasible solutions
|
Caramia, Massimiliano
|
|
2008
|
156 |
2 |
p. 201-217
17 p.
|
article
|
| 7 |
Constructive generation of very hard 3-colorability instances
|
Mizuno, Kazunori
|
|
2008
|
156 |
2 |
p. 218-229
12 p.
|
article
|
| 8 |
Contents
|
|
|
2008
|
156 |
2 |
p. v-
1 p.
|
article
|
| 9 |
Efficient algorithms for finding critical subgraphs
|
Desrosiers, C.
|
|
2008
|
156 |
2 |
p. 244-266
23 p.
|
article
|
| 10 |
Generalised graph colouring by a hybrid of local search and constraint programming
|
Prestwich, Steven
|
|
2008
|
156 |
2 |
p. 148-158
11 p.
|
article
|
| 11 |
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
|
Hossain, Shahadat
|
|
2008
|
156 |
2 |
p. 280-288
9 p.
|
article
|
| 12 |
Guest Editors List for Special Issue Graph Coloring
|
|
|
2008
|
156 |
2 |
p. 147-
1 p.
|
article
|
| 13 |
Special issue on computational methods for graph coloring and its generalizations
|
Johnson, David S.
|
|
2008
|
156 |
2 |
p. 145-146
2 p.
|
article
|
Journal description