| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
|
Zhou, Peiyan
|
|
|
888 |
C |
p. 22-30
|
artikel
|
| 2 |
Cops and Robber on some families of oriented graphs
|
Das, Sandip
|
|
|
888 |
C |
p. 31-40
|
artikel
|
| 3 |
Editorial Board
|
|
|
|
888 |
C |
p. ii
|
artikel
|
| 4 |
Generic construction for tightly-secure signatures from discrete log
|
Lai, Jianchang
|
|
|
888 |
C |
p. 13-21
|
artikel
|
| 5 |
How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition
|
Lafourcade, Pascal
|
|
|
888 |
C |
p. 41-55
|
artikel
|
| 6 |
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes
|
Yang, Yuxing
|
|
|
888 |
C |
p. 108-116
|
artikel
|
| 7 |
On the effectiveness of the incremental approach to minimal chordal edge modification
|
Blair, Jean R.S.
|
|
|
888 |
C |
p. 1-12
|
artikel
|
| 8 |
On the proper orientation number of chordal graphs
|
Araujo, J.
|
|
|
888 |
C |
p. 117-132
|
artikel
|
| 9 |
Reliability analysis of the cactus-based networks
|
Liu, Jiafei
|
|
|
888 |
C |
p. 95-107
|
artikel
|
| 10 |
Satisfiability threshold for power law random 2-SAT in configuration model
|
Omelchenko, Oleksii
|
|
|
888 |
C |
p. 70-94
|
artikel
|
| 11 |
Which is the fairest allocation in the max-min fairness-based coalitional game?
|
Chen, Zheng
|
|
|
888 |
C |
p. 56-69
|
artikel
|
Tijdschrift beschrijving