| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear-time algorithm for testing full outer-2-planarity
|
Hong, Seok-Hee
|
|
2019
|
255 |
C |
p. 234-257
|
artikel
|
| 2 |
An algorithm to find maximum area polygons circumscribed about a convex polygon
|
Ausserhofer, Markus
|
|
2019
|
255 |
C |
p. 98-108
|
artikel
|
| 3 |
A parameterization for a class of complete games with abstention
|
Freixas, Josep
|
|
2019
|
255 |
C |
p. 21-39
|
artikel
|
| 4 |
Complete colorings of planar graphs
|
Araujo-Pardo, G.
|
|
2019
|
255 |
C |
p. 86-97
|
artikel
|
| 5 |
Computing the P 3 -hull number of a graph, a polyhedral approach
|
Blaum, Manuela
|
|
2019
|
255 |
C |
p. 155-166
|
artikel
|
| 6 |
Editorial Board
|
|
|
2019
|
255 |
C |
p. ii
|
artikel
|
| 7 |
Extremal graphs for vertex-degree-based invariants with given degree sequences
|
Liu, Muhuo
|
|
2019
|
255 |
C |
p. 267-277
|
artikel
|
| 8 |
Facets for single module and multi-module capacitated lot-sizing problems without backlogging
|
Bansal, Manish
|
|
2019
|
255 |
C |
p. 117-141
|
artikel
|
| 9 |
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
|
Żak, Andrzej
|
|
2019
|
255 |
C |
p. 299-306
|
artikel
|
| 10 |
Kirchhoffian indices for weighted digraphs
|
Bianchi, Monica
|
|
2019
|
255 |
C |
p. 142-154
|
artikel
|
| 11 |
Majority coloring game
|
Bosek, Bartłomiej
|
|
2019
|
255 |
C |
p. 15-20
|
artikel
|
| 12 |
New combinatorial interpretations of r -Whitney and r -Whitney–Lah numbers
|
Gyimesi, Eszter
|
|
2019
|
255 |
C |
p. 222-233
|
artikel
|
| 13 |
On conflict-free connection of graphs
|
Chang, Hong
|
|
2019
|
255 |
C |
p. 167-182
|
artikel
|
| 14 |
One-Pile Nim games with arbitrarily many random players
|
Liu, Wen An
|
|
2019
|
255 |
C |
p. 56-74
|
artikel
|
| 15 |
On induced colourful paths in triangle-free graphs
|
Babu, Jasine
|
|
2019
|
255 |
C |
p. 109-116
|
artikel
|
| 16 |
On linear-time data dissemination in dynamic rooted trees
|
Zeiner, Martin
|
|
2019
|
255 |
C |
p. 307-319
|
artikel
|
| 17 |
On the largest matching roots of graphs with a given number of pendent vertices
|
Zhang, Hailiang
|
|
2019
|
255 |
C |
p. 339-344
|
artikel
|
| 18 |
On the minimal alphabet size in multidimensional unrepetitive configurations
|
Kenkireth, Benny George
|
|
2019
|
255 |
C |
p. 258-266
|
artikel
|
| 19 |
On the packing chromatic number of subcubic outerplanar graphs
|
Gastineau, Nicolas
|
|
2019
|
255 |
C |
p. 209-221
|
artikel
|
| 20 |
On the regularization of a cooperative solution in a multistage game with random time horizon
|
Gromova, E.V.
|
|
2019
|
255 |
C |
p. 40-55
|
artikel
|
| 21 |
On the submodularity of multi-depot traveling salesman games
|
Platz, Trine Tornøe
|
|
2019
|
255 |
C |
p. 75-85
|
artikel
|
| 22 |
Optimal ( t , r ) broadcasts on the infinite grid
|
Drews, Benjamin F.
|
|
2019
|
255 |
C |
p. 183-197
|
artikel
|
| 23 |
Prime power and prime product distance graphs
|
Kaneda, Yumi
|
|
2019
|
255 |
C |
p. 334-338
|
artikel
|
| 24 |
Projection and convolution operations for integrally convex functions
|
Moriguchi, Satoko
|
|
2019
|
255 |
C |
p. 283-298
|
artikel
|
| 25 |
Set-valued games and mixed-strategy equilibria in discounted supergames
|
Berg, Kimmo
|
|
2019
|
255 |
C |
p. 1-14
|
artikel
|
| 26 |
Spanning paths in graphs
|
Mafuta, Phillip
|
|
2019
|
255 |
C |
p. 278-282
|
artikel
|
| 27 |
Sufficient conditions for graphs with girth g to be maximally k -restricted edge connected
|
Zhang, Lei
|
|
2019
|
255 |
C |
p. 320-325
|
artikel
|
| 28 |
The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
|
Pleteršek, Petra Žigert
|
|
2019
|
255 |
C |
p. 326-333
|
artikel
|
| 29 |
Zero forcing in iterated line digraphs
|
Ferrero, Daniela
|
|
2019
|
255 |
C |
p. 198-208
|
artikel
|
Tijdschrift beschrijving