nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Combinatorics on update digraphs in Boolean networks
|
Aracena, J. |
|
2011 |
159 |
6 |
p. 401-409 9 p. |
artikel |
2 |
Contents
|
|
|
2011 |
159 |
6 |
p. v- 1 p. |
artikel |
3 |
Efficient synthesis of a class of Boolean programs from
I
-
O
data: Application to genetic networks
|
Charney, Ruth |
|
2011 |
159 |
6 |
p. 410-419 10 p. |
artikel |
4 |
Global secure sets of grid-like graphs
|
Ho, Yiu Yu |
|
2011 |
159 |
6 |
p. 490-496 7 p. |
artikel |
5 |
Noisy colored point set matching
|
Diez, Yago |
|
2011 |
159 |
6 |
p. 433-449 17 p. |
artikel |
6 |
On
n
-facility median problem with facilities subject to failure facing uniform demand
|
Berman, Oded |
|
2011 |
159 |
6 |
p. 420-432 13 p. |
artikel |
7 |
On the complexity of enumerating pseudo-intents
|
Distel, Felix |
|
2011 |
159 |
6 |
p. 450-466 17 p. |
artikel |
8 |
Open neighborhood locating–dominating in trees
|
Seo, Suk J. |
|
2011 |
159 |
6 |
p. 484-489 6 p. |
artikel |
9 |
Q
-ary Rényi–Ulam pathological liar game with one lie
|
Meng, Kun |
|
2011 |
159 |
6 |
p. 478-483 6 p. |
artikel |
10 |
Supereulerian graphs in the graph family
C
2
(
6
,
k
)
|
Lai, Hong-Jian |
|
2011 |
159 |
6 |
p. 467-477 11 p. |
artikel |