|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
26 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A combinatorial problem in database security |
Horak, Peter |
1999 |
91 | 1-3 |
p. 119-126 8 p. |
artikel |
|
| 2 | A note on graphs with large girth and small minus domination number |
Lee, Jaeun |
1999 |
91 | 1-3 |
p. 299-303 5 p. |
artikel |
|
| 3 | Author index |
1999 |
91 | 1-3 |
p. 313-314 2 p. |
artikel |
||
| 4 | Call for papers |
1999 |
91 | 1-3 |
p. ix- 1 p. |
artikel |
||
| 5 | Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms |
Abbas, Nesrine |
1999 |
91 | 1-3 |
p. 1-23 23 p. |
artikel |
|
| 6 | Compatible Hamilton decompositions of directed wrapped butterfly graphs |
Verrall, H. |
1999 |
91 | 1-3 |
p. 265-275 11 p. |
artikel |
|
| 7 | Construction of a simple elimination scheme for a chordal comparability graph in linear time |
Borie, Richard B. |
1999 |
91 | 1-3 |
p. 287-292 6 p. |
artikel |
|
| 8 | Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems |
Righini, Giovanni |
1999 |
91 | 1-3 |
p. 235-242 8 p. |
artikel |
|
| 9 | Editorial Board |
1999 |
91 | 1-3 |
p. v-vi nvt p. |
artikel |
||
| 10 | Even and odd pairs in comparability and in P 4-comparability graphs |
de Figueiredo, Celina M.H. |
1999 |
91 | 1-3 |
p. 293-297 5 p. |
artikel |
|
| 11 | Generalized partitions of graphs |
MacGillivray, Gary |
1999 |
91 | 1-3 |
p. 143-153 11 p. |
artikel |
|
| 12 | Induced permutation automata and coverings of strongly connected automata |
Uemura, Kenji |
1999 |
91 | 1-3 |
p. 243-249 7 p. |
artikel |
|
| 13 | Inducing an order on cellular automata by a grouping operation |
Mazoyer, Jacques |
1999 |
91 | 1-3 |
p. 177-196 20 p. |
artikel |
|
| 14 | Matrices with maximum exponents in the class of doubly stochastic primitive matrices |
Zhou, Bo |
1999 |
91 | 1-3 |
p. 53-66 14 p. |
artikel |
|
| 15 | Minimal connected enclosures on an embedded planar graph |
Alexopoulos, Christos |
1999 |
91 | 1-3 |
p. 25-38 14 p. |
artikel |
|
| 16 | Minimizing broadcast costs under edge reductions in tree networks |
Hambrusch, Susanne E. |
1999 |
91 | 1-3 |
p. 93-117 25 p. |
artikel |
|
| 17 | On the algorithmic complexity of twelve covering and independence parameters of graphs |
Manlove, David F. |
1999 |
91 | 1-3 |
p. 155-175 21 p. |
artikel |
|
| 18 | On the complexity of postoptimality analysis of 0 1 programs |
Van Hoesel, Stan |
1999 |
91 | 1-3 |
p. 251-263 13 p. |
artikel |
|
| 19 | On the cut-off point for combinatorial group testing |
Fischer, Paul |
1999 |
91 | 1-3 |
p. 83-92 10 p. |
artikel |
|
| 20 | On the nonexistence of extremal self-dual codes |
Shengyuan, Zhang |
1999 |
91 | 1-3 |
p. 277-286 10 p. |
artikel |
|
| 21 | Optimal binary trees with order constraints |
Sebö, András |
1999 |
91 | 1-3 |
p. 305-311 7 p. |
artikel |
|
| 22 | Retractions of finite distance functions onto tree metrics |
Moulton, Vincent |
1999 |
91 | 1-3 |
p. 215-233 19 p. |
artikel |
|
| 23 | Separable partitions |
Alon, Noga |
1999 |
91 | 1-3 |
p. 39-51 13 p. |
artikel |
|
| 24 | Stabbing information of a simple polygon |
Everett, Hazel |
1999 |
91 | 1-3 |
p. 67-82 16 p. |
artikel |
|
| 25 | The b-chromatic number of a graph |
Irving, Robert W. |
1999 |
91 | 1-3 |
p. 127-141 15 p. |
artikel |
|
| 26 | Underdiagonal lattice paths with unrestricted steps |
Merlini, Donatella |
1999 |
91 | 1-3 |
p. 197-213 17 p. |
artikel |
26 gevonden resultaten