| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An algorithmic metatheorem for directed treewidth
|
de Oliveira Oliveira, Mateus
|
|
2016
|
204 |
C |
p. 49-76
28 p.
|
artikel
|
| 2 |
An approximation algorithm for the longest cycle problem in solid grid graphs
|
Asgharian Sardroud, Asghar
|
|
2016
|
204 |
C |
p. 6-12
7 p.
|
artikel
|
| 3 |
Binary linear programming models for robust broadcasting in communication networks
|
McGarvey, Ronald G.
|
|
2016
|
204 |
C |
p. 173-184
12 p.
|
artikel
|
| 4 |
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
|
Brimkov, Boris
|
|
2016
|
204 |
C |
p. 13-21
9 p.
|
artikel
|
| 5 |
Contents
|
|
|
2016
|
204 |
C |
p. v-vi
nvt p.
|
artikel
|
| 6 |
Decision trees with minimum average depth for sorting eight elements
|
AbouEisha, Hassan
|
|
2016
|
204 |
C |
p. 203-207
5 p.
|
artikel
|
| 7 |
Kings and Heirs: A characterization of the ( 2 , 2 ) -domination graphs of tournaments
|
Factor, Kim A.S.
|
|
2016
|
204 |
C |
p. 142-149
8 p.
|
artikel
|
| 8 |
König graphs for 3-paths and 3-cycles
|
Alekseev, V.E.
|
|
2016
|
204 |
C |
p. 1-5
5 p.
|
artikel
|
| 9 |
Lower bounds on paraclique density
|
Hagan, Ronald D.
|
|
2016
|
204 |
C |
p. 208-212
5 p.
|
artikel
|
| 10 |
On computing the 2-vertex-connected components of directed graphs
|
Jaberi, Raed
|
|
2016
|
204 |
C |
p. 164-172
9 p.
|
artikel
|
| 11 |
On some three-color Ramsey numbers for paths
|
Dybizbański, Janusz
|
|
2016
|
204 |
C |
p. 133-141
9 p.
|
artikel
|
| 12 |
On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B 1 - and B 2 -branches
|
Dimitrov, Darko
|
|
2016
|
204 |
C |
p. 90-116
27 p.
|
artikel
|
| 13 |
On the competition graphs of d -partial orders
|
Choi, Jihoon
|
|
2016
|
204 |
C |
p. 29-37
9 p.
|
artikel
|
| 14 |
On the minimum and maximum selective graph coloring problems in some graph classes
|
Demange, Marc
|
|
2016
|
204 |
C |
p. 77-89
13 p.
|
artikel
|
| 15 |
Polynomial-time approximation algorithms for weighted LCS problem
|
Cygan, M.
|
|
2016
|
204 |
C |
p. 38-48
11 p.
|
artikel
|
| 16 |
Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing
|
Zhou, Yanwei
|
|
2016
|
204 |
C |
p. 185-202
18 p.
|
artikel
|
| 17 |
Roman { 2 } -domination
|
Chellali, Mustapha
|
|
2016
|
204 |
C |
p. 22-28
7 p.
|
artikel
|
| 18 |
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
|
He, Cheng
|
|
2016
|
204 |
C |
p. 150-163
14 p.
|
artikel
|
| 19 |
The contour of a bridged graph is geodetic
|
Mezzini, Mauro
|
|
2016
|
204 |
C |
p. 213-215
3 p.
|
artikel
|
| 20 |
The unassigned distance geometry problem
|
Duxbury, P.M.
|
|
2016
|
204 |
C |
p. 117-132
16 p.
|
artikel
|
| 21 |
Weak saturation number for multiple copies of the complete graph with a star removed
|
Pu, Liqun
|
|
2016
|
204 |
C |
p. 216-220
5 p.
|
artikel
|
Tijdschrift beschrijving