|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Combinatorics on update digraphs in Boolean networks |
Aracena, J. |
2011 |
159 | 6 |
p. 401-409 9 p. |
article |
|
| 2 | Contents |
2011 |
159 | 6 |
p. v- 1 p. |
article |
||
| 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. |
article |
|
| 4 | Global secure sets of grid-like graphs |
Ho, Yiu Yu |
2011 |
159 | 6 |
p. 490-496 7 p. |
article |
|
| 5 | Noisy colored point set matching |
Diez, Yago |
2011 |
159 | 6 |
p. 433-449 17 p. |
article |
|
| 6 | On n -facility median problem with facilities subject to failure facing uniform demand |
Berman, Oded |
2011 |
159 | 6 |
p. 420-432 13 p. |
article |
|
| 7 | On the complexity of enumerating pseudo-intents |
Distel, Felix |
2011 |
159 | 6 |
p. 450-466 17 p. |
article |
|
| 8 | Open neighborhood locating–dominating in trees |
Seo, Suk J. |
2011 |
159 | 6 |
p. 484-489 6 p. |
article |
|
| 9 | Q -ary Rényi–Ulam pathological liar game with one lie |
Meng, Kun |
2011 |
159 | 6 |
p. 478-483 6 p. |
article |
|
| 10 | Supereulerian graphs in the graph family C 2 ( 6 , k ) |
Lai, Hong-Jian |
2011 |
159 | 6 |
p. 467-477 11 p. |
article |
10 results found