| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A class of asymptotically optimal group testing strategies to identify good items
|
Cheng, Yongxi
|
|
2019
|
260 |
C |
p. 109-116
|
artikel
|
| 2 |
A graph with the partial order competition dimension greater than five
|
Choi, Jihoon
|
|
2019
|
260 |
C |
p. 262-266
|
artikel
|
| 3 |
A method for computing local contributions to graph energy based on Estrada–Benzi approach
|
Safaei, F.
|
|
2019
|
260 |
C |
p. 214-226
|
artikel
|
| 4 |
A simple algorithm for secure domination in proper interval graphs
|
Zou, Y.H.
|
|
2019
|
260 |
C |
p. 289-293
|
artikel
|
| 5 |
Bicyclic signed graphs with at most one odd cycle and maximal energy
|
Wang, Dijian
|
|
2019
|
260 |
C |
p. 244-255
|
artikel
|
| 6 |
Capacity restricted optimal pebbling in graphs
|
Shiue, Chin-Lin
|
|
2019
|
260 |
C |
p. 284-288
|
artikel
|
| 7 |
Collapsible subgraphs of a 4-edge-connected graph
|
Gu, Ran
|
|
2019
|
260 |
C |
p. 272-277
|
artikel
|
| 8 |
Deciding the existence of a cherry-picking sequence is hard on two trees
|
Döcker, Janosch
|
|
2019
|
260 |
C |
p. 131-143
|
artikel
|
| 9 |
Dense subgraphs in random graphs
|
Balister, Paul
|
|
2019
|
260 |
C |
p. 66-74
|
artikel
|
| 10 |
Domination cover rubbling
|
Beeler, Robert A.
|
|
2019
|
260 |
C |
p. 75-85
|
artikel
|
| 11 |
Dynamic monopolies for interval graphs with bounded thresholds
|
Bessy, Stéphane
|
|
2019
|
260 |
C |
p. 256-261
|
artikel
|
| 12 |
Easy computation of eccentricity approximating trees
|
Ducoffe, Guillaume
|
|
2019
|
260 |
C |
p. 267-271
|
artikel
|
| 13 |
Editorial Board
|
|
|
2019
|
260 |
C |
p. ii
|
artikel
|
| 14 |
Enumeration of inversion sequences avoiding triples of relations
|
Cao, Wenqin
|
|
2019
|
260 |
C |
p. 86-97
|
artikel
|
| 15 |
Equilibrium paths in discounted supergames
|
Berg, Kimmo
|
|
2019
|
260 |
C |
p. 1-27
|
artikel
|
| 16 |
Extremal problems on saturation for the family of k -edge-connected graphs
|
Lei, Hui
|
|
2019
|
260 |
C |
p. 278-283
|
artikel
|
| 17 |
Fairly allocating contiguous blocks of indivisible items
|
Suksompong, Warut
|
|
2019
|
260 |
C |
p. 227-236
|
artikel
|
| 18 |
Inverse quickest center location problem on a tree
|
Keshtkar, Iman
|
|
2019
|
260 |
C |
p. 188-202
|
artikel
|
| 19 |
List matrix partitions of graphs representing geometric configurations
|
Valadkhan, Payam
|
|
2019
|
260 |
C |
p. 237-243
|
artikel
|
| 20 |
Modulo 5-orientations and degree sequences
|
Han, Miaomiao
|
|
2019
|
260 |
C |
p. 155-163
|
artikel
|
| 21 |
On shortening u-cycles and u-words for permutations
|
Kitaev, Sergey
|
|
2019
|
260 |
C |
p. 203-213
|
artikel
|
| 22 |
On the additive complexity of a Thue–Morse-like sequence
|
Chen, Jin
|
|
2019
|
260 |
C |
p. 98-108
|
artikel
|
| 23 |
Optimal pebbling number of graphs with given minimum degree
|
Czygrinow, A.
|
|
2019
|
260 |
C |
p. 117-130
|
artikel
|
| 24 |
Perfect Italian domination in trees
|
Haynes, Teresa W.
|
|
2019
|
260 |
C |
p. 164-177
|
artikel
|
| 25 |
Relating the annihilation number and the 2-domination number of block graphs
|
Jakovac, Marko
|
|
2019
|
260 |
C |
p. 178-187
|
artikel
|
| 26 |
The cone of supermodular games on finite distributive lattices
|
Grabisch, Michel
|
|
2019
|
260 |
C |
p. 144-154
|
artikel
|
| 27 |
The expanding search ratio of a graph
|
Angelopoulos, Spyros
|
|
2019
|
260 |
C |
p. 51-65
|
artikel
|
| 28 |
The query complexity of a permutation-based variant of Mastermind
|
Afshani, Peyman
|
|
2019
|
260 |
C |
p. 28-50
|
artikel
|
Tijdschrift beschrijving