|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
24 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A potential reduction approach to the frequency assignment problem |
Warners, J.P. |
1997 |
78 | 1-3 |
p. 251-282 32 p. |
artikel |
|
| 2 | A special case for subset interconnection designs |
Ding-Zhu, Du |
1997 |
78 | 1-3 |
p. 51-60 10 p. |
artikel |
|
| 3 | Author index |
1997 |
78 | 1-3 |
p. 303-304 2 p. |
artikel |
||
| 4 | Book announcements |
1997 |
78 | 1-3 |
p. 299-302 4 p. |
artikel |
||
| 5 | Competition numbers of graphs with a small number of triangles |
Kim, Suh-Ryung |
1997 |
78 | 1-3 |
p. 153-162 10 p. |
artikel |
|
| 6 | Complexity of searching an immobile hider in a graph |
von Stengel, Bernhard |
1997 |
78 | 1-3 |
p. 235-249 15 p. |
artikel |
|
| 7 | Edge disjoint Polyp Packing |
Katona, Gyula Y. |
1997 |
78 | 1-3 |
p. 133-152 20 p. |
artikel |
|
| 8 | Editorial Board |
1997 |
78 | 1-3 |
p. iii-iv nvt p. |
artikel |
||
| 9 | Efficient computation of implicit representations of sparse graphs |
Arikati, Srinivasa R. |
1997 |
78 | 1-3 |
p. 1-16 16 p. |
artikel |
|
| 10 | Efficient generation of graphical partitions |
Barnes, Tiffany M. |
1997 |
78 | 1-3 |
p. 17-26 10 p. |
artikel |
|
| 11 | Embedding de Bruijn, Kautz and shuffle-exchange networks in books |
Hasunuma, Toru |
1997 |
78 | 1-3 |
p. 103-116 14 p. |
artikel |
|
| 12 | Fault-tolerant routings in double fixed-step networks |
Fabrega, J. |
1997 |
78 | 1-3 |
p. 61-74 14 p. |
artikel |
|
| 13 | Generalized bicycles |
Berman, Kenneth A. |
1997 |
78 | 1-3 |
p. 27-40 14 p. |
artikel |
|
| 14 | k-Path partitions in trees |
Yan, Jing-Ho |
1997 |
78 | 1-3 |
p. 227-233 7 p. |
artikel |
|
| 15 | Meyniel weakly triangulated graphs II: A theorem of Dirac |
Hayward, Ryan B. |
1997 |
78 | 1-3 |
p. 283-289 7 p. |
artikel |
|
| 16 | On minimum intersection of two minimum dominating sets of interval graphs |
Maw-Shang, Chang |
1997 |
78 | 1-3 |
p. 41-50 10 p. |
artikel |
|
| 17 | On 1-rate wide-sense nonblocking for 3-stage Clos networks |
Fishburn, Peter |
1997 |
78 | 1-3 |
p. 75-87 13 p. |
artikel |
|
| 18 | Open shop scheduling with maximal machines |
Kyparisis, George J. |
1997 |
78 | 1-3 |
p. 175-187 13 p. |
artikel |
|
| 19 | Optimal orientations of products of paths and cycles |
Koh, K.M. |
1997 |
78 | 1-3 |
p. 163-174 12 p. |
artikel |
|
| 20 | Paths with minimum range and ratio of arc lengths |
Hansen, Pierre |
1997 |
78 | 1-3 |
p. 89-102 14 p. |
artikel |
|
| 21 | Recognizing interval digraphs and interval bigraphs in polynomial time |
Müller, Haiko |
1997 |
78 | 1-3 |
p. 189-205 17 p. |
artikel |
|
| 22 | Scheduling imprecise computation tasks with 0 1 -constraint |
Ho, Kevin I-J. |
1997 |
78 | 1-3 |
p. 117-132 16 p. |
artikel |
|
| 23 | The point-to-point connection problem — analysis and algorithms |
Natu, Madan |
1997 |
78 | 1-3 |
p. 207-226 20 p. |
artikel |
|
| 24 | Two-segmented channel routing is strong NP-complete |
Wing Ning Li, |
1997 |
78 | 1-3 |
p. 291-298 8 p. |
artikel |
24 gevonden resultaten