nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A complete characterization of jump inequalities for the hop-constrained shortest path problem
|
Riedl, Wolfgang F. |
|
2017 |
225 |
C |
p. 95-113 19 p. |
artikel |
2 |
Alliance polynomial of regular graphs
|
Carballosa, Walter |
|
2017 |
225 |
C |
p. 22-32 11 p. |
artikel |
3 |
Color-blind index in graphs of very low degree
|
Diemunsch, Jennifer |
|
2017 |
225 |
C |
p. 122-129 8 p. |
artikel |
4 |
Contents
|
|
|
2017 |
225 |
C |
p. v- 1 p. |
artikel |
5 |
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
|
Ando, Kazutoshi |
|
2017 |
225 |
C |
p. 1-10 10 p. |
artikel |
6 |
End-vertices of LBFS of (AT-free) bigraphs
|
Gorzny, Jan |
|
2017 |
225 |
C |
p. 87-94 8 p. |
artikel |
7 |
Interval scheduling maximizing minimum coverage
|
Mäkinen, Veli |
|
2017 |
225 |
C |
p. 130-135 6 p. |
artikel |
8 |
k -circular matroids of graphs
|
De Jesús, José F. |
|
2017 |
225 |
C |
p. 33-50 18 p. |
artikel |
9 |
On b -coloring of powers of hypercubes
|
Francis, P. |
|
2017 |
225 |
C |
p. 74-86 13 p. |
artikel |
10 |
On the barrier graph of an arrangement of ray sensors
|
Boyer, Kirk |
|
2017 |
225 |
C |
p. 11-21 11 p. |
artikel |
11 |
Sequences of radius k for complete bipartite graphs
|
Dębski, Michał |
|
2017 |
225 |
C |
p. 51-63 13 p. |
artikel |
12 |
The connection between polynomial optimization, maximum cliques and Turán densities
|
Wu, Biao |
|
2017 |
225 |
C |
p. 114-121 8 p. |
artikel |
13 |
The game of Cops and Robber on circulant graphs
|
Fitzpatrick, Shannon L. |
|
2017 |
225 |
C |
p. 64-73 10 p. |
artikel |
14 |
The packing chromatic number of the infinite square lattice is between 13 and 15
|
Martin, Barnaby |
|
2017 |
225 |
C |
p. 136-142 7 p. |
artikel |