nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A lower bound on the zero forcing number
|
Davila, Randy |
|
2018 |
250 |
C |
p. 363-367 |
artikel |
2 |
A maximizing characteristic for critical configurations of chip-firing games on digraphs
|
Nguyen, Hoang Thach |
|
2018 |
250 |
C |
p. 38-46 |
artikel |
3 |
A note on the global offensive alliances in graphs
|
Rad, Nader Jafari |
|
2018 |
250 |
C |
p. 373-376 |
artikel |
4 |
Anti-forcing polynomials for benzenoid systems with forcing edges
|
Zhao, Shuang |
|
2018 |
250 |
C |
p. 342-356 |
artikel |
5 |
A priori TSP in the scenario model
|
van Ee, Martijn |
|
2018 |
250 |
C |
p. 331-341 |
artikel |
6 |
A universal tree-based network with the minimum number of reticulations
|
Bordewich, Magnus |
|
2018 |
250 |
C |
p. 357-362 |
artikel |
7 |
A variation on bisecting the binomial coefficients
|
Ionaşcu, Eugen J. |
|
2018 |
250 |
C |
p. 276-284 |
artikel |
8 |
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
|
Hochbaum, Dorit S. |
|
2018 |
250 |
C |
p. 252-261 |
artikel |
9 |
Connected realizations of joint-degree matrices
|
Amanatidis, Georgios |
|
2018 |
250 |
C |
p. 65-74 |
artikel |
10 |
Editorial Board
|
|
|
2018 |
250 |
C |
p. ii |
artikel |
11 |
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
|
Fast, Caleb C. |
|
2018 |
250 |
C |
p. 215-226 |
artikel |
12 |
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
|
Chroni, Maria |
|
2018 |
250 |
C |
p. 145-164 |
artikel |
13 |
Extended framework for constructing (complete) permutations by specifying their coordinate functions
|
Sun, Tianfeng |
|
2018 |
250 |
C |
p. 322-330 |
artikel |
14 |
Flexible allocation on related machines with assignment restrictions
|
Rawitz, Dror |
|
2018 |
250 |
C |
p. 309-321 |
artikel |
15 |
Game total domination critical graphs
|
Henning, Michael A. |
|
2018 |
250 |
C |
p. 28-37 |
artikel |
16 |
Graphs with maximal σ irregularity
|
Abdo, Hosam |
|
2018 |
250 |
C |
p. 57-64 |
artikel |
17 |
Independent-set reconfiguration thresholds of hereditary graph classes
|
de Berg, Mark |
|
2018 |
250 |
C |
p. 165-182 |
artikel |
18 |
k -broadcast domination and k -multipacking
|
Henning, Michael A. |
|
2018 |
250 |
C |
p. 241-251 |
artikel |
19 |
Large Cayley graphs of small diameter
|
Erskine, Grahame |
|
2018 |
250 |
C |
p. 202-214 |
artikel |
20 |
Linear read-once and related Boolean functions
|
Lozin, Vadim |
|
2018 |
250 |
C |
p. 16-27 |
artikel |
21 |
Minimizing the number of apertures in multileaf collimator sequencing with field splitting
|
Baatar, Davaatseren |
|
2018 |
250 |
C |
p. 87-103 |
artikel |
22 |
Monotone bargaining is Nash-solvable
|
Gurvich, Vladimir |
|
2018 |
250 |
C |
p. 1-15 |
artikel |
23 |
Nearly optimal codebooks based on generalized Jacobi sums
|
Heng, Ziling |
|
2018 |
250 |
C |
p. 227-240 |
artikel |
24 |
On derivatives of planar mappings and their connections to complete mappings
|
Muratović-Ribić, A. |
|
2018 |
250 |
C |
p. 285-290 |
artikel |
25 |
On domination game stable graphs and domination game edge-critical graphs
|
Xu, Kexiang |
|
2018 |
250 |
C |
p. 47-56 |
artikel |
26 |
On eccentric distance sum and degree distance of graphs
|
Hua, Hongbo |
|
2018 |
250 |
C |
p. 262-275 |
artikel |
27 |
On improving matchings in trees, via bounded-length augmentations
|
Bensmail, Julien |
|
2018 |
250 |
C |
p. 110-129 |
artikel |
28 |
On minimally 2- T -connected directed graphs
|
Durand de Gevigney, Olivier |
|
2018 |
250 |
C |
p. 183-185 |
artikel |
29 |
Paired threshold graphs
|
Ravanmehr, Vida |
|
2018 |
250 |
C |
p. 291-308 |
artikel |
30 |
Rainbow connectivity of Moore cages of girth 6
|
Balbuena, C. |
|
2018 |
250 |
C |
p. 104-109 |
artikel |
31 |
Selecting and covering colored points
|
Arkin, Esther M. |
|
2018 |
250 |
C |
p. 75-86 |
artikel |
32 |
Set and size multipartite Ramsey numbers for stars
|
Perondi, Pablo H. |
|
2018 |
250 |
C |
p. 368-372 |
artikel |
33 |
The stable b -matching polytope revisited
|
Eirinakis, Pavlos |
|
2018 |
250 |
C |
p. 186-201 |
artikel |
34 |
Weighted efficient domination for some classes of H -free and of ( H 1 , H 2 ) -free graphs
|
Brandstädt, Andreas |
|
2018 |
250 |
C |
p. 130-144 |
artikel |