| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A deterministic version of the game of zombies and survivors on graphs
|
Fitzpatrick, S.L.
|
|
2016
|
213 |
C |
p. 1-12
12 p.
|
artikel
|
| 2 |
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
|
Bordewich, M.
|
|
2016
|
213 |
C |
p. 47-59
13 p.
|
artikel
|
| 3 |
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
|
Bley, Andreas
|
|
2016
|
213 |
C |
p. 34-46
13 p.
|
artikel
|
| 4 |
Contents
|
|
|
2016
|
213 |
C |
p. v-vi
nvt p.
|
artikel
|
| 5 |
Counting 4 × 4 matrix partitions of graphs
|
Dyer, Martin
|
|
2016
|
213 |
C |
p. 76-92
17 p.
|
artikel
|
| 6 |
Deterministic parameterized algorithms for the Graph Motif problem
|
Pinter, Ron Y.
|
|
2016
|
213 |
C |
p. 162-178
17 p.
|
artikel
|
| 7 |
Extremal Halin graphs with respect to the signless Laplacian spectra
|
Zhang, Minjie
|
|
2016
|
213 |
C |
p. 207-218
12 p.
|
artikel
|
| 8 |
Facial packing edge-coloring of plane graphs
|
Czap, Július
|
|
2016
|
213 |
C |
p. 71-75
5 p.
|
artikel
|
| 9 |
Fast approximation for computing the fractional arboricity and extraction of communities of a graph
|
Toko Worou, Bio Mikaila
|
|
2016
|
213 |
C |
p. 179-195
17 p.
|
artikel
|
| 10 |
Fractional spanning tree packing, forest covering and eigenvalues
|
Hong, Yanmei
|
|
2016
|
213 |
C |
p. 219-223
5 p.
|
artikel
|
| 11 |
Fractional zero forcing via three-color forcing games
|
Hogben, Leslie
|
|
2016
|
213 |
C |
p. 114-129
16 p.
|
artikel
|
| 12 |
Improving the lower bound on opaque sets for equilateral triangle
|
Izumi, Taisuke
|
|
2016
|
213 |
C |
p. 130-138
9 p.
|
artikel
|
| 13 |
Lower bounds for monotone counting circuits
|
Jukna, Stasys
|
|
2016
|
213 |
C |
p. 139-152
14 p.
|
artikel
|
| 14 |
Multicolor bipartite Ramsey numbers of K t , s and large K n , n
|
Wang, Xiuwen
|
|
2016
|
213 |
C |
p. 238-242
5 p.
|
artikel
|
| 15 |
On constructing rational spanning tree edge densities
|
Kahl, Nathan
|
|
2016
|
213 |
C |
p. 224-232
9 p.
|
artikel
|
| 16 |
On incidence coloring conjecture in Cartesian products of graphs
|
Gregor, Petr
|
|
2016
|
213 |
C |
p. 93-100
8 p.
|
artikel
|
| 17 |
On the fractional strong metric dimension of graphs
|
Kang, Cong X.
|
|
2016
|
213 |
C |
p. 153-161
9 p.
|
artikel
|
| 18 |
On the path separation number of graphs
|
Balogh, József
|
|
2016
|
213 |
C |
p. 26-33
8 p.
|
artikel
|
| 19 |
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
|
Grubman, Tony
|
|
2016
|
213 |
C |
p. 101-113
13 p.
|
artikel
|
| 20 |
Proof of a conjecture on the zero forcing number of a graph
|
Lu, Leihao
|
|
2016
|
213 |
C |
p. 233-237
5 p.
|
artikel
|
| 21 |
Proximity, remoteness and distance eigenvalues of a graph
|
Aouchiche, Mustapha
|
|
2016
|
213 |
C |
p. 17-25
9 p.
|
artikel
|
| 22 |
Scheduling jobs with equal processing times and a single server on parallel identical machines
|
Zhang, An
|
|
2016
|
213 |
C |
p. 196-206
11 p.
|
artikel
|
| 23 |
The Territorial Raider game and graph derangements
|
Galanter, Nina
|
|
2016
|
213 |
C |
p. 13-16
4 p.
|
artikel
|
| 24 |
Word-representability of triangulations of grid-covered cylinder graphs
|
Chen, Herman Z.Q.
|
|
2016
|
213 |
C |
p. 60-70
11 p.
|
artikel
|
Tijdschrift beschrijving