| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster parameterized algorithm for Pseudoforest Deletion
|
Bodlaender, Hans L.
|
|
2018
|
236 |
C |
p. 42-56
|
artikel
|
| 2 |
A hierarchical framework for recovery in compressive sensing
|
Colbourn, Charles J.
|
|
2018
|
236 |
C |
p. 96-107
|
artikel
|
| 3 |
Algorithmic aspects of rotor-routing and the notion of linear equivalence
|
Tóthmérész, Lilla
|
|
2018
|
236 |
C |
p. 428-437
|
artikel
|
| 4 |
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
|
Darties, Benoît
|
|
2018
|
236 |
C |
p. 124-136
|
artikel
|
| 5 |
Alternating kernels
|
Delgado-Escalante, Pietra
|
|
2018
|
236 |
C |
p. 153-164
|
artikel
|
| 6 |
A note on a directed version of the 1-2-3 Conjecture
|
Horňák, Mirko
|
|
2018
|
236 |
C |
p. 472-476
|
artikel
|
| 7 |
Characterizing minimally flat symmetric hypergraphs
|
Kaszanitzky, Viktória E.
|
|
2018
|
236 |
C |
p. 256-269
|
artikel
|
| 8 |
Edge-intersection graphs of boundary-generated paths in a grid
|
Golumbic, Martin Charles
|
|
2018
|
236 |
C |
p. 214-222
|
artikel
|
| 9 |
Editorial Board
|
|
|
2018
|
236 |
C |
p. ii
|
artikel
|
| 10 |
Erdős–Ko–Rado theorems for a family of trees
|
Feghali, Carl
|
|
2018
|
236 |
C |
p. 464-471
|
artikel
|
| 11 |
Extremal hypergraphs for matching number and domination number
|
Shan, Erfang
|
|
2018
|
236 |
C |
p. 415-421
|
artikel
|
| 12 |
First order sentences about random graphs: Small number of alternations
|
Matushkin, A.D.
|
|
2018
|
236 |
C |
p. 329-346
|
artikel
|
| 13 |
Functorial hierarchical clustering with overlaps
|
Culbertson, Jared
|
|
2018
|
236 |
C |
p. 108-123
|
artikel
|
| 14 |
Hamiltonian laceability in hypercubes with faulty edges
|
Wang, Fan
|
|
2018
|
236 |
C |
p. 438-445
|
artikel
|
| 15 |
Hamiltonicity of locally hamiltonian and locally traceable graphs
|
de Wet, Johan P.
|
|
2018
|
236 |
C |
p. 137-152
|
artikel
|
| 16 |
Independent Roman { 2 } -domination in graphs
|
Rahmouni, Abdelkader
|
|
2018
|
236 |
C |
p. 408-414
|
artikel
|
| 17 |
Maximum Weight Independent Sets for ( P 7 ,triangle)-free graphs in polynomial time
|
Brandstädt, Andreas
|
|
2018
|
236 |
C |
p. 57-65
|
artikel
|
| 18 |
Multi-player Small Nim with Passes
|
Liu, Wen An
|
|
2018
|
236 |
C |
p. 306-314
|
artikel
|
| 19 |
On non-existence of bent–negabent rotation symmetric Boolean functions
|
Mandal, Bimal
|
|
2018
|
236 |
C |
p. 1-6
|
artikel
|
| 20 |
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
|
Fernau, Henning
|
|
2018
|
236 |
C |
p. 183-202
|
artikel
|
| 21 |
On the existence of vertex-disjoint subgraphs with high degree sum
|
Chiba, Shuya
|
|
2018
|
236 |
C |
p. 84-95
|
artikel
|
| 22 |
On the game coloring index of F + -decomposable graphs
|
Charpentier, Clément
|
|
2018
|
236 |
C |
p. 73-83
|
artikel
|
| 23 |
On the secure domination numbers of maximal outerplanar graphs
|
Araki, Toru
|
|
2018
|
236 |
C |
p. 23-29
|
artikel
|
| 24 |
On upper bounds for the independent transversal domination number
|
Brause, Christoph
|
|
2018
|
236 |
C |
p. 66-72
|
artikel
|
| 25 |
Partially directed snake polyominoes
|
Goupil, Alain
|
|
2018
|
236 |
C |
p. 223-234
|
artikel
|
| 26 |
Perfect Roman domination in trees
|
Henning, Michael A.
|
|
2018
|
236 |
C |
p. 235-245
|
artikel
|
| 27 |
Randomized algorithms for finding the shortest negative cost cycle in networks
|
Orlin, James B.
|
|
2018
|
236 |
C |
p. 387-394
|
artikel
|
| 28 |
Some bounds on the zero forcing number of a graph
|
Gentner, Michael
|
|
2018
|
236 |
C |
p. 203-213
|
artikel
|
| 29 |
Some forbidden combinations of branches in minimal-ABC trees
|
Dimitrov, Darko
|
|
2018
|
236 |
C |
p. 165-182
|
artikel
|
| 30 |
Some problems on induced subgraphs
|
Sivaraman, Vaidy
|
|
2018
|
236 |
C |
p. 422-427
|
artikel
|
| 31 |
Some properties and applications of odd-colorable r -hypergraphs
|
Yuan, Xiying
|
|
2018
|
236 |
C |
p. 446-452
|
artikel
|
| 32 |
Strong resolving graphs: The realization and the characterization problems
|
Kuziak, Dorota
|
|
2018
|
236 |
C |
p. 270-287
|
artikel
|
| 33 |
Sublinear approximation algorithms for boxicity and related problems
|
Adiga, Abhijin
|
|
2018
|
236 |
C |
p. 7-22
|
artikel
|
| 34 |
Terminal-pairability in complete bipartite graphs
|
Colucci, Lucas
|
|
2018
|
236 |
C |
p. 459-463
|
artikel
|
| 35 |
The list distinguishing number of Kneser graphs
|
Balachandran, Niranjan
|
|
2018
|
236 |
C |
p. 30-41
|
artikel
|
| 36 |
The resistance perturbation distance: A metric for the analysis of dynamic networks
|
Monnig, Nathan D.
|
|
2018
|
236 |
C |
p. 347-386
|
artikel
|
| 37 |
Total domination stability in graphs
|
Henning, Michael A.
|
|
2018
|
236 |
C |
p. 246-255
|
artikel
|
| 38 |
Totally optimal decision rules
|
Amin, Talha
|
|
2018
|
236 |
C |
p. 453-458
|
artikel
|
| 39 |
Total rainbow connection of digraphs
|
Lei, Hui
|
|
2018
|
236 |
C |
p. 288-305
|
artikel
|
| 40 |
Tree spanners of bounded degree graphs
|
Papoutsakis, Ioannis
|
|
2018
|
236 |
C |
p. 395-407
|
artikel
|
| 41 |
Two degree-distance based topological descriptors of some product graphs
|
Malik, Mehar Ali
|
|
2018
|
236 |
C |
p. 315-328
|
artikel
|
Tijdschrift beschrijving