| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A coloring algorithm for 4 K 1 -free line graphs
|
Fraser, Dallas J.
|
|
2018
|
234 |
C |
p. 76-85
|
article
|
| 2 |
A matheuristic for the asymmetric capacitated vehicle routing problem
|
Leggieri, Valeria
|
|
2018
|
234 |
C |
p. 139-150
|
article
|
| 3 |
A sharp lower bound on the number of non-equivalent colorings of graphs of order n and maximum degree n − 3
|
Absil, Romain
|
|
2018
|
234 |
C |
p. 3-11
|
article
|
| 4 |
Classification of de Bruijn-based labeled digraphs
|
Kasprzak, Marta
|
|
2018
|
234 |
C |
p. 86-92
|
article
|
| 5 |
Contents
|
|
|
2018
|
234 |
C |
p. v-vi
|
article
|
| 6 |
Graph multi-coloring for a job scheduling application
|
Thevenin, Simon
|
|
2018
|
234 |
C |
p. 218-235
|
article
|
| 7 |
Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources
|
Carlier, J.
|
|
2018
|
234 |
C |
p. 178-194
|
article
|
| 8 |
Maximum weight relaxed cliques and Russian Doll Search revisited
|
Gschwind, Timo
|
|
2018
|
234 |
C |
p. 131-138
|
article
|
| 9 |
Minimal graphs for matching extensions
|
Costa, M.-C.
|
|
2018
|
234 |
C |
p. 47-55
|
article
|
| 10 |
Multiprofessor scheduling
|
Dosa, Gyorgy
|
|
2018
|
234 |
C |
p. 195-209
|
article
|
| 11 |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
|
Alcón, Liliana
|
|
2018
|
234 |
C |
p. 12-21
|
article
|
| 12 |
On the dominating induced matching problem: Spectral results and sharp bounds
|
Andrade, Enide
|
|
2018
|
234 |
C |
p. 22-31
|
article
|
| 13 |
On the forbidden induced subgraph probe and sandwich problems
|
Couto, Fernanda
|
|
2018
|
234 |
C |
p. 56-66
|
article
|
| 14 |
On the resilience of canonical reducible permutation graphs
|
Bento, Lucila M.S.
|
|
2018
|
234 |
C |
p. 32-46
|
article
|
| 15 |
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol
|
Fortz, Bernard
|
|
2018
|
234 |
C |
p. 114-130
|
article
|
| 16 |
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014
|
Archetti, Claudia
|
|
2018
|
234 |
C |
p. 1-2
|
article
|
| 17 |
Redundant cumulative constraints to compute preemptive bounds
|
Baptiste, Philippe
|
|
2018
|
234 |
C |
p. 168-177
|
article
|
| 18 |
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
|
Furmańczyk, Hanna
|
|
2018
|
234 |
C |
p. 210-217
|
article
|
| 19 |
The connected facility location polytope
|
Leitner, Markus
|
|
2018
|
234 |
C |
p. 151-167
|
article
|
| 20 |
The ( k , ℓ ) partitioned probe problem: NP-complete versus polynomial dichotomy
|
Dantas, Simone
|
|
2018
|
234 |
C |
p. 67-75
|
article
|
| 21 |
The probabilistic minimum dominating set problem
|
Boria, Nicolas
|
|
2018
|
234 |
C |
p. 93-113
|
article
|
Journal description