|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
11 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A limit characterization for the number of spanning trees of graphs |
Nikolopoulos, S.D. |
2004 |
90 | 6 |
p. 307-313 7 p. |
article |
|
| 2 | A lower bound for testing juntas |
Chockler, Hana |
2004 |
90 | 6 |
p. 301-305 5 p. |
article |
|
| 3 | An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint |
Breit, J. |
2004 |
90 | 6 |
p. 273-278 6 p. |
article |
|
| 4 | A single-point mutation evolutionary programming |
Ji, Mingjun |
2004 |
90 | 6 |
p. 293-299 7 p. |
article |
|
| 5 | Author Index — Volume 90 (2004) |
2004 |
90 | 6 |
p. 317-318 2 p. |
article |
||
| 6 | Board of Editors |
2004 |
90 | 6 |
p. IFC- 1 p. |
article |
||
| 7 | Master Index — Volumes 81–90 |
2004 |
90 | 6 |
p. 331-344 14 p. |
article |
||
| 8 | Master Subject Index — Volumes 81–90 |
2004 |
90 | 6 |
p. 319-330 12 p. |
article |
||
| 9 | New upper bounds on feedback vertex numbers in butterflies |
Chang, Maw-Shang |
2004 |
90 | 6 |
p. 279-285 7 p. |
article |
|
| 10 | Subject Index — Volume 90 (2004) |
2004 |
90 | 6 |
p. 315-316 2 p. |
article |
||
| 11 | Using a minimal number of resets when testing from a finite state machine |
Hierons, R.M. |
2004 |
90 | 6 |
p. 287-292 6 p. |
article |
11 results found